./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/locks/test_locks_11.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_11.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 dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-21 00:02:12,417 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-21 00:02:12,420 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-21 00:02:12,458 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-21 00:02:12,459 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-21 00:02:12,463 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-21 00:02:12,465 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-21 00:02:12,469 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-21 00:02:12,471 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-21 00:02:12,477 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-21 00:02:12,478 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-21 00:02:12,480 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-21 00:02:12,480 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-21 00:02:12,483 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-21 00:02:12,484 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-21 00:02:12,488 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-21 00:02:12,490 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-21 00:02:12,490 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-21 00:02:12,493 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-21 00:02:12,501 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-21 00:02:12,502 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-21 00:02:12,504 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-21 00:02:12,505 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-21 00:02:12,506 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-21 00:02:12,509 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-21 00:02:12,509 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-21 00:02:12,510 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-21 00:02:12,512 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-21 00:02:12,512 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-21 00:02:12,513 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-21 00:02:12,514 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-21 00:02:12,515 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-21 00:02:12,517 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-21 00:02:12,518 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-21 00:02:12,520 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-21 00:02:12,520 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-21 00:02:12,520 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-21 00:02:12,521 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-21 00:02:12,521 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-21 00:02:12,522 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-21 00:02:12,522 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-21 00:02:12,523 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:12,557 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-21 00:02:12,559 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-21 00:02:12,560 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-21 00:02:12,561 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-21 00:02:12,562 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-21 00:02:12,562 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-21 00:02:12,562 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-21 00:02:12,563 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-21 00:02:12,563 INFO L138 SettingsManager]: * Use SBE=true [2022-02-21 00:02:12,563 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-21 00:02:12,564 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-21 00:02:12,564 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-21 00:02:12,564 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-21 00:02:12,565 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-21 00:02:12,565 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-21 00:02:12,565 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-21 00:02:12,565 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-21 00:02:12,565 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-21 00:02:12,565 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-21 00:02:12,566 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-21 00:02:12,566 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-21 00:02:12,566 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-21 00:02:12,566 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-21 00:02:12,566 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-21 00:02:12,567 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-21 00:02:12,567 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:12,567 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-21 00:02:12,567 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-21 00:02:12,568 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-21 00:02:12,568 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-21 00:02:12,568 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 -> dd9c6b82321d3b192dc5809ecc7ca6021855509a18ab1d23ca9eeb538976a0c0 [2022-02-21 00:02:12,859 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-21 00:02:12,892 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-21 00:02:12,895 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-21 00:02:12,896 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-21 00:02:12,897 INFO L275 PluginConnector]: CDTParser initialized [2022-02-21 00:02:12,899 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/locks/test_locks_11.c [2022-02-21 00:02:12,959 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbebd489/2f30f9837fd9413a9082176c28a79f72/FLAG69fc03c2c [2022-02-21 00:02:13,413 INFO L306 CDTParser]: Found 1 translation units. [2022-02-21 00:02:13,413 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c [2022-02-21 00:02:13,421 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbebd489/2f30f9837fd9413a9082176c28a79f72/FLAG69fc03c2c [2022-02-21 00:02:13,817 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/acbebd489/2f30f9837fd9413a9082176c28a79f72 [2022-02-21 00:02:13,819 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-21 00:02:13,821 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-21 00:02:13,823 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:13,823 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-21 00:02:13,826 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-21 00:02:13,828 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:13" (1/1) ... [2022-02-21 00:02:13,829 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@503a25c6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:13, skipping insertion in model container [2022-02-21 00:02:13,830 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 21.02 12:02:13" (1/1) ... [2022-02-21 00:02:13,836 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-21 00:02:13,851 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-21 00:02:14,043 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/locks/test_locks_11.c[4246,4259] [2022-02-21 00:02:14,047 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:14,055 INFO L203 MainTranslator]: Completed pre-run [2022-02-21 00:02:14,076 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_11.c[4246,4259] [2022-02-21 00:02:14,078 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-21 00:02:14,090 INFO L208 MainTranslator]: Completed translation [2022-02-21 00:02:14,091 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:14 WrapperNode [2022-02-21 00:02:14,091 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-21 00:02:14,092 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:14,092 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-21 00:02:14,092 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-21 00:02:14,098 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:14" (1/1) ... [2022-02-21 00:02:14,105 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:14" (1/1) ... [2022-02-21 00:02:14,128 INFO L137 Inliner]: procedures = 12, calls = 7, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 149 [2022-02-21 00:02:14,128 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-21 00:02:14,129 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-21 00:02:14,129 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-21 00:02:14,129 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-21 00:02:14,137 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:14" (1/1) ... [2022-02-21 00:02:14,138 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:14" (1/1) ... [2022-02-21 00:02:14,148 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:14" (1/1) ... [2022-02-21 00:02:14,149 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:14" (1/1) ... [2022-02-21 00:02:14,153 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:14" (1/1) ... [2022-02-21 00:02:14,166 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:14" (1/1) ... [2022-02-21 00:02:14,171 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:14" (1/1) ... [2022-02-21 00:02:14,179 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-21 00:02:14,180 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-21 00:02:14,181 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-21 00:02:14,181 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-21 00:02:14,182 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:14" (1/1) ... [2022-02-21 00:02:14,193 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-21 00:02:14,204 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-21 00:02:14,229 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:14,240 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:14,302 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-21 00:02:14,303 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-21 00:02:14,303 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-21 00:02:14,303 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-21 00:02:14,410 INFO L234 CfgBuilder]: Building ICFG [2022-02-21 00:02:14,412 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-21 00:02:14,869 INFO L275 CfgBuilder]: Performing block encoding [2022-02-21 00:02:14,875 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-21 00:02:14,876 INFO L299 CfgBuilder]: Removed 1 assume(true) statements. [2022-02-21 00:02:14,878 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:14 BoogieIcfgContainer [2022-02-21 00:02:14,878 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-21 00:02:14,880 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-21 00:02:14,880 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-21 00:02:14,884 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-21 00:02:14,884 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 21.02 12:02:13" (1/3) ... [2022-02-21 00:02:14,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710a3287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:14, skipping insertion in model container [2022-02-21 00:02:14,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 21.02 12:02:14" (2/3) ... [2022-02-21 00:02:14,886 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@710a3287 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 21.02 12:02:14, skipping insertion in model container [2022-02-21 00:02:14,886 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 21.02 12:02:14" (3/3) ... [2022-02-21 00:02:14,888 INFO L111 eAbstractionObserver]: Analyzing ICFG test_locks_11.c [2022-02-21 00:02:14,895 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-21 00:02:14,895 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 2 error locations. [2022-02-21 00:02:14,950 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-21 00:02:14,976 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:14,977 INFO L340 AbstractCegarLoop]: Starting to check reachability of 2 error locations. [2022-02-21 00:02:15,008 INFO L276 IsEmpty]: Start isEmpty. Operand has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:15,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-21 00:02:15,014 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:15,014 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-21 00:02:15,015 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:15,020 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:15,021 INFO L85 PathProgramCache]: Analyzing trace with hash 28704011, now seen corresponding path program 1 times [2022-02-21 00:02:15,044 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:15,045 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512603738] [2022-02-21 00:02:15,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:15,046 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:15,163 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:15,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {47#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {47#true} is VALID [2022-02-21 00:02:15,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {47#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {47#true} is VALID [2022-02-21 00:02:15,240 INFO L290 TraceCheckUtils]: 2: Hoare triple {47#true} assume false; {48#false} is VALID [2022-02-21 00:02:15,241 INFO L290 TraceCheckUtils]: 3: Hoare triple {48#false} main_#res#1 := 0; {48#false} is VALID [2022-02-21 00:02:15,241 INFO L290 TraceCheckUtils]: 4: Hoare triple {48#false} assume !(#valid == main_old_#valid#1); {48#false} is VALID [2022-02-21 00:02:15,243 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:15,244 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:15,244 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512603738] [2022-02-21 00:02:15,245 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512603738] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:15,245 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:15,246 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:15,247 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457532656] [2022-02-21 00:02:15,248 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:15,253 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:15,254 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:15,258 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:15,284 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:15,284 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-21 00:02:15,284 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:15,306 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-21 00:02:15,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-21 00:02:15,311 INFO L87 Difference]: Start difference. First operand has 44 states, 41 states have (on average 1.9268292682926829) internal successors, (79), 43 states have internal predecessors, (79), 0 states have call successors, (0), 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:15,388 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,390 INFO L93 Difference]: Finished difference Result 44 states and 76 transitions. [2022-02-21 00:02:15,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-21 00:02:15,390 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:15,391 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:15,392 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:15,404 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2022-02-21 00:02:15,405 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:15,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 79 transitions. [2022-02-21 00:02:15,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 79 transitions. [2022-02-21 00:02:15,486 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 79 edges. 79 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:15,503 INFO L225 Difference]: With dead ends: 44 [2022-02-21 00:02:15,503 INFO L226 Difference]: Without dead ends: 42 [2022-02-21 00:02:15,505 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:15,509 INFO L933 BasicCegarLoop]: 76 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, 76 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:15,510 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 76 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:15,525 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2022-02-21 00:02:15,536 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 42. [2022-02-21 00:02:15,536 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:15,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 42 states. Second operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 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:15,538 INFO L74 IsIncluded]: Start isIncluded. First operand 42 states. Second operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 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:15,539 INFO L87 Difference]: Start difference. First operand 42 states. Second operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 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:15,541 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,542 INFO L93 Difference]: Finished difference Result 42 states and 74 transitions. [2022-02-21 00:02:15,542 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-02-21 00:02:15,542 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:15,543 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:15,543 INFO L74 IsIncluded]: Start isIncluded. First operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 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 42 states. [2022-02-21 00:02:15,544 INFO L87 Difference]: Start difference. First operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 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 42 states. [2022-02-21 00:02:15,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,546 INFO L93 Difference]: Finished difference Result 42 states and 74 transitions. [2022-02-21 00:02:15,546 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-02-21 00:02:15,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:15,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:15,547 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:15,548 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:15,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 42 states, 40 states have (on average 1.85) internal successors, (74), 41 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:15,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42 states to 42 states and 74 transitions. [2022-02-21 00:02:15,554 INFO L78 Accepts]: Start accepts. Automaton has 42 states and 74 transitions. Word has length 5 [2022-02-21 00:02:15,554 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:15,554 INFO L470 AbstractCegarLoop]: Abstraction has 42 states and 74 transitions. [2022-02-21 00:02:15,554 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:15,555 INFO L276 IsEmpty]: Start isEmpty. Operand 42 states and 74 transitions. [2022-02-21 00:02:15,555 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-21 00:02:15,555 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:15,555 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-21 00:02:15,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-21 00:02:15,556 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:15,557 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:15,557 INFO L85 PathProgramCache]: Analyzing trace with hash 889698507, now seen corresponding path program 1 times [2022-02-21 00:02:15,557 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:15,557 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [200471833] [2022-02-21 00:02:15,557 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:15,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:15,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:15,602 INFO L290 TraceCheckUtils]: 0: Hoare triple {221#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {221#true} is VALID [2022-02-21 00:02:15,604 INFO L290 TraceCheckUtils]: 1: Hoare triple {221#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:15,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:15,606 INFO L290 TraceCheckUtils]: 3: Hoare triple {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 == main_~cond~0#1; {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:15,606 INFO L290 TraceCheckUtils]: 4: Hoare triple {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-21 00:02:15,607 INFO L290 TraceCheckUtils]: 5: Hoare triple {223#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {222#false} is VALID [2022-02-21 00:02:15,607 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:15,607 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:15,607 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [200471833] [2022-02-21 00:02:15,608 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [200471833] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:15,608 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:15,608 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-21 00:02:15,608 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1725946049] [2022-02-21 00:02:15,609 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:15,610 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:15,610 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:15,610 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:15,616 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:15,617 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:15,617 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:15,618 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:15,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:15,618 INFO L87 Difference]: Start difference. First operand 42 states and 74 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:15,677 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,678 INFO L93 Difference]: Finished difference Result 41 states and 73 transitions. [2022-02-21 00:02:15,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:15,678 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:15,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:15,678 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:15,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:15,680 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:15,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 74 transitions. [2022-02-21 00:02:15,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 74 transitions. [2022-02-21 00:02:15,744 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:15,745 INFO L225 Difference]: With dead ends: 41 [2022-02-21 00:02:15,745 INFO L226 Difference]: Without dead ends: 39 [2022-02-21 00:02:15,746 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:15,747 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 68 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 1 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 73 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:15,747 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [68 Valid, 73 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:15,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 39 states. [2022-02-21 00:02:15,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 39 to 39. [2022-02-21 00:02:15,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:15,751 INFO L82 GeneralOperation]: Start isEquivalent. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:15,752 INFO L74 IsIncluded]: Start isIncluded. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:15,752 INFO L87 Difference]: Start difference. First operand 39 states. Second operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:15,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,754 INFO L93 Difference]: Finished difference Result 39 states and 71 transitions. [2022-02-21 00:02:15,754 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2022-02-21 00:02:15,755 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:15,755 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:15,755 INFO L74 IsIncluded]: Start isIncluded. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 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 39 states. [2022-02-21 00:02:15,756 INFO L87 Difference]: Start difference. First operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 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 39 states. [2022-02-21 00:02:15,758 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,758 INFO L93 Difference]: Finished difference Result 39 states and 71 transitions. [2022-02-21 00:02:15,758 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2022-02-21 00:02:15,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:15,759 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:15,759 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:15,759 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:15,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 39 states, 38 states have (on average 1.868421052631579) internal successors, (71), 38 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:15,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 71 transitions. [2022-02-21 00:02:15,761 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 71 transitions. Word has length 6 [2022-02-21 00:02:15,761 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:15,761 INFO L470 AbstractCegarLoop]: Abstraction has 39 states and 71 transitions. [2022-02-21 00:02:15,762 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:15,762 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 71 transitions. [2022-02-21 00:02:15,762 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:15,762 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:15,763 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:15,763 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-21 00:02:15,763 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:15,764 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:15,764 INFO L85 PathProgramCache]: Analyzing trace with hash 458919617, now seen corresponding path program 1 times [2022-02-21 00:02:15,764 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:15,764 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533623486] [2022-02-21 00:02:15,764 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:15,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:15,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:15,813 INFO L290 TraceCheckUtils]: 0: Hoare triple {384#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {384#true} is VALID [2022-02-21 00:02:15,813 INFO L290 TraceCheckUtils]: 1: Hoare triple {384#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {384#true} is VALID [2022-02-21 00:02:15,814 INFO L290 TraceCheckUtils]: 2: Hoare triple {384#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {384#true} is VALID [2022-02-21 00:02:15,814 INFO L290 TraceCheckUtils]: 3: Hoare triple {384#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {384#true} is VALID [2022-02-21 00:02:15,815 INFO L290 TraceCheckUtils]: 4: Hoare triple {384#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,815 INFO L290 TraceCheckUtils]: 5: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,816 INFO L290 TraceCheckUtils]: 6: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p3~0#1); {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,816 INFO L290 TraceCheckUtils]: 7: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,817 INFO L290 TraceCheckUtils]: 8: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,817 INFO L290 TraceCheckUtils]: 9: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,818 INFO L290 TraceCheckUtils]: 10: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,818 INFO L290 TraceCheckUtils]: 11: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,819 INFO L290 TraceCheckUtils]: 12: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,819 INFO L290 TraceCheckUtils]: 13: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,820 INFO L290 TraceCheckUtils]: 14: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume !(0 != main_~p11~0#1); {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,820 INFO L290 TraceCheckUtils]: 15: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 0 != main_~p1~0#1; {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} is VALID [2022-02-21 00:02:15,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {386#(= |ULTIMATE.start_main_~lk1~0#1| 1)} assume 1 != main_~lk1~0#1; {385#false} is VALID [2022-02-21 00:02:15,821 INFO L290 TraceCheckUtils]: 17: Hoare triple {385#false} assume !false; {385#false} is VALID [2022-02-21 00:02:15,821 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:15,821 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:15,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533623486] [2022-02-21 00:02:15,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533623486] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:15,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:15,822 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:15,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2052794374] [2022-02-21 00:02:15,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:15,823 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:15,824 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:15,824 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:15,840 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:15,840 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:15,840 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:15,841 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:15,841 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:15,842 INFO L87 Difference]: Start difference. First operand 39 states and 71 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:15,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:15,923 INFO L93 Difference]: Finished difference Result 75 states and 137 transitions. [2022-02-21 00:02:15,923 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:15,924 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:15,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:15,924 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:15,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-21 00:02:15,927 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:15,928 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 138 transitions. [2022-02-21 00:02:15,928 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 138 transitions. [2022-02-21 00:02:16,030 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 138 edges. 138 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:16,032 INFO L225 Difference]: With dead ends: 75 [2022-02-21 00:02:16,032 INFO L226 Difference]: Without dead ends: 75 [2022-02-21 00:02:16,033 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:16,034 INFO L933 BasicCegarLoop]: 73 mSDtfsCounter, 53 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 139 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:16,035 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 139 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:16,035 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-21 00:02:16,039 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 51. [2022-02-21 00:02:16,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:16,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,040 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,040 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,043 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,043 INFO L93 Difference]: Finished difference Result 75 states and 137 transitions. [2022-02-21 00:02:16,044 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 137 transitions. [2022-02-21 00:02:16,044 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,044 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,045 INFO L74 IsIncluded]: Start isIncluded. First operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 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 75 states. [2022-02-21 00:02:16,045 INFO L87 Difference]: Start difference. First operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 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 75 states. [2022-02-21 00:02:16,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,048 INFO L93 Difference]: Finished difference Result 75 states and 137 transitions. [2022-02-21 00:02:16,048 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 137 transitions. [2022-02-21 00:02:16,049 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,049 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,049 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:16,049 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:16,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 51 states, 50 states have (on average 1.88) internal successors, (94), 50 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 94 transitions. [2022-02-21 00:02:16,052 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 94 transitions. Word has length 18 [2022-02-21 00:02:16,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:16,052 INFO L470 AbstractCegarLoop]: Abstraction has 51 states and 94 transitions. [2022-02-21 00:02:16,053 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:16,053 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 94 transitions. [2022-02-21 00:02:16,054 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-21 00:02:16,054 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:16,054 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:16,054 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-21 00:02:16,055 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:16,055 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:16,055 INFO L85 PathProgramCache]: Analyzing trace with hash -552197633, now seen corresponding path program 1 times [2022-02-21 00:02:16,056 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:16,056 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [868842145] [2022-02-21 00:02:16,056 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:16,056 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:16,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:16,099 INFO L290 TraceCheckUtils]: 0: Hoare triple {665#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {665#true} is VALID [2022-02-21 00:02:16,100 INFO L290 TraceCheckUtils]: 1: Hoare triple {665#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {665#true} is VALID [2022-02-21 00:02:16,100 INFO L290 TraceCheckUtils]: 2: Hoare triple {665#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {665#true} is VALID [2022-02-21 00:02:16,100 INFO L290 TraceCheckUtils]: 3: Hoare triple {665#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {665#true} is VALID [2022-02-21 00:02:16,101 INFO L290 TraceCheckUtils]: 4: Hoare triple {665#true} assume !(0 != main_~p1~0#1); {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,101 INFO L290 TraceCheckUtils]: 5: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,102 INFO L290 TraceCheckUtils]: 6: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p3~0#1); {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,102 INFO L290 TraceCheckUtils]: 7: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,103 INFO L290 TraceCheckUtils]: 8: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,103 INFO L290 TraceCheckUtils]: 9: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,104 INFO L290 TraceCheckUtils]: 10: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,104 INFO L290 TraceCheckUtils]: 11: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,105 INFO L290 TraceCheckUtils]: 12: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,105 INFO L290 TraceCheckUtils]: 13: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,106 INFO L290 TraceCheckUtils]: 14: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume !(0 != main_~p11~0#1); {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} is VALID [2022-02-21 00:02:16,106 INFO L290 TraceCheckUtils]: 15: Hoare triple {667#(= |ULTIMATE.start_main_~p1~0#1| 0)} assume 0 != main_~p1~0#1; {666#false} is VALID [2022-02-21 00:02:16,106 INFO L290 TraceCheckUtils]: 16: Hoare triple {666#false} assume 1 != main_~lk1~0#1; {666#false} is VALID [2022-02-21 00:02:16,106 INFO L290 TraceCheckUtils]: 17: Hoare triple {666#false} assume !false; {666#false} is VALID [2022-02-21 00:02:16,107 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:16,107 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:16,107 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [868842145] [2022-02-21 00:02:16,107 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [868842145] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:16,108 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:16,108 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:16,108 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1234466309] [2022-02-21 00:02:16,108 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:16,109 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:16,109 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:16,109 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:16,123 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:16,123 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:16,124 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:16,124 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:16,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:16,125 INFO L87 Difference]: Start difference. First operand 51 states and 94 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:16,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,262 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2022-02-21 00:02:16,262 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:16,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:16,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:16,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:16,264 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-21 00:02:16,264 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:16,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 137 transitions. [2022-02-21 00:02:16,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 137 transitions. [2022-02-21 00:02:16,396 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 137 edges. 137 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:16,398 INFO L225 Difference]: With dead ends: 75 [2022-02-21 00:02:16,398 INFO L226 Difference]: Without dead ends: 75 [2022-02-21 00:02:16,398 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:16,399 INFO L933 BasicCegarLoop]: 92 mSDtfsCounter, 53 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 53 SdHoareTripleChecker+Valid, 157 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:16,400 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [53 Valid, 157 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:16,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2022-02-21 00:02:16,404 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 73. [2022-02-21 00:02:16,404 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:16,404 INFO L82 GeneralOperation]: Start isEquivalent. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,405 INFO L74 IsIncluded]: Start isIncluded. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,405 INFO L87 Difference]: Start difference. First operand 75 states. Second operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,407 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2022-02-21 00:02:16,407 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2022-02-21 00:02:16,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,408 INFO L74 IsIncluded]: Start isIncluded. First operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 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 75 states. [2022-02-21 00:02:16,409 INFO L87 Difference]: Start difference. First operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 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 75 states. [2022-02-21 00:02:16,411 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,411 INFO L93 Difference]: Finished difference Result 75 states and 135 transitions. [2022-02-21 00:02:16,412 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 135 transitions. [2022-02-21 00:02:16,412 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,412 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,412 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:16,413 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:16,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 73 states, 72 states have (on average 1.8611111111111112) internal successors, (134), 72 states have internal predecessors, (134), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 73 states to 73 states and 134 transitions. [2022-02-21 00:02:16,415 INFO L78 Accepts]: Start accepts. Automaton has 73 states and 134 transitions. Word has length 18 [2022-02-21 00:02:16,415 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:16,416 INFO L470 AbstractCegarLoop]: Abstraction has 73 states and 134 transitions. [2022-02-21 00:02:16,416 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:16,416 INFO L276 IsEmpty]: Start isEmpty. Operand 73 states and 134 transitions. [2022-02-21 00:02:16,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:16,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:16,417 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:16,417 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-21 00:02:16,417 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:16,418 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:16,418 INFO L85 PathProgramCache]: Analyzing trace with hash 1341819263, now seen corresponding path program 1 times [2022-02-21 00:02:16,418 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:16,418 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1648910412] [2022-02-21 00:02:16,418 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:16,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:16,437 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:16,456 INFO L290 TraceCheckUtils]: 0: Hoare triple {968#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {968#true} is VALID [2022-02-21 00:02:16,457 INFO L290 TraceCheckUtils]: 1: Hoare triple {968#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {968#true} is VALID [2022-02-21 00:02:16,457 INFO L290 TraceCheckUtils]: 2: Hoare triple {968#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {968#true} is VALID [2022-02-21 00:02:16,457 INFO L290 TraceCheckUtils]: 3: Hoare triple {968#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {968#true} is VALID [2022-02-21 00:02:16,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {968#true} assume 0 != main_~p1~0#1;main_~lk1~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,458 INFO L290 TraceCheckUtils]: 5: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p3~0#1); {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,460 INFO L290 TraceCheckUtils]: 9: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,460 INFO L290 TraceCheckUtils]: 10: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,461 INFO L290 TraceCheckUtils]: 13: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p11~0#1); {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} is VALID [2022-02-21 00:02:16,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {970#(not (= |ULTIMATE.start_main_~p1~0#1| 0))} assume !(0 != main_~p1~0#1); {969#false} is VALID [2022-02-21 00:02:16,462 INFO L290 TraceCheckUtils]: 16: Hoare triple {969#false} assume 0 != main_~p2~0#1; {969#false} is VALID [2022-02-21 00:02:16,463 INFO L290 TraceCheckUtils]: 17: Hoare triple {969#false} assume 1 != main_~lk2~0#1; {969#false} is VALID [2022-02-21 00:02:16,463 INFO L290 TraceCheckUtils]: 18: Hoare triple {969#false} assume !false; {969#false} is VALID [2022-02-21 00:02:16,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:16,463 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:16,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1648910412] [2022-02-21 00:02:16,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1648910412] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:16,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:16,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:16,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [435086188] [2022-02-21 00:02:16,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:16,465 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:16,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:16,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,478 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:16,479 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:16,479 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:16,479 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:16,479 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:16,480 INFO L87 Difference]: Start difference. First operand 73 states and 134 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,571 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,571 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2022-02-21 00:02:16,571 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:16,571 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:16,572 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:16,572 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,573 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-21 00:02:16,574 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 136 transitions. [2022-02-21 00:02:16,575 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 136 transitions. [2022-02-21 00:02:16,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 136 edges. 136 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:16,671 INFO L225 Difference]: With dead ends: 78 [2022-02-21 00:02:16,671 INFO L226 Difference]: Without dead ends: 78 [2022-02-21 00:02:16,671 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:16,672 INFO L933 BasicCegarLoop]: 112 mSDtfsCounter, 55 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 176 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:16,672 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [55 Valid, 176 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:16,673 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2022-02-21 00:02:16,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 76. [2022-02-21 00:02:16,677 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:16,677 INFO L82 GeneralOperation]: Start isEquivalent. First operand 78 states. Second operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,678 INFO L74 IsIncluded]: Start isIncluded. First operand 78 states. Second operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,678 INFO L87 Difference]: Start difference. First operand 78 states. Second operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,680 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2022-02-21 00:02:16,680 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2022-02-21 00:02:16,681 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,681 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 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 78 states. [2022-02-21 00:02:16,687 INFO L87 Difference]: Start difference. First operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 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 78 states. [2022-02-21 00:02:16,689 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,691 INFO L93 Difference]: Finished difference Result 78 states and 137 transitions. [2022-02-21 00:02:16,691 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 137 transitions. [2022-02-21 00:02:16,692 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,692 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,692 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:16,692 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:16,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 75 states have (on average 1.8133333333333332) internal successors, (136), 75 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,695 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 136 transitions. [2022-02-21 00:02:16,695 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 136 transitions. Word has length 19 [2022-02-21 00:02:16,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:16,696 INFO L470 AbstractCegarLoop]: Abstraction has 76 states and 136 transitions. [2022-02-21 00:02:16,696 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,696 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 136 transitions. [2022-02-21 00:02:16,697 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:16,697 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:16,697 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:16,698 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-21 00:02:16,698 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:16,699 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:16,699 INFO L85 PathProgramCache]: Analyzing trace with hash 61955585, now seen corresponding path program 1 times [2022-02-21 00:02:16,699 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:16,699 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1594784502] [2022-02-21 00:02:16,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:16,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:16,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:16,760 INFO L290 TraceCheckUtils]: 0: Hoare triple {1283#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1283#true} is VALID [2022-02-21 00:02:16,761 INFO L290 TraceCheckUtils]: 1: Hoare triple {1283#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {1283#true} is VALID [2022-02-21 00:02:16,761 INFO L290 TraceCheckUtils]: 2: Hoare triple {1283#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1283#true} is VALID [2022-02-21 00:02:16,761 INFO L290 TraceCheckUtils]: 3: Hoare triple {1283#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {1283#true} is VALID [2022-02-21 00:02:16,762 INFO L290 TraceCheckUtils]: 4: Hoare triple {1283#true} assume !(0 != main_~p1~0#1); {1283#true} is VALID [2022-02-21 00:02:16,762 INFO L290 TraceCheckUtils]: 5: Hoare triple {1283#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,763 INFO L290 TraceCheckUtils]: 6: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p3~0#1); {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,763 INFO L290 TraceCheckUtils]: 7: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,763 INFO L290 TraceCheckUtils]: 8: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,764 INFO L290 TraceCheckUtils]: 9: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,764 INFO L290 TraceCheckUtils]: 10: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,765 INFO L290 TraceCheckUtils]: 11: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,765 INFO L290 TraceCheckUtils]: 12: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,765 INFO L290 TraceCheckUtils]: 13: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,766 INFO L290 TraceCheckUtils]: 14: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p11~0#1); {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,766 INFO L290 TraceCheckUtils]: 15: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume !(0 != main_~p1~0#1); {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,766 INFO L290 TraceCheckUtils]: 16: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 0 != main_~p2~0#1; {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} is VALID [2022-02-21 00:02:16,767 INFO L290 TraceCheckUtils]: 17: Hoare triple {1285#(= |ULTIMATE.start_main_~lk2~0#1| 1)} assume 1 != main_~lk2~0#1; {1284#false} is VALID [2022-02-21 00:02:16,767 INFO L290 TraceCheckUtils]: 18: Hoare triple {1284#false} assume !false; {1284#false} is VALID [2022-02-21 00:02:16,767 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:16,768 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:16,768 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1594784502] [2022-02-21 00:02:16,768 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1594784502] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:16,768 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:16,768 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:16,768 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265290597] [2022-02-21 00:02:16,769 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:16,769 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:16,769 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:16,769 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,781 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:16,782 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:16,782 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:16,783 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:16,783 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:16,783 INFO L87 Difference]: Start difference. First operand 76 states and 136 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,849 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,850 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2022-02-21 00:02:16,850 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:16,850 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:16,850 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:16,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,852 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:16,852 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,853 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:16,854 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-21 00:02:16,940 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:16,943 INFO L225 Difference]: With dead ends: 143 [2022-02-21 00:02:16,943 INFO L226 Difference]: Without dead ends: 143 [2022-02-21 00:02:16,944 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:16,945 INFO L933 BasicCegarLoop]: 72 mSDtfsCounter, 50 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 137 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:16,945 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 137 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:16,946 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2022-02-21 00:02:16,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 101. [2022-02-21 00:02:16,954 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:16,954 INFO L82 GeneralOperation]: Start isEquivalent. First operand 143 states. Second operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,955 INFO L74 IsIncluded]: Start isIncluded. First operand 143 states. Second operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,955 INFO L87 Difference]: Start difference. First operand 143 states. Second operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,960 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2022-02-21 00:02:16,960 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 258 transitions. [2022-02-21 00:02:16,960 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,960 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,961 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 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 143 states. [2022-02-21 00:02:16,961 INFO L87 Difference]: Start difference. First operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 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 143 states. [2022-02-21 00:02:16,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:16,966 INFO L93 Difference]: Finished difference Result 143 states and 258 transitions. [2022-02-21 00:02:16,966 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 258 transitions. [2022-02-21 00:02:16,966 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:16,967 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:16,967 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:16,967 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:16,967 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 100 states have (on average 1.81) internal successors, (181), 100 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 181 transitions. [2022-02-21 00:02:16,970 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 181 transitions. Word has length 19 [2022-02-21 00:02:16,970 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:16,971 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 181 transitions. [2022-02-21 00:02:16,971 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 181 transitions. [2022-02-21 00:02:16,971 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-21 00:02:16,971 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:16,972 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:16,972 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-21 00:02:16,972 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:16,972 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:16,973 INFO L85 PathProgramCache]: Analyzing trace with hash -949161665, now seen corresponding path program 1 times [2022-02-21 00:02:16,973 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:16,973 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739818446] [2022-02-21 00:02:16,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:16,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:16,990 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:17,016 INFO L290 TraceCheckUtils]: 0: Hoare triple {1818#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {1818#true} is VALID [2022-02-21 00:02:17,017 INFO L290 TraceCheckUtils]: 1: Hoare triple {1818#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {1818#true} is VALID [2022-02-21 00:02:17,017 INFO L290 TraceCheckUtils]: 2: Hoare triple {1818#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {1818#true} is VALID [2022-02-21 00:02:17,017 INFO L290 TraceCheckUtils]: 3: Hoare triple {1818#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {1818#true} is VALID [2022-02-21 00:02:17,018 INFO L290 TraceCheckUtils]: 4: Hoare triple {1818#true} assume !(0 != main_~p1~0#1); {1818#true} is VALID [2022-02-21 00:02:17,018 INFO L290 TraceCheckUtils]: 5: Hoare triple {1818#true} assume !(0 != main_~p2~0#1); {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,018 INFO L290 TraceCheckUtils]: 6: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p3~0#1); {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,019 INFO L290 TraceCheckUtils]: 7: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,019 INFO L290 TraceCheckUtils]: 8: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,020 INFO L290 TraceCheckUtils]: 9: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,020 INFO L290 TraceCheckUtils]: 10: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,021 INFO L290 TraceCheckUtils]: 12: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,021 INFO L290 TraceCheckUtils]: 13: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p11~0#1); {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,022 INFO L290 TraceCheckUtils]: 15: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume !(0 != main_~p1~0#1); {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} is VALID [2022-02-21 00:02:17,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {1820#(= |ULTIMATE.start_main_~p2~0#1| 0)} assume 0 != main_~p2~0#1; {1819#false} is VALID [2022-02-21 00:02:17,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {1819#false} assume 1 != main_~lk2~0#1; {1819#false} is VALID [2022-02-21 00:02:17,023 INFO L290 TraceCheckUtils]: 18: Hoare triple {1819#false} assume !false; {1819#false} is VALID [2022-02-21 00:02:17,023 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:17,023 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:17,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739818446] [2022-02-21 00:02:17,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739818446] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:17,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:17,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:17,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883542768] [2022-02-21 00:02:17,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:17,024 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:17,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:17,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,038 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,038 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:17,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:17,039 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:17,039 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:17,039 INFO L87 Difference]: Start difference. First operand 101 states and 181 transitions. Second operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,123 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2022-02-21 00:02:17,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:17,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-21 00:02:17,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:17,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-21 00:02:17,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 135 transitions. [2022-02-21 00:02:17,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 135 transitions. [2022-02-21 00:02:17,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 135 edges. 135 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,232 INFO L225 Difference]: With dead ends: 145 [2022-02-21 00:02:17,232 INFO L226 Difference]: Without dead ends: 145 [2022-02-21 00:02:17,233 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:17,234 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 158 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:17,234 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 158 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:17,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2022-02-21 00:02:17,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 143. [2022-02-21 00:02:17,240 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:17,240 INFO L82 GeneralOperation]: Start isEquivalent. First operand 145 states. Second operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,241 INFO L74 IsIncluded]: Start isIncluded. First operand 145 states. Second operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,241 INFO L87 Difference]: Start difference. First operand 145 states. Second operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,245 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2022-02-21 00:02:17,246 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 256 transitions. [2022-02-21 00:02:17,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:17,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:17,247 INFO L74 IsIncluded]: Start isIncluded. First operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 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 145 states. [2022-02-21 00:02:17,247 INFO L87 Difference]: Start difference. First operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 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 145 states. [2022-02-21 00:02:17,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,251 INFO L93 Difference]: Finished difference Result 145 states and 256 transitions. [2022-02-21 00:02:17,251 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 256 transitions. [2022-02-21 00:02:17,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:17,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:17,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:17,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:17,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 142 states have (on average 1.795774647887324) internal successors, (255), 142 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,256 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 255 transitions. [2022-02-21 00:02:17,257 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 255 transitions. Word has length 19 [2022-02-21 00:02:17,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:17,257 INFO L470 AbstractCegarLoop]: Abstraction has 143 states and 255 transitions. [2022-02-21 00:02:17,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.333333333333333) internal successors, (19), 3 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,257 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 255 transitions. [2022-02-21 00:02:17,258 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:17,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:17,258 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:17,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-21 00:02:17,258 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:17,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:17,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1920836500, now seen corresponding path program 1 times [2022-02-21 00:02:17,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:17,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1272033478] [2022-02-21 00:02:17,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:17,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:17,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:17,291 INFO L290 TraceCheckUtils]: 0: Hoare triple {2401#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2401#true} is VALID [2022-02-21 00:02:17,292 INFO L290 TraceCheckUtils]: 1: Hoare triple {2401#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {2401#true} is VALID [2022-02-21 00:02:17,292 INFO L290 TraceCheckUtils]: 2: Hoare triple {2401#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {2401#true} is VALID [2022-02-21 00:02:17,292 INFO L290 TraceCheckUtils]: 3: Hoare triple {2401#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {2401#true} is VALID [2022-02-21 00:02:17,292 INFO L290 TraceCheckUtils]: 4: Hoare triple {2401#true} assume !(0 != main_~p1~0#1); {2401#true} is VALID [2022-02-21 00:02:17,293 INFO L290 TraceCheckUtils]: 5: Hoare triple {2401#true} assume 0 != main_~p2~0#1;main_~lk2~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,293 INFO L290 TraceCheckUtils]: 6: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p3~0#1); {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,294 INFO L290 TraceCheckUtils]: 7: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,294 INFO L290 TraceCheckUtils]: 8: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,294 INFO L290 TraceCheckUtils]: 9: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,295 INFO L290 TraceCheckUtils]: 10: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,295 INFO L290 TraceCheckUtils]: 11: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,296 INFO L290 TraceCheckUtils]: 12: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,296 INFO L290 TraceCheckUtils]: 13: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,296 INFO L290 TraceCheckUtils]: 14: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p11~0#1); {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,297 INFO L290 TraceCheckUtils]: 15: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p1~0#1); {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} is VALID [2022-02-21 00:02:17,297 INFO L290 TraceCheckUtils]: 16: Hoare triple {2403#(not (= |ULTIMATE.start_main_~p2~0#1| 0))} assume !(0 != main_~p2~0#1); {2402#false} is VALID [2022-02-21 00:02:17,297 INFO L290 TraceCheckUtils]: 17: Hoare triple {2402#false} assume 0 != main_~p3~0#1; {2402#false} is VALID [2022-02-21 00:02:17,297 INFO L290 TraceCheckUtils]: 18: Hoare triple {2402#false} assume 1 != main_~lk3~0#1; {2402#false} is VALID [2022-02-21 00:02:17,298 INFO L290 TraceCheckUtils]: 19: Hoare triple {2402#false} assume !false; {2402#false} is VALID [2022-02-21 00:02:17,298 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:17,298 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:17,298 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1272033478] [2022-02-21 00:02:17,298 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1272033478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:17,299 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:17,299 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:17,299 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [79194599] [2022-02-21 00:02:17,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:17,300 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:17,300 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:17,300 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,313 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,314 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:17,314 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:17,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:17,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:17,315 INFO L87 Difference]: Start difference. First operand 143 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,432 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2022-02-21 00:02:17,432 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:17,433 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:17,433 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:17,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,434 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:17,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:17,443 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-21 00:02:17,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,533 INFO L225 Difference]: With dead ends: 147 [2022-02-21 00:02:17,533 INFO L226 Difference]: Without dead ends: 147 [2022-02-21 00:02:17,534 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:17,534 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 54 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 172 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:17,535 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [54 Valid, 172 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:17,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2022-02-21 00:02:17,539 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 145. [2022-02-21 00:02:17,539 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:17,540 INFO L82 GeneralOperation]: Start isEquivalent. First operand 147 states. Second operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,540 INFO L74 IsIncluded]: Start isIncluded. First operand 147 states. Second operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,541 INFO L87 Difference]: Start difference. First operand 147 states. Second operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,555 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,555 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2022-02-21 00:02:17,555 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 256 transitions. [2022-02-21 00:02:17,555 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:17,555 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:17,556 INFO L74 IsIncluded]: Start isIncluded. First operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 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 147 states. [2022-02-21 00:02:17,556 INFO L87 Difference]: Start difference. First operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 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 147 states. [2022-02-21 00:02:17,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,560 INFO L93 Difference]: Finished difference Result 147 states and 256 transitions. [2022-02-21 00:02:17,560 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 256 transitions. [2022-02-21 00:02:17,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:17,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:17,561 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:17,561 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:17,562 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 144 states have (on average 1.7708333333333333) internal successors, (255), 144 states have internal predecessors, (255), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 255 transitions. [2022-02-21 00:02:17,565 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 255 transitions. Word has length 20 [2022-02-21 00:02:17,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:17,578 INFO L470 AbstractCegarLoop]: Abstraction has 145 states and 255 transitions. [2022-02-21 00:02:17,578 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,579 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 255 transitions. [2022-02-21 00:02:17,579 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:17,579 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:17,579 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:17,579 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-21 00:02:17,580 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:17,580 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:17,580 INFO L85 PathProgramCache]: Analyzing trace with hash 640972822, now seen corresponding path program 1 times [2022-02-21 00:02:17,580 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:17,580 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1244891485] [2022-02-21 00:02:17,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:17,581 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:17,596 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:17,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {2992#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {2992#true} is VALID [2022-02-21 00:02:17,610 INFO L290 TraceCheckUtils]: 1: Hoare triple {2992#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {2992#true} is VALID [2022-02-21 00:02:17,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {2992#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {2992#true} is VALID [2022-02-21 00:02:17,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {2992#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {2992#true} is VALID [2022-02-21 00:02:17,611 INFO L290 TraceCheckUtils]: 4: Hoare triple {2992#true} assume !(0 != main_~p1~0#1); {2992#true} is VALID [2022-02-21 00:02:17,611 INFO L290 TraceCheckUtils]: 5: Hoare triple {2992#true} assume !(0 != main_~p2~0#1); {2992#true} is VALID [2022-02-21 00:02:17,612 INFO L290 TraceCheckUtils]: 6: Hoare triple {2992#true} assume !(0 != main_~p3~0#1); {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,612 INFO L290 TraceCheckUtils]: 7: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,612 INFO L290 TraceCheckUtils]: 8: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,613 INFO L290 TraceCheckUtils]: 9: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,613 INFO L290 TraceCheckUtils]: 10: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,613 INFO L290 TraceCheckUtils]: 11: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,614 INFO L290 TraceCheckUtils]: 12: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,614 INFO L290 TraceCheckUtils]: 13: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,615 INFO L290 TraceCheckUtils]: 14: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p11~0#1); {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,615 INFO L290 TraceCheckUtils]: 15: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p1~0#1); {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,615 INFO L290 TraceCheckUtils]: 16: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume !(0 != main_~p2~0#1); {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} is VALID [2022-02-21 00:02:17,616 INFO L290 TraceCheckUtils]: 17: Hoare triple {2994#(= |ULTIMATE.start_main_~p3~0#1| 0)} assume 0 != main_~p3~0#1; {2993#false} is VALID [2022-02-21 00:02:17,616 INFO L290 TraceCheckUtils]: 18: Hoare triple {2993#false} assume 1 != main_~lk3~0#1; {2993#false} is VALID [2022-02-21 00:02:17,616 INFO L290 TraceCheckUtils]: 19: Hoare triple {2993#false} assume !false; {2993#false} is VALID [2022-02-21 00:02:17,616 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:17,617 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:17,617 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1244891485] [2022-02-21 00:02:17,617 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1244891485] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:17,617 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:17,617 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:17,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1208547501] [2022-02-21 00:02:17,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:17,618 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:17,618 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:17,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,630 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:17,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:17,631 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:17,632 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:17,632 INFO L87 Difference]: Start difference. First operand 145 states and 255 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,699 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,699 INFO L93 Difference]: Finished difference Result 279 states and 484 transitions. [2022-02-21 00:02:17,699 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:17,700 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:17,700 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:17,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,701 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:17,702 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 134 transitions. [2022-02-21 00:02:17,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 134 transitions. [2022-02-21 00:02:17,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,820 INFO L225 Difference]: With dead ends: 279 [2022-02-21 00:02:17,821 INFO L226 Difference]: Without dead ends: 279 [2022-02-21 00:02:17,821 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:17,822 INFO L933 BasicCegarLoop]: 75 mSDtfsCounter, 52 mSDsluCounter, 64 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 139 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:17,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 139 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:17,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 279 states. [2022-02-21 00:02:17,829 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 279 to 277. [2022-02-21 00:02:17,829 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:17,830 INFO L82 GeneralOperation]: Start isEquivalent. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,830 INFO L74 IsIncluded]: Start isIncluded. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,831 INFO L87 Difference]: Start difference. First operand 279 states. Second operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,838 INFO L93 Difference]: Finished difference Result 279 states and 484 transitions. [2022-02-21 00:02:17,838 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 484 transitions. [2022-02-21 00:02:17,839 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:17,839 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:17,840 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 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 279 states. [2022-02-21 00:02:17,840 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 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 279 states. [2022-02-21 00:02:17,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:17,856 INFO L93 Difference]: Finished difference Result 279 states and 484 transitions. [2022-02-21 00:02:17,857 INFO L276 IsEmpty]: Start isEmpty. Operand 279 states and 484 transitions. [2022-02-21 00:02:17,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:17,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:17,857 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:17,858 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:17,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.75) internal successors, (483), 276 states have internal predecessors, (483), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 483 transitions. [2022-02-21 00:02:17,865 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 483 transitions. Word has length 20 [2022-02-21 00:02:17,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:17,866 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 483 transitions. [2022-02-21 00:02:17,866 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,866 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 483 transitions. [2022-02-21 00:02:17,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-21 00:02:17,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:17,867 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:17,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-21 00:02:17,867 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:17,867 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:17,868 INFO L85 PathProgramCache]: Analyzing trace with hash 1652090072, now seen corresponding path program 1 times [2022-02-21 00:02:17,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:17,868 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [320457826] [2022-02-21 00:02:17,868 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:17,868 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:17,892 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:17,933 INFO L290 TraceCheckUtils]: 0: Hoare triple {4111#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {4111#true} is VALID [2022-02-21 00:02:17,933 INFO L290 TraceCheckUtils]: 1: Hoare triple {4111#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {4111#true} is VALID [2022-02-21 00:02:17,933 INFO L290 TraceCheckUtils]: 2: Hoare triple {4111#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {4111#true} is VALID [2022-02-21 00:02:17,933 INFO L290 TraceCheckUtils]: 3: Hoare triple {4111#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {4111#true} is VALID [2022-02-21 00:02:17,934 INFO L290 TraceCheckUtils]: 4: Hoare triple {4111#true} assume !(0 != main_~p1~0#1); {4111#true} is VALID [2022-02-21 00:02:17,934 INFO L290 TraceCheckUtils]: 5: Hoare triple {4111#true} assume !(0 != main_~p2~0#1); {4111#true} is VALID [2022-02-21 00:02:17,935 INFO L290 TraceCheckUtils]: 6: Hoare triple {4111#true} assume 0 != main_~p3~0#1;main_~lk3~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,935 INFO L290 TraceCheckUtils]: 7: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,936 INFO L290 TraceCheckUtils]: 9: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,937 INFO L290 TraceCheckUtils]: 13: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p11~0#1); {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,938 INFO L290 TraceCheckUtils]: 15: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p1~0#1); {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,938 INFO L290 TraceCheckUtils]: 16: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume !(0 != main_~p2~0#1); {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,939 INFO L290 TraceCheckUtils]: 17: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 0 != main_~p3~0#1; {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} is VALID [2022-02-21 00:02:17,939 INFO L290 TraceCheckUtils]: 18: Hoare triple {4113#(= |ULTIMATE.start_main_~lk3~0#1| 1)} assume 1 != main_~lk3~0#1; {4112#false} is VALID [2022-02-21 00:02:17,939 INFO L290 TraceCheckUtils]: 19: Hoare triple {4112#false} assume !false; {4112#false} is VALID [2022-02-21 00:02:17,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:17,939 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:17,940 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [320457826] [2022-02-21 00:02:17,940 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [320457826] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:17,940 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:17,940 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:17,940 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [204505382] [2022-02-21 00:02:17,940 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:17,940 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:17,940 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:17,940 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:17,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:17,954 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:17,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:17,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:17,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:17,955 INFO L87 Difference]: Start difference. First operand 277 states and 483 transitions. Second operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,044 INFO L93 Difference]: Finished difference Result 351 states and 616 transitions. [2022-02-21 00:02:18,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:18,045 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-21 00:02:18,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:18,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-21 00:02:18,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-21 00:02:18,048 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-21 00:02:18,136 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:18,143 INFO L225 Difference]: With dead ends: 351 [2022-02-21 00:02:18,144 INFO L226 Difference]: Without dead ends: 351 [2022-02-21 00:02:18,144 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:18,145 INFO L933 BasicCegarLoop]: 125 mSDtfsCounter, 47 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 188 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:18,145 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 188 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:18,146 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 351 states. [2022-02-21 00:02:18,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 351 to 277. [2022-02-21 00:02:18,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:18,156 INFO L82 GeneralOperation]: Start isEquivalent. First operand 351 states. Second operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,156 INFO L74 IsIncluded]: Start isIncluded. First operand 351 states. Second operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,157 INFO L87 Difference]: Start difference. First operand 351 states. Second operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,166 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,166 INFO L93 Difference]: Finished difference Result 351 states and 616 transitions. [2022-02-21 00:02:18,167 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 616 transitions. [2022-02-21 00:02:18,167 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,167 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,168 INFO L74 IsIncluded]: Start isIncluded. First operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 351 states. [2022-02-21 00:02:18,169 INFO L87 Difference]: Start difference. First operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 351 states. [2022-02-21 00:02:18,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,178 INFO L93 Difference]: Finished difference Result 351 states and 616 transitions. [2022-02-21 00:02:18,179 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 616 transitions. [2022-02-21 00:02:18,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,180 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,180 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:18,180 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:18,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 277 states, 276 states have (on average 1.7355072463768115) internal successors, (479), 276 states have internal predecessors, (479), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 277 states to 277 states and 479 transitions. [2022-02-21 00:02:18,187 INFO L78 Accepts]: Start accepts. Automaton has 277 states and 479 transitions. Word has length 20 [2022-02-21 00:02:18,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:18,188 INFO L470 AbstractCegarLoop]: Abstraction has 277 states and 479 transitions. [2022-02-21 00:02:18,188 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 6.666666666666667) internal successors, (20), 3 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,188 INFO L276 IsEmpty]: Start isEmpty. Operand 277 states and 479 transitions. [2022-02-21 00:02:18,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:18,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:18,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:18,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-21 00:02:18,189 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:18,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:18,190 INFO L85 PathProgramCache]: Analyzing trace with hash -1604465292, now seen corresponding path program 1 times [2022-02-21 00:02:18,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:18,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [218831468] [2022-02-21 00:02:18,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:18,191 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:18,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:18,220 INFO L290 TraceCheckUtils]: 0: Hoare triple {5446#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {5446#true} is VALID [2022-02-21 00:02:18,221 INFO L290 TraceCheckUtils]: 1: Hoare triple {5446#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {5446#true} is VALID [2022-02-21 00:02:18,221 INFO L290 TraceCheckUtils]: 2: Hoare triple {5446#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {5446#true} is VALID [2022-02-21 00:02:18,221 INFO L290 TraceCheckUtils]: 3: Hoare triple {5446#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {5446#true} is VALID [2022-02-21 00:02:18,222 INFO L290 TraceCheckUtils]: 4: Hoare triple {5446#true} assume !(0 != main_~p1~0#1); {5446#true} is VALID [2022-02-21 00:02:18,222 INFO L290 TraceCheckUtils]: 5: Hoare triple {5446#true} assume !(0 != main_~p2~0#1); {5446#true} is VALID [2022-02-21 00:02:18,222 INFO L290 TraceCheckUtils]: 6: Hoare triple {5446#true} assume !(0 != main_~p3~0#1); {5446#true} is VALID [2022-02-21 00:02:18,223 INFO L290 TraceCheckUtils]: 7: Hoare triple {5446#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,223 INFO L290 TraceCheckUtils]: 8: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,223 INFO L290 TraceCheckUtils]: 9: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,224 INFO L290 TraceCheckUtils]: 10: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,224 INFO L290 TraceCheckUtils]: 11: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,225 INFO L290 TraceCheckUtils]: 12: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,225 INFO L290 TraceCheckUtils]: 13: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,225 INFO L290 TraceCheckUtils]: 14: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p11~0#1); {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p1~0#1); {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,226 INFO L290 TraceCheckUtils]: 16: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p2~0#1); {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume !(0 != main_~p3~0#1); {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 0 != main_~p4~0#1; {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} is VALID [2022-02-21 00:02:18,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {5448#(= |ULTIMATE.start_main_~lk4~0#1| 1)} assume 1 != main_~lk4~0#1; {5447#false} is VALID [2022-02-21 00:02:18,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {5447#false} assume !false; {5447#false} is VALID [2022-02-21 00:02:18,228 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:18,228 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:18,228 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [218831468] [2022-02-21 00:02:18,228 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [218831468] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:18,228 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:18,229 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:18,229 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1375885753] [2022-02-21 00:02:18,229 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:18,229 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:18,230 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:18,230 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,243 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:18,244 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:18,244 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:18,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:18,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:18,245 INFO L87 Difference]: Start difference. First operand 277 states and 479 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,320 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,320 INFO L93 Difference]: Finished difference Result 515 states and 896 transitions. [2022-02-21 00:02:18,320 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:18,321 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:18,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:18,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 00:02:18,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 00:02:18,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-21 00:02:18,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:18,410 INFO L225 Difference]: With dead ends: 515 [2022-02-21 00:02:18,410 INFO L226 Difference]: Without dead ends: 515 [2022-02-21 00:02:18,411 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:18,411 INFO L933 BasicCegarLoop]: 70 mSDtfsCounter, 44 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 44 SdHoareTripleChecker+Valid, 133 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:18,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [44 Valid, 133 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:18,412 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 515 states. [2022-02-21 00:02:18,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 515 to 385. [2022-02-21 00:02:18,419 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:18,420 INFO L82 GeneralOperation]: Start isEquivalent. First operand 515 states. Second operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,421 INFO L74 IsIncluded]: Start isIncluded. First operand 515 states. Second operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,422 INFO L87 Difference]: Start difference. First operand 515 states. Second operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,437 INFO L93 Difference]: Finished difference Result 515 states and 896 transitions. [2022-02-21 00:02:18,437 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 896 transitions. [2022-02-21 00:02:18,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,439 INFO L74 IsIncluded]: Start isIncluded. First operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 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 515 states. [2022-02-21 00:02:18,440 INFO L87 Difference]: Start difference. First operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 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 515 states. [2022-02-21 00:02:18,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,456 INFO L93 Difference]: Finished difference Result 515 states and 896 transitions. [2022-02-21 00:02:18,456 INFO L276 IsEmpty]: Start isEmpty. Operand 515 states and 896 transitions. [2022-02-21 00:02:18,457 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,457 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,457 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:18,457 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:18,458 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 385 states, 384 states have (on average 1.7057291666666667) internal successors, (655), 384 states have internal predecessors, (655), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 385 states to 385 states and 655 transitions. [2022-02-21 00:02:18,468 INFO L78 Accepts]: Start accepts. Automaton has 385 states and 655 transitions. Word has length 21 [2022-02-21 00:02:18,468 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:18,468 INFO L470 AbstractCegarLoop]: Abstraction has 385 states and 655 transitions. [2022-02-21 00:02:18,468 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,468 INFO L276 IsEmpty]: Start isEmpty. Operand 385 states and 655 transitions. [2022-02-21 00:02:18,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-21 00:02:18,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:18,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:18,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-21 00:02:18,470 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:18,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:18,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1679384754, now seen corresponding path program 1 times [2022-02-21 00:02:18,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:18,471 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1036968496] [2022-02-21 00:02:18,471 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:18,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:18,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:18,497 INFO L290 TraceCheckUtils]: 0: Hoare triple {7381#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {7381#true} is VALID [2022-02-21 00:02:18,498 INFO L290 TraceCheckUtils]: 1: Hoare triple {7381#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {7381#true} is VALID [2022-02-21 00:02:18,498 INFO L290 TraceCheckUtils]: 2: Hoare triple {7381#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {7381#true} is VALID [2022-02-21 00:02:18,498 INFO L290 TraceCheckUtils]: 3: Hoare triple {7381#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {7381#true} is VALID [2022-02-21 00:02:18,498 INFO L290 TraceCheckUtils]: 4: Hoare triple {7381#true} assume !(0 != main_~p1~0#1); {7381#true} is VALID [2022-02-21 00:02:18,498 INFO L290 TraceCheckUtils]: 5: Hoare triple {7381#true} assume !(0 != main_~p2~0#1); {7381#true} is VALID [2022-02-21 00:02:18,499 INFO L290 TraceCheckUtils]: 6: Hoare triple {7381#true} assume !(0 != main_~p3~0#1); {7381#true} is VALID [2022-02-21 00:02:18,499 INFO L290 TraceCheckUtils]: 7: Hoare triple {7381#true} assume !(0 != main_~p4~0#1); {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,500 INFO L290 TraceCheckUtils]: 8: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,500 INFO L290 TraceCheckUtils]: 9: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,501 INFO L290 TraceCheckUtils]: 10: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,501 INFO L290 TraceCheckUtils]: 11: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,501 INFO L290 TraceCheckUtils]: 12: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,502 INFO L290 TraceCheckUtils]: 13: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,502 INFO L290 TraceCheckUtils]: 14: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p11~0#1); {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,502 INFO L290 TraceCheckUtils]: 15: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p1~0#1); {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,503 INFO L290 TraceCheckUtils]: 16: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p2~0#1); {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,503 INFO L290 TraceCheckUtils]: 17: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume !(0 != main_~p3~0#1); {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} is VALID [2022-02-21 00:02:18,503 INFO L290 TraceCheckUtils]: 18: Hoare triple {7383#(= |ULTIMATE.start_main_~p4~0#1| 0)} assume 0 != main_~p4~0#1; {7382#false} is VALID [2022-02-21 00:02:18,504 INFO L290 TraceCheckUtils]: 19: Hoare triple {7382#false} assume 1 != main_~lk4~0#1; {7382#false} is VALID [2022-02-21 00:02:18,504 INFO L290 TraceCheckUtils]: 20: Hoare triple {7382#false} assume !false; {7382#false} is VALID [2022-02-21 00:02:18,504 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:18,504 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:18,504 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1036968496] [2022-02-21 00:02:18,504 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1036968496] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:18,505 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:18,505 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:18,505 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1063379503] [2022-02-21 00:02:18,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:18,505 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:18,506 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:18,506 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:18,519 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:18,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:18,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:18,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:18,520 INFO L87 Difference]: Start difference. First operand 385 states and 655 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,601 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,602 INFO L93 Difference]: Finished difference Result 539 states and 908 transitions. [2022-02-21 00:02:18,602 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:18,602 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-21 00:02:18,602 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:18,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-21 00:02:18,604 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 131 transitions. [2022-02-21 00:02:18,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 131 transitions. [2022-02-21 00:02:18,699 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 131 edges. 131 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:18,713 INFO L225 Difference]: With dead ends: 539 [2022-02-21 00:02:18,713 INFO L226 Difference]: Without dead ends: 539 [2022-02-21 00:02:18,714 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:18,714 INFO L933 BasicCegarLoop]: 98 mSDtfsCounter, 50 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 160 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:18,715 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 160 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:18,716 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 539 states. [2022-02-21 00:02:18,735 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 539 to 537. [2022-02-21 00:02:18,736 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:18,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 539 states. Second operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,738 INFO L74 IsIncluded]: Start isIncluded. First operand 539 states. Second operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,739 INFO L87 Difference]: Start difference. First operand 539 states. Second operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,756 INFO L93 Difference]: Finished difference Result 539 states and 908 transitions. [2022-02-21 00:02:18,756 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 908 transitions. [2022-02-21 00:02:18,757 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,759 INFO L74 IsIncluded]: Start isIncluded. First operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 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 539 states. [2022-02-21 00:02:18,760 INFO L87 Difference]: Start difference. First operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 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 539 states. [2022-02-21 00:02:18,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,777 INFO L93 Difference]: Finished difference Result 539 states and 908 transitions. [2022-02-21 00:02:18,777 INFO L276 IsEmpty]: Start isEmpty. Operand 539 states and 908 transitions. [2022-02-21 00:02:18,778 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:18,778 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:18,778 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:18,778 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:18,780 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 537 states, 536 states have (on average 1.6921641791044777) internal successors, (907), 536 states have internal predecessors, (907), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,796 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 537 states to 537 states and 907 transitions. [2022-02-21 00:02:18,797 INFO L78 Accepts]: Start accepts. Automaton has 537 states and 907 transitions. Word has length 21 [2022-02-21 00:02:18,797 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:18,797 INFO L470 AbstractCegarLoop]: Abstraction has 537 states and 907 transitions. [2022-02-21 00:02:18,797 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,798 INFO L276 IsEmpty]: Start isEmpty. Operand 537 states and 907 transitions. [2022-02-21 00:02:18,798 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:18,798 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:18,798 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:18,799 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-21 00:02:18,799 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:18,799 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:18,800 INFO L85 PathProgramCache]: Analyzing trace with hash 1801397547, now seen corresponding path program 1 times [2022-02-21 00:02:18,800 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:18,800 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1779418861] [2022-02-21 00:02:18,800 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:18,800 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:18,815 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:18,828 INFO L290 TraceCheckUtils]: 0: Hoare triple {9540#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {9540#true} is VALID [2022-02-21 00:02:18,828 INFO L290 TraceCheckUtils]: 1: Hoare triple {9540#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {9540#true} is VALID [2022-02-21 00:02:18,828 INFO L290 TraceCheckUtils]: 2: Hoare triple {9540#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {9540#true} is VALID [2022-02-21 00:02:18,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {9540#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {9540#true} is VALID [2022-02-21 00:02:18,828 INFO L290 TraceCheckUtils]: 4: Hoare triple {9540#true} assume !(0 != main_~p1~0#1); {9540#true} is VALID [2022-02-21 00:02:18,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {9540#true} assume !(0 != main_~p2~0#1); {9540#true} is VALID [2022-02-21 00:02:18,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {9540#true} assume !(0 != main_~p3~0#1); {9540#true} is VALID [2022-02-21 00:02:18,829 INFO L290 TraceCheckUtils]: 7: Hoare triple {9540#true} assume 0 != main_~p4~0#1;main_~lk4~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,830 INFO L290 TraceCheckUtils]: 8: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,831 INFO L290 TraceCheckUtils]: 12: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,831 INFO L290 TraceCheckUtils]: 13: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,832 INFO L290 TraceCheckUtils]: 14: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p11~0#1); {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,832 INFO L290 TraceCheckUtils]: 15: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p1~0#1); {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,832 INFO L290 TraceCheckUtils]: 16: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p2~0#1); {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,833 INFO L290 TraceCheckUtils]: 17: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p3~0#1); {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} is VALID [2022-02-21 00:02:18,833 INFO L290 TraceCheckUtils]: 18: Hoare triple {9542#(not (= |ULTIMATE.start_main_~p4~0#1| 0))} assume !(0 != main_~p4~0#1); {9541#false} is VALID [2022-02-21 00:02:18,833 INFO L290 TraceCheckUtils]: 19: Hoare triple {9541#false} assume 0 != main_~p5~0#1; {9541#false} is VALID [2022-02-21 00:02:18,833 INFO L290 TraceCheckUtils]: 20: Hoare triple {9541#false} assume 1 != main_~lk5~0#1; {9541#false} is VALID [2022-02-21 00:02:18,834 INFO L290 TraceCheckUtils]: 21: Hoare triple {9541#false} assume !false; {9541#false} is VALID [2022-02-21 00:02:18,834 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:18,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:18,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1779418861] [2022-02-21 00:02:18,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1779418861] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:18,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:18,835 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:18,835 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1517943097] [2022-02-21 00:02:18,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:18,835 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:18,836 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:18,836 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,849 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:18,849 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:18,850 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:18,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:18,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:18,850 INFO L87 Difference]: Start difference. First operand 537 states and 907 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:18,934 INFO L93 Difference]: Finished difference Result 551 states and 916 transitions. [2022-02-21 00:02:18,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:18,934 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:18,935 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:18,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-02-21 00:02:18,936 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:18,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 130 transitions. [2022-02-21 00:02:18,937 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 130 transitions. [2022-02-21 00:02:19,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 130 edges. 130 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:19,028 INFO L225 Difference]: With dead ends: 551 [2022-02-21 00:02:19,028 INFO L226 Difference]: Without dead ends: 551 [2022-02-21 00:02:19,029 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:19,029 INFO L933 BasicCegarLoop]: 103 mSDtfsCounter, 52 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 164 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:19,030 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [52 Valid, 164 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:19,031 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 551 states. [2022-02-21 00:02:19,038 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 551 to 549. [2022-02-21 00:02:19,039 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:19,040 INFO L82 GeneralOperation]: Start isEquivalent. First operand 551 states. Second operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,041 INFO L74 IsIncluded]: Start isIncluded. First operand 551 states. Second operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,042 INFO L87 Difference]: Start difference. First operand 551 states. Second operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,058 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,058 INFO L93 Difference]: Finished difference Result 551 states and 916 transitions. [2022-02-21 00:02:19,058 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 916 transitions. [2022-02-21 00:02:19,059 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:19,059 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:19,061 INFO L74 IsIncluded]: Start isIncluded. First operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 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 551 states. [2022-02-21 00:02:19,062 INFO L87 Difference]: Start difference. First operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 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 551 states. [2022-02-21 00:02:19,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,079 INFO L93 Difference]: Finished difference Result 551 states and 916 transitions. [2022-02-21 00:02:19,079 INFO L276 IsEmpty]: Start isEmpty. Operand 551 states and 916 transitions. [2022-02-21 00:02:19,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:19,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:19,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:19,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:19,081 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 548 states have (on average 1.6697080291970803) internal successors, (915), 548 states have internal predecessors, (915), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 915 transitions. [2022-02-21 00:02:19,098 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 915 transitions. Word has length 22 [2022-02-21 00:02:19,098 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:19,098 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 915 transitions. [2022-02-21 00:02:19,098 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,099 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 915 transitions. [2022-02-21 00:02:19,099 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:19,099 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:19,099 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:19,100 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-21 00:02:19,100 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:19,100 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:19,100 INFO L85 PathProgramCache]: Analyzing trace with hash 521533869, now seen corresponding path program 1 times [2022-02-21 00:02:19,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:19,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1877998057] [2022-02-21 00:02:19,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:19,101 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:19,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:19,127 INFO L290 TraceCheckUtils]: 0: Hoare triple {11747#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {11747#true} is VALID [2022-02-21 00:02:19,127 INFO L290 TraceCheckUtils]: 1: Hoare triple {11747#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {11747#true} is VALID [2022-02-21 00:02:19,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {11747#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {11747#true} is VALID [2022-02-21 00:02:19,128 INFO L290 TraceCheckUtils]: 3: Hoare triple {11747#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {11747#true} is VALID [2022-02-21 00:02:19,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {11747#true} assume !(0 != main_~p1~0#1); {11747#true} is VALID [2022-02-21 00:02:19,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {11747#true} assume !(0 != main_~p2~0#1); {11747#true} is VALID [2022-02-21 00:02:19,128 INFO L290 TraceCheckUtils]: 6: Hoare triple {11747#true} assume !(0 != main_~p3~0#1); {11747#true} is VALID [2022-02-21 00:02:19,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {11747#true} assume !(0 != main_~p4~0#1); {11747#true} is VALID [2022-02-21 00:02:19,129 INFO L290 TraceCheckUtils]: 8: Hoare triple {11747#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,129 INFO L290 TraceCheckUtils]: 9: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,129 INFO L290 TraceCheckUtils]: 10: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,130 INFO L290 TraceCheckUtils]: 11: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,130 INFO L290 TraceCheckUtils]: 12: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,131 INFO L290 TraceCheckUtils]: 13: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,131 INFO L290 TraceCheckUtils]: 14: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p11~0#1); {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,131 INFO L290 TraceCheckUtils]: 15: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p1~0#1); {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,132 INFO L290 TraceCheckUtils]: 16: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p2~0#1); {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,132 INFO L290 TraceCheckUtils]: 17: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p3~0#1); {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,132 INFO L290 TraceCheckUtils]: 18: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume !(0 != main_~p4~0#1); {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,133 INFO L290 TraceCheckUtils]: 19: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 0 != main_~p5~0#1; {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} is VALID [2022-02-21 00:02:19,133 INFO L290 TraceCheckUtils]: 20: Hoare triple {11749#(= |ULTIMATE.start_main_~lk5~0#1| 1)} assume 1 != main_~lk5~0#1; {11748#false} is VALID [2022-02-21 00:02:19,133 INFO L290 TraceCheckUtils]: 21: Hoare triple {11748#false} assume !false; {11748#false} is VALID [2022-02-21 00:02:19,133 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:19,134 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:19,134 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1877998057] [2022-02-21 00:02:19,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1877998057] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:19,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:19,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:19,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618344866] [2022-02-21 00:02:19,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:19,135 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:19,135 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:19,135 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:19,149 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:19,149 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:19,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:19,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:19,150 INFO L87 Difference]: Start difference. First operand 549 states and 915 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,249 INFO L93 Difference]: Finished difference Result 999 states and 1676 transitions. [2022-02-21 00:02:19,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:19,250 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:19,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:19,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,251 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:19,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:19,252 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-21 00:02:19,323 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:19,374 INFO L225 Difference]: With dead ends: 999 [2022-02-21 00:02:19,375 INFO L226 Difference]: Without dead ends: 999 [2022-02-21 00:02:19,375 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:19,376 INFO L933 BasicCegarLoop]: 69 mSDtfsCounter, 41 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 41 SdHoareTripleChecker+Valid, 131 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:19,376 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [41 Valid, 131 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:19,377 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 999 states. [2022-02-21 00:02:19,388 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 999 to 773. [2022-02-21 00:02:19,388 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:19,390 INFO L82 GeneralOperation]: Start isEquivalent. First operand 999 states. Second operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,391 INFO L74 IsIncluded]: Start isIncluded. First operand 999 states. Second operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,392 INFO L87 Difference]: Start difference. First operand 999 states. Second operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,439 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,439 INFO L93 Difference]: Finished difference Result 999 states and 1676 transitions. [2022-02-21 00:02:19,439 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1676 transitions. [2022-02-21 00:02:19,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:19,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:19,443 INFO L74 IsIncluded]: Start isIncluded. First operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 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 999 states. [2022-02-21 00:02:19,444 INFO L87 Difference]: Start difference. First operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 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 999 states. [2022-02-21 00:02:19,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,491 INFO L93 Difference]: Finished difference Result 999 states and 1676 transitions. [2022-02-21 00:02:19,491 INFO L276 IsEmpty]: Start isEmpty. Operand 999 states and 1676 transitions. [2022-02-21 00:02:19,492 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:19,492 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:19,493 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:19,493 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:19,495 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 773 states, 772 states have (on average 1.6308290155440415) internal successors, (1259), 772 states have internal predecessors, (1259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 773 states to 773 states and 1259 transitions. [2022-02-21 00:02:19,525 INFO L78 Accepts]: Start accepts. Automaton has 773 states and 1259 transitions. Word has length 22 [2022-02-21 00:02:19,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:19,525 INFO L470 AbstractCegarLoop]: Abstraction has 773 states and 1259 transitions. [2022-02-21 00:02:19,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,526 INFO L276 IsEmpty]: Start isEmpty. Operand 773 states and 1259 transitions. [2022-02-21 00:02:19,527 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-21 00:02:19,527 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:19,527 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:19,527 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-21 00:02:19,527 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:19,528 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:19,528 INFO L85 PathProgramCache]: Analyzing trace with hash -489583381, now seen corresponding path program 1 times [2022-02-21 00:02:19,528 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:19,528 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [697622933] [2022-02-21 00:02:19,528 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:19,528 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:19,541 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:19,552 INFO L290 TraceCheckUtils]: 0: Hoare triple {15522#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {15522#true} is VALID [2022-02-21 00:02:19,553 INFO L290 TraceCheckUtils]: 1: Hoare triple {15522#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {15522#true} is VALID [2022-02-21 00:02:19,553 INFO L290 TraceCheckUtils]: 2: Hoare triple {15522#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {15522#true} is VALID [2022-02-21 00:02:19,553 INFO L290 TraceCheckUtils]: 3: Hoare triple {15522#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {15522#true} is VALID [2022-02-21 00:02:19,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {15522#true} assume !(0 != main_~p1~0#1); {15522#true} is VALID [2022-02-21 00:02:19,554 INFO L290 TraceCheckUtils]: 5: Hoare triple {15522#true} assume !(0 != main_~p2~0#1); {15522#true} is VALID [2022-02-21 00:02:19,554 INFO L290 TraceCheckUtils]: 6: Hoare triple {15522#true} assume !(0 != main_~p3~0#1); {15522#true} is VALID [2022-02-21 00:02:19,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {15522#true} assume !(0 != main_~p4~0#1); {15522#true} is VALID [2022-02-21 00:02:19,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {15522#true} assume !(0 != main_~p5~0#1); {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,555 INFO L290 TraceCheckUtils]: 9: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,555 INFO L290 TraceCheckUtils]: 11: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,556 INFO L290 TraceCheckUtils]: 12: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,556 INFO L290 TraceCheckUtils]: 13: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,556 INFO L290 TraceCheckUtils]: 14: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p11~0#1); {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,557 INFO L290 TraceCheckUtils]: 15: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p1~0#1); {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,557 INFO L290 TraceCheckUtils]: 16: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p2~0#1); {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,557 INFO L290 TraceCheckUtils]: 17: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p3~0#1); {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,558 INFO L290 TraceCheckUtils]: 18: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume !(0 != main_~p4~0#1); {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} is VALID [2022-02-21 00:02:19,558 INFO L290 TraceCheckUtils]: 19: Hoare triple {15524#(= |ULTIMATE.start_main_~p5~0#1| 0)} assume 0 != main_~p5~0#1; {15523#false} is VALID [2022-02-21 00:02:19,558 INFO L290 TraceCheckUtils]: 20: Hoare triple {15523#false} assume 1 != main_~lk5~0#1; {15523#false} is VALID [2022-02-21 00:02:19,558 INFO L290 TraceCheckUtils]: 21: Hoare triple {15523#false} assume !false; {15523#false} is VALID [2022-02-21 00:02:19,559 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:19,559 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:19,559 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [697622933] [2022-02-21 00:02:19,559 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [697622933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:19,559 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:19,559 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:19,560 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1779721009] [2022-02-21 00:02:19,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:19,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:19,560 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:19,560 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,573 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:19,574 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:19,574 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:19,574 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:19,574 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:19,575 INFO L87 Difference]: Start difference. First operand 773 states and 1259 transitions. Second operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,691 INFO L93 Difference]: Finished difference Result 1063 states and 1716 transitions. [2022-02-21 00:02:19,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:19,691 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-21 00:02:19,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:19,691 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-21 00:02:19,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 129 transitions. [2022-02-21 00:02:19,694 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 129 transitions. [2022-02-21 00:02:19,769 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 129 edges. 129 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:19,812 INFO L225 Difference]: With dead ends: 1063 [2022-02-21 00:02:19,813 INFO L226 Difference]: Without dead ends: 1063 [2022-02-21 00:02:19,813 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:19,814 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 49 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 161 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:19,814 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 161 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:19,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1063 states. [2022-02-21 00:02:19,832 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1063 to 1061. [2022-02-21 00:02:19,832 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:19,834 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,836 INFO L74 IsIncluded]: Start isIncluded. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,837 INFO L87 Difference]: Start difference. First operand 1063 states. Second operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,888 INFO L93 Difference]: Finished difference Result 1063 states and 1716 transitions. [2022-02-21 00:02:19,888 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1716 transitions. [2022-02-21 00:02:19,890 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:19,890 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:19,892 INFO L74 IsIncluded]: Start isIncluded. First operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1063 states. [2022-02-21 00:02:19,893 INFO L87 Difference]: Start difference. First operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1063 states. [2022-02-21 00:02:19,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:19,945 INFO L93 Difference]: Finished difference Result 1063 states and 1716 transitions. [2022-02-21 00:02:19,945 INFO L276 IsEmpty]: Start isEmpty. Operand 1063 states and 1716 transitions. [2022-02-21 00:02:19,947 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:19,947 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:19,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:19,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:19,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1061 states, 1060 states have (on average 1.6179245283018868) internal successors, (1715), 1060 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:19,999 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1061 states to 1061 states and 1715 transitions. [2022-02-21 00:02:20,000 INFO L78 Accepts]: Start accepts. Automaton has 1061 states and 1715 transitions. Word has length 22 [2022-02-21 00:02:20,000 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:20,000 INFO L470 AbstractCegarLoop]: Abstraction has 1061 states and 1715 transitions. [2022-02-21 00:02:20,001 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.333333333333333) internal successors, (22), 3 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,001 INFO L276 IsEmpty]: Start isEmpty. Operand 1061 states and 1715 transitions. [2022-02-21 00:02:20,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:20,002 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:20,002 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:20,002 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-21 00:02:20,003 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:20,003 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:20,003 INFO L85 PathProgramCache]: Analyzing trace with hash -1012104857, now seen corresponding path program 1 times [2022-02-21 00:02:20,003 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:20,004 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [229954331] [2022-02-21 00:02:20,004 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:20,004 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:20,030 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:20,041 INFO L290 TraceCheckUtils]: 0: Hoare triple {19777#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {19777#true} is VALID [2022-02-21 00:02:20,041 INFO L290 TraceCheckUtils]: 1: Hoare triple {19777#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {19777#true} is VALID [2022-02-21 00:02:20,041 INFO L290 TraceCheckUtils]: 2: Hoare triple {19777#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {19777#true} is VALID [2022-02-21 00:02:20,042 INFO L290 TraceCheckUtils]: 3: Hoare triple {19777#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {19777#true} is VALID [2022-02-21 00:02:20,042 INFO L290 TraceCheckUtils]: 4: Hoare triple {19777#true} assume !(0 != main_~p1~0#1); {19777#true} is VALID [2022-02-21 00:02:20,042 INFO L290 TraceCheckUtils]: 5: Hoare triple {19777#true} assume !(0 != main_~p2~0#1); {19777#true} is VALID [2022-02-21 00:02:20,042 INFO L290 TraceCheckUtils]: 6: Hoare triple {19777#true} assume !(0 != main_~p3~0#1); {19777#true} is VALID [2022-02-21 00:02:20,042 INFO L290 TraceCheckUtils]: 7: Hoare triple {19777#true} assume !(0 != main_~p4~0#1); {19777#true} is VALID [2022-02-21 00:02:20,043 INFO L290 TraceCheckUtils]: 8: Hoare triple {19777#true} assume 0 != main_~p5~0#1;main_~lk5~0#1 := 1; {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,043 INFO L290 TraceCheckUtils]: 9: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,043 INFO L290 TraceCheckUtils]: 10: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,044 INFO L290 TraceCheckUtils]: 11: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,044 INFO L290 TraceCheckUtils]: 12: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,044 INFO L290 TraceCheckUtils]: 13: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,045 INFO L290 TraceCheckUtils]: 14: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p11~0#1); {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,045 INFO L290 TraceCheckUtils]: 15: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p1~0#1); {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,045 INFO L290 TraceCheckUtils]: 16: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p2~0#1); {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,046 INFO L290 TraceCheckUtils]: 17: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p3~0#1); {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,046 INFO L290 TraceCheckUtils]: 18: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p4~0#1); {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} is VALID [2022-02-21 00:02:20,046 INFO L290 TraceCheckUtils]: 19: Hoare triple {19779#(not (= |ULTIMATE.start_main_~p5~0#1| 0))} assume !(0 != main_~p5~0#1); {19778#false} is VALID [2022-02-21 00:02:20,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {19778#false} assume 0 != main_~p6~0#1; {19778#false} is VALID [2022-02-21 00:02:20,047 INFO L290 TraceCheckUtils]: 21: Hoare triple {19778#false} assume 1 != main_~lk6~0#1; {19778#false} is VALID [2022-02-21 00:02:20,047 INFO L290 TraceCheckUtils]: 22: Hoare triple {19778#false} assume !false; {19778#false} is VALID [2022-02-21 00:02:20,047 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:20,047 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:20,047 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [229954331] [2022-02-21 00:02:20,048 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [229954331] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:20,048 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:20,048 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:20,048 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949268581] [2022-02-21 00:02:20,048 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:20,049 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:20,049 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:20,049 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,063 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:20,063 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:20,063 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:20,064 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:20,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:20,064 INFO L87 Difference]: Start difference. First operand 1061 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,180 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:20,180 INFO L93 Difference]: Finished difference Result 1079 states and 1716 transitions. [2022-02-21 00:02:20,180 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:20,180 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:20,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:20,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-21 00:02:20,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 128 transitions. [2022-02-21 00:02:20,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 128 transitions. [2022-02-21 00:02:20,258 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 128 edges. 128 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:20,301 INFO L225 Difference]: With dead ends: 1079 [2022-02-21 00:02:20,302 INFO L226 Difference]: Without dead ends: 1079 [2022-02-21 00:02:20,302 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:20,303 INFO L933 BasicCegarLoop]: 100 mSDtfsCounter, 51 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 160 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:20,303 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [51 Valid, 160 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:20,304 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1079 states. [2022-02-21 00:02:20,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1079 to 1077. [2022-02-21 00:02:20,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:20,322 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1079 states. Second operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,323 INFO L74 IsIncluded]: Start isIncluded. First operand 1079 states. Second operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,325 INFO L87 Difference]: Start difference. First operand 1079 states. Second operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:20,379 INFO L93 Difference]: Finished difference Result 1079 states and 1716 transitions. [2022-02-21 00:02:20,380 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1716 transitions. [2022-02-21 00:02:20,381 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:20,382 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:20,384 INFO L74 IsIncluded]: Start isIncluded. First operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1079 states. [2022-02-21 00:02:20,386 INFO L87 Difference]: Start difference. First operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 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 1079 states. [2022-02-21 00:02:20,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:20,443 INFO L93 Difference]: Finished difference Result 1079 states and 1716 transitions. [2022-02-21 00:02:20,443 INFO L276 IsEmpty]: Start isEmpty. Operand 1079 states and 1716 transitions. [2022-02-21 00:02:20,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:20,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:20,445 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:20,445 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:20,447 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1077 states, 1076 states have (on average 1.5938661710037174) internal successors, (1715), 1076 states have internal predecessors, (1715), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1077 states to 1077 states and 1715 transitions. [2022-02-21 00:02:20,501 INFO L78 Accepts]: Start accepts. Automaton has 1077 states and 1715 transitions. Word has length 23 [2022-02-21 00:02:20,502 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:20,502 INFO L470 AbstractCegarLoop]: Abstraction has 1077 states and 1715 transitions. [2022-02-21 00:02:20,502 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,502 INFO L276 IsEmpty]: Start isEmpty. Operand 1077 states and 1715 transitions. [2022-02-21 00:02:20,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:20,504 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:20,504 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:20,504 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-21 00:02:20,504 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:20,505 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:20,505 INFO L85 PathProgramCache]: Analyzing trace with hash 2002998761, now seen corresponding path program 1 times [2022-02-21 00:02:20,505 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:20,505 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744806795] [2022-02-21 00:02:20,505 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:20,505 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:20,519 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:20,531 INFO L290 TraceCheckUtils]: 0: Hoare triple {24096#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {24096#true} is VALID [2022-02-21 00:02:20,531 INFO L290 TraceCheckUtils]: 1: Hoare triple {24096#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {24096#true} is VALID [2022-02-21 00:02:20,532 INFO L290 TraceCheckUtils]: 2: Hoare triple {24096#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {24096#true} is VALID [2022-02-21 00:02:20,532 INFO L290 TraceCheckUtils]: 3: Hoare triple {24096#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {24096#true} is VALID [2022-02-21 00:02:20,532 INFO L290 TraceCheckUtils]: 4: Hoare triple {24096#true} assume !(0 != main_~p1~0#1); {24096#true} is VALID [2022-02-21 00:02:20,532 INFO L290 TraceCheckUtils]: 5: Hoare triple {24096#true} assume !(0 != main_~p2~0#1); {24096#true} is VALID [2022-02-21 00:02:20,532 INFO L290 TraceCheckUtils]: 6: Hoare triple {24096#true} assume !(0 != main_~p3~0#1); {24096#true} is VALID [2022-02-21 00:02:20,532 INFO L290 TraceCheckUtils]: 7: Hoare triple {24096#true} assume !(0 != main_~p4~0#1); {24096#true} is VALID [2022-02-21 00:02:20,533 INFO L290 TraceCheckUtils]: 8: Hoare triple {24096#true} assume !(0 != main_~p5~0#1); {24096#true} is VALID [2022-02-21 00:02:20,533 INFO L290 TraceCheckUtils]: 9: Hoare triple {24096#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,533 INFO L290 TraceCheckUtils]: 10: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,534 INFO L290 TraceCheckUtils]: 11: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,534 INFO L290 TraceCheckUtils]: 12: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,534 INFO L290 TraceCheckUtils]: 13: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,535 INFO L290 TraceCheckUtils]: 14: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p11~0#1); {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,535 INFO L290 TraceCheckUtils]: 15: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p1~0#1); {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,536 INFO L290 TraceCheckUtils]: 16: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p2~0#1); {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,536 INFO L290 TraceCheckUtils]: 17: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p3~0#1); {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,536 INFO L290 TraceCheckUtils]: 18: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p4~0#1); {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,537 INFO L290 TraceCheckUtils]: 19: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume !(0 != main_~p5~0#1); {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,537 INFO L290 TraceCheckUtils]: 20: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 0 != main_~p6~0#1; {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} is VALID [2022-02-21 00:02:20,537 INFO L290 TraceCheckUtils]: 21: Hoare triple {24098#(= |ULTIMATE.start_main_~lk6~0#1| 1)} assume 1 != main_~lk6~0#1; {24097#false} is VALID [2022-02-21 00:02:20,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {24097#false} assume !false; {24097#false} is VALID [2022-02-21 00:02:20,538 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:20,538 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:20,538 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744806795] [2022-02-21 00:02:20,538 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744806795] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:20,538 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:20,538 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:20,539 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1210381780] [2022-02-21 00:02:20,539 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:20,539 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:20,539 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:20,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,553 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:20,554 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:20,554 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:20,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:20,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:20,555 INFO L87 Difference]: Start difference. First operand 1077 states and 1715 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:20,771 INFO L93 Difference]: Finished difference Result 1927 states and 3092 transitions. [2022-02-21 00:02:20,771 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:20,772 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:20,772 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:20,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-02-21 00:02:20,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:20,774 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 118 transitions. [2022-02-21 00:02:20,774 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 118 transitions. [2022-02-21 00:02:20,862 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:20,997 INFO L225 Difference]: With dead ends: 1927 [2022-02-21 00:02:20,997 INFO L226 Difference]: Without dead ends: 1927 [2022-02-21 00:02:20,997 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:20,998 INFO L933 BasicCegarLoop]: 68 mSDtfsCounter, 38 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 129 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:20,998 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 129 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:21,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1927 states. [2022-02-21 00:02:21,023 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1927 to 1541. [2022-02-21 00:02:21,023 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:21,025 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1927 states. Second operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,028 INFO L74 IsIncluded]: Start isIncluded. First operand 1927 states. Second operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,030 INFO L87 Difference]: Start difference. First operand 1927 states. Second operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:21,186 INFO L93 Difference]: Finished difference Result 1927 states and 3092 transitions. [2022-02-21 00:02:21,186 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 3092 transitions. [2022-02-21 00:02:21,189 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:21,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:21,192 INFO L74 IsIncluded]: Start isIncluded. First operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 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 1927 states. [2022-02-21 00:02:21,194 INFO L87 Difference]: Start difference. First operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 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 1927 states. [2022-02-21 00:02:21,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:21,352 INFO L93 Difference]: Finished difference Result 1927 states and 3092 transitions. [2022-02-21 00:02:21,352 INFO L276 IsEmpty]: Start isEmpty. Operand 1927 states and 3092 transitions. [2022-02-21 00:02:21,355 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:21,355 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:21,355 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:21,356 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:21,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1541 states, 1540 states have (on average 1.55) internal successors, (2387), 1540 states have internal predecessors, (2387), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,466 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1541 states to 1541 states and 2387 transitions. [2022-02-21 00:02:21,466 INFO L78 Accepts]: Start accepts. Automaton has 1541 states and 2387 transitions. Word has length 23 [2022-02-21 00:02:21,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:21,467 INFO L470 AbstractCegarLoop]: Abstraction has 1541 states and 2387 transitions. [2022-02-21 00:02:21,467 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,467 INFO L276 IsEmpty]: Start isEmpty. Operand 1541 states and 2387 transitions. [2022-02-21 00:02:21,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-21 00:02:21,469 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:21,469 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:21,469 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-21 00:02:21,469 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:21,470 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:21,470 INFO L85 PathProgramCache]: Analyzing trace with hash 991881511, now seen corresponding path program 1 times [2022-02-21 00:02:21,470 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:21,470 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [740009701] [2022-02-21 00:02:21,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:21,471 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:21,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:21,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {31423#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {31423#true} is VALID [2022-02-21 00:02:21,497 INFO L290 TraceCheckUtils]: 1: Hoare triple {31423#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {31423#true} is VALID [2022-02-21 00:02:21,497 INFO L290 TraceCheckUtils]: 2: Hoare triple {31423#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {31423#true} is VALID [2022-02-21 00:02:21,497 INFO L290 TraceCheckUtils]: 3: Hoare triple {31423#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {31423#true} is VALID [2022-02-21 00:02:21,497 INFO L290 TraceCheckUtils]: 4: Hoare triple {31423#true} assume !(0 != main_~p1~0#1); {31423#true} is VALID [2022-02-21 00:02:21,497 INFO L290 TraceCheckUtils]: 5: Hoare triple {31423#true} assume !(0 != main_~p2~0#1); {31423#true} is VALID [2022-02-21 00:02:21,498 INFO L290 TraceCheckUtils]: 6: Hoare triple {31423#true} assume !(0 != main_~p3~0#1); {31423#true} is VALID [2022-02-21 00:02:21,498 INFO L290 TraceCheckUtils]: 7: Hoare triple {31423#true} assume !(0 != main_~p4~0#1); {31423#true} is VALID [2022-02-21 00:02:21,498 INFO L290 TraceCheckUtils]: 8: Hoare triple {31423#true} assume !(0 != main_~p5~0#1); {31423#true} is VALID [2022-02-21 00:02:21,498 INFO L290 TraceCheckUtils]: 9: Hoare triple {31423#true} assume !(0 != main_~p6~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,499 INFO L290 TraceCheckUtils]: 10: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,499 INFO L290 TraceCheckUtils]: 11: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,499 INFO L290 TraceCheckUtils]: 12: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,500 INFO L290 TraceCheckUtils]: 13: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,500 INFO L290 TraceCheckUtils]: 14: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p11~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,500 INFO L290 TraceCheckUtils]: 15: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p1~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,501 INFO L290 TraceCheckUtils]: 16: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p2~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,501 INFO L290 TraceCheckUtils]: 17: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p3~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,501 INFO L290 TraceCheckUtils]: 18: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p4~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,502 INFO L290 TraceCheckUtils]: 19: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume !(0 != main_~p5~0#1); {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} is VALID [2022-02-21 00:02:21,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {31425#(= |ULTIMATE.start_main_~p6~0#1| 0)} assume 0 != main_~p6~0#1; {31424#false} is VALID [2022-02-21 00:02:21,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {31424#false} assume 1 != main_~lk6~0#1; {31424#false} is VALID [2022-02-21 00:02:21,502 INFO L290 TraceCheckUtils]: 22: Hoare triple {31424#false} assume !false; {31424#false} is VALID [2022-02-21 00:02:21,503 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:21,503 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:21,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [740009701] [2022-02-21 00:02:21,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [740009701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:21,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:21,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:21,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [186639755] [2022-02-21 00:02:21,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:21,504 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:21,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:21,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,518 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:21,518 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:21,519 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:21,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:21,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:21,519 INFO L87 Difference]: Start difference. First operand 1541 states and 2387 transitions. Second operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,776 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:21,777 INFO L93 Difference]: Finished difference Result 2087 states and 3204 transitions. [2022-02-21 00:02:21,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:21,777 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-21 00:02:21,777 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:21,777 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,779 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-21 00:02:21,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:21,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 127 transitions. [2022-02-21 00:02:21,780 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 127 transitions. [2022-02-21 00:02:21,865 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 127 edges. 127 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,025 INFO L225 Difference]: With dead ends: 2087 [2022-02-21 00:02:22,026 INFO L226 Difference]: Without dead ends: 2087 [2022-02-21 00:02:22,026 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:22,026 INFO L933 BasicCegarLoop]: 102 mSDtfsCounter, 48 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 162 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:22,027 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 162 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:22,029 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2087 states. [2022-02-21 00:02:22,071 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2087 to 2085. [2022-02-21 00:02:22,071 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:22,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2087 states. Second operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,078 INFO L74 IsIncluded]: Start isIncluded. First operand 2087 states. Second operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,082 INFO L87 Difference]: Start difference. First operand 2087 states. Second operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,288 INFO L93 Difference]: Finished difference Result 2087 states and 3204 transitions. [2022-02-21 00:02:22,288 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3204 transitions. [2022-02-21 00:02:22,292 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:22,292 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:22,296 INFO L74 IsIncluded]: Start isIncluded. First operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2087 states. [2022-02-21 00:02:22,299 INFO L87 Difference]: Start difference. First operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2087 states. [2022-02-21 00:02:22,496 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:22,496 INFO L93 Difference]: Finished difference Result 2087 states and 3204 transitions. [2022-02-21 00:02:22,496 INFO L276 IsEmpty]: Start isEmpty. Operand 2087 states and 3204 transitions. [2022-02-21 00:02:22,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:22,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:22,500 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:22,500 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:22,504 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2085 states, 2084 states have (on average 1.5369481765834934) internal successors, (3203), 2084 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2085 states to 2085 states and 3203 transitions. [2022-02-21 00:02:22,696 INFO L78 Accepts]: Start accepts. Automaton has 2085 states and 3203 transitions. Word has length 23 [2022-02-21 00:02:22,696 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:22,697 INFO L470 AbstractCegarLoop]: Abstraction has 2085 states and 3203 transitions. [2022-02-21 00:02:22,697 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.666666666666667) internal successors, (23), 3 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,697 INFO L276 IsEmpty]: Start isEmpty. Operand 2085 states and 3203 transitions. [2022-02-21 00:02:22,699 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:22,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:22,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:22,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-21 00:02:22,703 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:22,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:22,711 INFO L85 PathProgramCache]: Analyzing trace with hash 1963634176, now seen corresponding path program 1 times [2022-02-21 00:02:22,711 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:22,712 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [862636935] [2022-02-21 00:02:22,712 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:22,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:22,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:22,763 INFO L290 TraceCheckUtils]: 0: Hoare triple {39774#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {39774#true} is VALID [2022-02-21 00:02:22,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {39774#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {39774#true} is VALID [2022-02-21 00:02:22,764 INFO L290 TraceCheckUtils]: 2: Hoare triple {39774#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {39774#true} is VALID [2022-02-21 00:02:22,764 INFO L290 TraceCheckUtils]: 3: Hoare triple {39774#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {39774#true} is VALID [2022-02-21 00:02:22,764 INFO L290 TraceCheckUtils]: 4: Hoare triple {39774#true} assume !(0 != main_~p1~0#1); {39774#true} is VALID [2022-02-21 00:02:22,764 INFO L290 TraceCheckUtils]: 5: Hoare triple {39774#true} assume !(0 != main_~p2~0#1); {39774#true} is VALID [2022-02-21 00:02:22,765 INFO L290 TraceCheckUtils]: 6: Hoare triple {39774#true} assume !(0 != main_~p3~0#1); {39774#true} is VALID [2022-02-21 00:02:22,765 INFO L290 TraceCheckUtils]: 7: Hoare triple {39774#true} assume !(0 != main_~p4~0#1); {39774#true} is VALID [2022-02-21 00:02:22,765 INFO L290 TraceCheckUtils]: 8: Hoare triple {39774#true} assume !(0 != main_~p5~0#1); {39774#true} is VALID [2022-02-21 00:02:22,765 INFO L290 TraceCheckUtils]: 9: Hoare triple {39774#true} assume 0 != main_~p6~0#1;main_~lk6~0#1 := 1; {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,766 INFO L290 TraceCheckUtils]: 10: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,766 INFO L290 TraceCheckUtils]: 11: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,766 INFO L290 TraceCheckUtils]: 12: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,767 INFO L290 TraceCheckUtils]: 13: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,767 INFO L290 TraceCheckUtils]: 14: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p11~0#1); {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,767 INFO L290 TraceCheckUtils]: 15: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p1~0#1); {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,768 INFO L290 TraceCheckUtils]: 16: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p2~0#1); {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,768 INFO L290 TraceCheckUtils]: 17: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p3~0#1); {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,768 INFO L290 TraceCheckUtils]: 18: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p4~0#1); {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,769 INFO L290 TraceCheckUtils]: 19: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p5~0#1); {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} is VALID [2022-02-21 00:02:22,769 INFO L290 TraceCheckUtils]: 20: Hoare triple {39776#(not (= |ULTIMATE.start_main_~p6~0#1| 0))} assume !(0 != main_~p6~0#1); {39775#false} is VALID [2022-02-21 00:02:22,769 INFO L290 TraceCheckUtils]: 21: Hoare triple {39775#false} assume 0 != main_~p7~0#1; {39775#false} is VALID [2022-02-21 00:02:22,770 INFO L290 TraceCheckUtils]: 22: Hoare triple {39775#false} assume 1 != main_~lk7~0#1; {39775#false} is VALID [2022-02-21 00:02:22,770 INFO L290 TraceCheckUtils]: 23: Hoare triple {39775#false} assume !false; {39775#false} is VALID [2022-02-21 00:02:22,770 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:22,770 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:22,770 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [862636935] [2022-02-21 00:02:22,770 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [862636935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:22,771 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:22,771 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:22,771 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434609537] [2022-02-21 00:02:22,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:22,771 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:22,772 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:22,772 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:22,795 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:22,796 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:22,796 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:22,796 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:22,796 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:22,797 INFO L87 Difference]: Start difference. First operand 2085 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,067 INFO L93 Difference]: Finished difference Result 2119 states and 3204 transitions. [2022-02-21 00:02:23,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:23,067 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:23,067 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:23,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 00:02:23,069 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 126 transitions. [2022-02-21 00:02:23,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 126 transitions. [2022-02-21 00:02:23,186 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 126 edges. 126 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:23,345 INFO L225 Difference]: With dead ends: 2119 [2022-02-21 00:02:23,345 INFO L226 Difference]: Without dead ends: 2119 [2022-02-21 00:02:23,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:23,346 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 50 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:23,346 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [50 Valid, 156 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:23,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2119 states. [2022-02-21 00:02:23,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2119 to 2117. [2022-02-21 00:02:23,400 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:23,403 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2119 states. Second operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,405 INFO L74 IsIncluded]: Start isIncluded. First operand 2119 states. Second operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,407 INFO L87 Difference]: Start difference. First operand 2119 states. Second operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,585 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,586 INFO L93 Difference]: Finished difference Result 2119 states and 3204 transitions. [2022-02-21 00:02:23,586 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3204 transitions. [2022-02-21 00:02:23,588 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,588 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,591 INFO L74 IsIncluded]: Start isIncluded. First operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2119 states. [2022-02-21 00:02:23,593 INFO L87 Difference]: Start difference. First operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 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 2119 states. [2022-02-21 00:02:23,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:23,767 INFO L93 Difference]: Finished difference Result 2119 states and 3204 transitions. [2022-02-21 00:02:23,767 INFO L276 IsEmpty]: Start isEmpty. Operand 2119 states and 3204 transitions. [2022-02-21 00:02:23,770 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:23,770 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:23,770 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:23,770 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:23,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2117 states, 2116 states have (on average 1.5137051039697542) internal successors, (3203), 2116 states have internal predecessors, (3203), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2117 states to 2117 states and 3203 transitions. [2022-02-21 00:02:23,950 INFO L78 Accepts]: Start accepts. Automaton has 2117 states and 3203 transitions. Word has length 24 [2022-02-21 00:02:23,951 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:23,951 INFO L470 AbstractCegarLoop]: Abstraction has 2117 states and 3203 transitions. [2022-02-21 00:02:23,951 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:23,951 INFO L276 IsEmpty]: Start isEmpty. Operand 2117 states and 3203 transitions. [2022-02-21 00:02:23,952 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:23,953 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:23,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:23,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-21 00:02:23,953 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:23,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:23,954 INFO L85 PathProgramCache]: Analyzing trace with hash 683770498, now seen corresponding path program 1 times [2022-02-21 00:02:23,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:23,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1840468478] [2022-02-21 00:02:23,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:23,954 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:23,967 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:23,977 INFO L290 TraceCheckUtils]: 0: Hoare triple {48253#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {48253#true} is VALID [2022-02-21 00:02:23,978 INFO L290 TraceCheckUtils]: 1: Hoare triple {48253#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {48253#true} is VALID [2022-02-21 00:02:23,978 INFO L290 TraceCheckUtils]: 2: Hoare triple {48253#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {48253#true} is VALID [2022-02-21 00:02:23,978 INFO L290 TraceCheckUtils]: 3: Hoare triple {48253#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {48253#true} is VALID [2022-02-21 00:02:23,978 INFO L290 TraceCheckUtils]: 4: Hoare triple {48253#true} assume !(0 != main_~p1~0#1); {48253#true} is VALID [2022-02-21 00:02:23,978 INFO L290 TraceCheckUtils]: 5: Hoare triple {48253#true} assume !(0 != main_~p2~0#1); {48253#true} is VALID [2022-02-21 00:02:23,979 INFO L290 TraceCheckUtils]: 6: Hoare triple {48253#true} assume !(0 != main_~p3~0#1); {48253#true} is VALID [2022-02-21 00:02:23,979 INFO L290 TraceCheckUtils]: 7: Hoare triple {48253#true} assume !(0 != main_~p4~0#1); {48253#true} is VALID [2022-02-21 00:02:23,979 INFO L290 TraceCheckUtils]: 8: Hoare triple {48253#true} assume !(0 != main_~p5~0#1); {48253#true} is VALID [2022-02-21 00:02:23,979 INFO L290 TraceCheckUtils]: 9: Hoare triple {48253#true} assume !(0 != main_~p6~0#1); {48253#true} is VALID [2022-02-21 00:02:23,980 INFO L290 TraceCheckUtils]: 10: Hoare triple {48253#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,980 INFO L290 TraceCheckUtils]: 11: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,980 INFO L290 TraceCheckUtils]: 12: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,981 INFO L290 TraceCheckUtils]: 13: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,981 INFO L290 TraceCheckUtils]: 14: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p11~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,981 INFO L290 TraceCheckUtils]: 15: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p1~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,982 INFO L290 TraceCheckUtils]: 16: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p2~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,982 INFO L290 TraceCheckUtils]: 17: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p3~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,982 INFO L290 TraceCheckUtils]: 18: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p4~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,983 INFO L290 TraceCheckUtils]: 19: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p5~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,983 INFO L290 TraceCheckUtils]: 20: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume !(0 != main_~p6~0#1); {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,983 INFO L290 TraceCheckUtils]: 21: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 0 != main_~p7~0#1; {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} is VALID [2022-02-21 00:02:23,984 INFO L290 TraceCheckUtils]: 22: Hoare triple {48255#(= |ULTIMATE.start_main_~lk7~0#1| 1)} assume 1 != main_~lk7~0#1; {48254#false} is VALID [2022-02-21 00:02:23,984 INFO L290 TraceCheckUtils]: 23: Hoare triple {48254#false} assume !false; {48254#false} is VALID [2022-02-21 00:02:23,984 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:23,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:23,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1840468478] [2022-02-21 00:02:23,985 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1840468478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:23,985 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:23,985 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:23,985 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1623200374] [2022-02-21 00:02:23,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:23,985 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:23,986 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:23,986 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,000 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:24,001 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:24,001 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:24,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:24,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:24,002 INFO L87 Difference]: Start difference. First operand 2117 states and 3203 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,628 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:24,629 INFO L93 Difference]: Finished difference Result 3719 states and 5668 transitions. [2022-02-21 00:02:24,629 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:24,629 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:24,629 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:24,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,632 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:24,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:24,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 114 transitions. [2022-02-21 00:02:24,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 114 transitions. [2022-02-21 00:02:24,715 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 114 edges. 114 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:25,249 INFO L225 Difference]: With dead ends: 3719 [2022-02-21 00:02:25,249 INFO L226 Difference]: Without dead ends: 3719 [2022-02-21 00:02:25,249 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:25,251 INFO L933 BasicCegarLoop]: 67 mSDtfsCounter, 35 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 35 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:25,253 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [35 Valid, 127 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:25,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3719 states. [2022-02-21 00:02:25,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3719 to 3077. [2022-02-21 00:02:25,317 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:25,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 3719 states. Second operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,328 INFO L74 IsIncluded]: Start isIncluded. First operand 3719 states. Second operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,333 INFO L87 Difference]: Start difference. First operand 3719 states. Second operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:25,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:25,882 INFO L93 Difference]: Finished difference Result 3719 states and 5668 transitions. [2022-02-21 00:02:25,882 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5668 transitions. [2022-02-21 00:02:25,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:25,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:25,891 INFO L74 IsIncluded]: Start isIncluded. First operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 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 3719 states. [2022-02-21 00:02:25,895 INFO L87 Difference]: Start difference. First operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 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 3719 states. [2022-02-21 00:02:26,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:26,437 INFO L93 Difference]: Finished difference Result 3719 states and 5668 transitions. [2022-02-21 00:02:26,437 INFO L276 IsEmpty]: Start isEmpty. Operand 3719 states and 5668 transitions. [2022-02-21 00:02:26,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:26,442 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:26,442 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:26,442 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:26,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3077 states, 3076 states have (on average 1.467815344603381) internal successors, (4515), 3076 states have internal predecessors, (4515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,862 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3077 states to 3077 states and 4515 transitions. [2022-02-21 00:02:26,863 INFO L78 Accepts]: Start accepts. Automaton has 3077 states and 4515 transitions. Word has length 24 [2022-02-21 00:02:26,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:26,863 INFO L470 AbstractCegarLoop]: Abstraction has 3077 states and 4515 transitions. [2022-02-21 00:02:26,863 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,863 INFO L276 IsEmpty]: Start isEmpty. Operand 3077 states and 4515 transitions. [2022-02-21 00:02:26,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-21 00:02:26,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:26,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:26,867 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-21 00:02:26,867 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:26,868 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:26,868 INFO L85 PathProgramCache]: Analyzing trace with hash -327346752, now seen corresponding path program 1 times [2022-02-21 00:02:26,868 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:26,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1145222032] [2022-02-21 00:02:26,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:26,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:26,885 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:26,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {62492#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {62492#true} is VALID [2022-02-21 00:02:26,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {62492#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {62492#true} is VALID [2022-02-21 00:02:26,896 INFO L290 TraceCheckUtils]: 2: Hoare triple {62492#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {62492#true} is VALID [2022-02-21 00:02:26,896 INFO L290 TraceCheckUtils]: 3: Hoare triple {62492#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {62492#true} is VALID [2022-02-21 00:02:26,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {62492#true} assume !(0 != main_~p1~0#1); {62492#true} is VALID [2022-02-21 00:02:26,897 INFO L290 TraceCheckUtils]: 5: Hoare triple {62492#true} assume !(0 != main_~p2~0#1); {62492#true} is VALID [2022-02-21 00:02:26,897 INFO L290 TraceCheckUtils]: 6: Hoare triple {62492#true} assume !(0 != main_~p3~0#1); {62492#true} is VALID [2022-02-21 00:02:26,897 INFO L290 TraceCheckUtils]: 7: Hoare triple {62492#true} assume !(0 != main_~p4~0#1); {62492#true} is VALID [2022-02-21 00:02:26,897 INFO L290 TraceCheckUtils]: 8: Hoare triple {62492#true} assume !(0 != main_~p5~0#1); {62492#true} is VALID [2022-02-21 00:02:26,897 INFO L290 TraceCheckUtils]: 9: Hoare triple {62492#true} assume !(0 != main_~p6~0#1); {62492#true} is VALID [2022-02-21 00:02:26,898 INFO L290 TraceCheckUtils]: 10: Hoare triple {62492#true} assume !(0 != main_~p7~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,899 INFO L290 TraceCheckUtils]: 12: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,899 INFO L290 TraceCheckUtils]: 13: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p11~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,900 INFO L290 TraceCheckUtils]: 15: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p1~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,900 INFO L290 TraceCheckUtils]: 16: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p2~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,900 INFO L290 TraceCheckUtils]: 17: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p3~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,901 INFO L290 TraceCheckUtils]: 18: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p4~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,901 INFO L290 TraceCheckUtils]: 19: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p5~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,901 INFO L290 TraceCheckUtils]: 20: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume !(0 != main_~p6~0#1); {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} is VALID [2022-02-21 00:02:26,902 INFO L290 TraceCheckUtils]: 21: Hoare triple {62494#(= |ULTIMATE.start_main_~p7~0#1| 0)} assume 0 != main_~p7~0#1; {62493#false} is VALID [2022-02-21 00:02:26,902 INFO L290 TraceCheckUtils]: 22: Hoare triple {62493#false} assume 1 != main_~lk7~0#1; {62493#false} is VALID [2022-02-21 00:02:26,902 INFO L290 TraceCheckUtils]: 23: Hoare triple {62493#false} assume !false; {62493#false} is VALID [2022-02-21 00:02:26,902 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:26,902 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:26,902 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1145222032] [2022-02-21 00:02:26,903 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1145222032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:26,903 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:26,903 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:26,903 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [252141809] [2022-02-21 00:02:26,903 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:26,904 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:26,904 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:26,904 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:26,918 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:26,919 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:26,919 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:26,920 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:26,920 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:26,920 INFO L87 Difference]: Start difference. First operand 3077 states and 4515 transitions. Second operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:27,536 INFO L93 Difference]: Finished difference Result 4103 states and 5956 transitions. [2022-02-21 00:02:27,536 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:27,536 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-21 00:02:27,536 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:27,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-21 00:02:27,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:27,537 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-21 00:02:27,537 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2022-02-21 00:02:27,627 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:28,232 INFO L225 Difference]: With dead ends: 4103 [2022-02-21 00:02:28,232 INFO L226 Difference]: Without dead ends: 4103 [2022-02-21 00:02:28,233 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:28,235 INFO L933 BasicCegarLoop]: 104 mSDtfsCounter, 47 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:02:28,235 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [47 Valid, 163 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:02:28,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4103 states. [2022-02-21 00:02:28,285 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4103 to 4101. [2022-02-21 00:02:28,286 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:28,291 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4103 states. Second operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,297 INFO L74 IsIncluded]: Start isIncluded. First operand 4103 states. Second operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:28,302 INFO L87 Difference]: Start difference. First operand 4103 states. Second operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:29,016 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,017 INFO L93 Difference]: Finished difference Result 4103 states and 5956 transitions. [2022-02-21 00:02:29,017 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 5956 transitions. [2022-02-21 00:02:29,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,028 INFO L74 IsIncluded]: Start isIncluded. First operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4103 states. [2022-02-21 00:02:29,034 INFO L87 Difference]: Start difference. First operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4103 states. [2022-02-21 00:02:29,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:29,721 INFO L93 Difference]: Finished difference Result 4103 states and 5956 transitions. [2022-02-21 00:02:29,722 INFO L276 IsEmpty]: Start isEmpty. Operand 4103 states and 5956 transitions. [2022-02-21 00:02:29,726 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:29,726 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:29,726 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:29,726 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:29,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4101 states, 4100 states have (on average 1.4524390243902439) internal successors, (5955), 4100 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4101 states to 4101 states and 5955 transitions. [2022-02-21 00:02:30,358 INFO L78 Accepts]: Start accepts. Automaton has 4101 states and 5955 transitions. Word has length 24 [2022-02-21 00:02:30,359 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:30,359 INFO L470 AbstractCegarLoop]: Abstraction has 4101 states and 5955 transitions. [2022-02-21 00:02:30,359 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.0) internal successors, (24), 3 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,359 INFO L276 IsEmpty]: Start isEmpty. Operand 4101 states and 5955 transitions. [2022-02-21 00:02:30,362 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:30,362 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:30,362 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:30,362 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-21 00:02:30,363 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:30,363 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:30,363 INFO L85 PathProgramCache]: Analyzing trace with hash -277735972, now seen corresponding path program 1 times [2022-02-21 00:02:30,363 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:30,364 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [196255431] [2022-02-21 00:02:30,364 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:30,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:30,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:30,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {78907#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {78907#true} is VALID [2022-02-21 00:02:30,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {78907#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {78907#true} is VALID [2022-02-21 00:02:30,385 INFO L290 TraceCheckUtils]: 2: Hoare triple {78907#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {78907#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 4: Hoare triple {78907#true} assume !(0 != main_~p1~0#1); {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 5: Hoare triple {78907#true} assume !(0 != main_~p2~0#1); {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 6: Hoare triple {78907#true} assume !(0 != main_~p3~0#1); {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 7: Hoare triple {78907#true} assume !(0 != main_~p4~0#1); {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 8: Hoare triple {78907#true} assume !(0 != main_~p5~0#1); {78907#true} is VALID [2022-02-21 00:02:30,386 INFO L290 TraceCheckUtils]: 9: Hoare triple {78907#true} assume !(0 != main_~p6~0#1); {78907#true} is VALID [2022-02-21 00:02:30,387 INFO L290 TraceCheckUtils]: 10: Hoare triple {78907#true} assume 0 != main_~p7~0#1;main_~lk7~0#1 := 1; {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,387 INFO L290 TraceCheckUtils]: 11: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,388 INFO L290 TraceCheckUtils]: 12: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,388 INFO L290 TraceCheckUtils]: 13: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,388 INFO L290 TraceCheckUtils]: 14: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p11~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,389 INFO L290 TraceCheckUtils]: 15: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p1~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,389 INFO L290 TraceCheckUtils]: 16: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p2~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,389 INFO L290 TraceCheckUtils]: 17: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p3~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,389 INFO L290 TraceCheckUtils]: 18: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p4~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,390 INFO L290 TraceCheckUtils]: 19: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p5~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,390 INFO L290 TraceCheckUtils]: 20: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p6~0#1); {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} is VALID [2022-02-21 00:02:30,390 INFO L290 TraceCheckUtils]: 21: Hoare triple {78909#(not (= |ULTIMATE.start_main_~p7~0#1| 0))} assume !(0 != main_~p7~0#1); {78908#false} is VALID [2022-02-21 00:02:30,391 INFO L290 TraceCheckUtils]: 22: Hoare triple {78908#false} assume 0 != main_~p8~0#1; {78908#false} is VALID [2022-02-21 00:02:30,391 INFO L290 TraceCheckUtils]: 23: Hoare triple {78908#false} assume 1 != main_~lk8~0#1; {78908#false} is VALID [2022-02-21 00:02:30,391 INFO L290 TraceCheckUtils]: 24: Hoare triple {78908#false} assume !false; {78908#false} is VALID [2022-02-21 00:02:30,391 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:30,392 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:30,392 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [196255431] [2022-02-21 00:02:30,392 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [196255431] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:30,392 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:30,392 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:30,392 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847014679] [2022-02-21 00:02:30,392 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:30,393 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:30,393 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:30,393 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:30,407 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:30,407 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:30,407 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:30,408 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:30,408 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:30,408 INFO L87 Difference]: Start difference. First operand 4101 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,096 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:31,096 INFO L93 Difference]: Finished difference Result 4167 states and 5956 transitions. [2022-02-21 00:02:31,096 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:31,096 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:31,096 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:31,097 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,097 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:31,098 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,098 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 124 transitions. [2022-02-21 00:02:31,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 124 transitions. [2022-02-21 00:02:31,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 124 edges. 124 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:31,698 INFO L225 Difference]: With dead ends: 4167 [2022-02-21 00:02:31,698 INFO L226 Difference]: Without dead ends: 4167 [2022-02-21 00:02:31,698 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:31,700 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 49 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 49 SdHoareTripleChecker+Valid, 152 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:31,700 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [49 Valid, 152 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:31,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4167 states. [2022-02-21 00:02:31,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4167 to 4165. [2022-02-21 00:02:31,751 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:31,756 INFO L82 GeneralOperation]: Start isEquivalent. First operand 4167 states. Second operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,760 INFO L74 IsIncluded]: Start isIncluded. First operand 4167 states. Second operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:31,765 INFO L87 Difference]: Start difference. First operand 4167 states. Second operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:32,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:32,407 INFO L93 Difference]: Finished difference Result 4167 states and 5956 transitions. [2022-02-21 00:02:32,407 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 5956 transitions. [2022-02-21 00:02:32,411 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:32,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:32,415 INFO L74 IsIncluded]: Start isIncluded. First operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4167 states. [2022-02-21 00:02:32,418 INFO L87 Difference]: Start difference. First operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 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 4167 states. [2022-02-21 00:02:33,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:33,003 INFO L93 Difference]: Finished difference Result 4167 states and 5956 transitions. [2022-02-21 00:02:33,003 INFO L276 IsEmpty]: Start isEmpty. Operand 4167 states and 5956 transitions. [2022-02-21 00:02:33,007 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:33,007 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:33,008 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:33,008 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:33,011 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4165 states, 4164 states have (on average 1.430115273775216) internal successors, (5955), 4164 states have internal predecessors, (5955), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4165 states to 4165 states and 5955 transitions. [2022-02-21 00:02:33,580 INFO L78 Accepts]: Start accepts. Automaton has 4165 states and 5955 transitions. Word has length 25 [2022-02-21 00:02:33,581 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:33,581 INFO L470 AbstractCegarLoop]: Abstraction has 4165 states and 5955 transitions. [2022-02-21 00:02:33,581 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,581 INFO L276 IsEmpty]: Start isEmpty. Operand 4165 states and 5955 transitions. [2022-02-21 00:02:33,583 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:33,584 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:33,584 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:33,584 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-21 00:02:33,584 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:33,585 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:33,585 INFO L85 PathProgramCache]: Analyzing trace with hash -1557599650, now seen corresponding path program 1 times [2022-02-21 00:02:33,585 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:33,585 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1461588109] [2022-02-21 00:02:33,585 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:33,585 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:33,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:33,619 INFO L290 TraceCheckUtils]: 0: Hoare triple {95578#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {95578#true} is VALID [2022-02-21 00:02:33,619 INFO L290 TraceCheckUtils]: 1: Hoare triple {95578#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {95578#true} is VALID [2022-02-21 00:02:33,619 INFO L290 TraceCheckUtils]: 2: Hoare triple {95578#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {95578#true} is VALID [2022-02-21 00:02:33,619 INFO L290 TraceCheckUtils]: 3: Hoare triple {95578#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {95578#true} is VALID [2022-02-21 00:02:33,619 INFO L290 TraceCheckUtils]: 4: Hoare triple {95578#true} assume !(0 != main_~p1~0#1); {95578#true} is VALID [2022-02-21 00:02:33,620 INFO L290 TraceCheckUtils]: 5: Hoare triple {95578#true} assume !(0 != main_~p2~0#1); {95578#true} is VALID [2022-02-21 00:02:33,620 INFO L290 TraceCheckUtils]: 6: Hoare triple {95578#true} assume !(0 != main_~p3~0#1); {95578#true} is VALID [2022-02-21 00:02:33,620 INFO L290 TraceCheckUtils]: 7: Hoare triple {95578#true} assume !(0 != main_~p4~0#1); {95578#true} is VALID [2022-02-21 00:02:33,620 INFO L290 TraceCheckUtils]: 8: Hoare triple {95578#true} assume !(0 != main_~p5~0#1); {95578#true} is VALID [2022-02-21 00:02:33,620 INFO L290 TraceCheckUtils]: 9: Hoare triple {95578#true} assume !(0 != main_~p6~0#1); {95578#true} is VALID [2022-02-21 00:02:33,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {95578#true} assume !(0 != main_~p7~0#1); {95578#true} is VALID [2022-02-21 00:02:33,621 INFO L290 TraceCheckUtils]: 11: Hoare triple {95578#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,621 INFO L290 TraceCheckUtils]: 12: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,622 INFO L290 TraceCheckUtils]: 14: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p11~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,622 INFO L290 TraceCheckUtils]: 15: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p1~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p2~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 17: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p3~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p4~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p5~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 20: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p6~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume !(0 != main_~p7~0#1); {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 0 != main_~p8~0#1; {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} is VALID [2022-02-21 00:02:33,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {95580#(= |ULTIMATE.start_main_~lk8~0#1| 1)} assume 1 != main_~lk8~0#1; {95579#false} is VALID [2022-02-21 00:02:33,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {95579#false} assume !false; {95579#false} is VALID [2022-02-21 00:02:33,625 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:33,625 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:33,626 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1461588109] [2022-02-21 00:02:33,626 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1461588109] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:33,626 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:33,626 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:33,626 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941414508] [2022-02-21 00:02:33,626 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:33,627 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:33,627 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:33,627 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:33,641 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:33,641 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:33,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:33,642 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:33,642 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:33,642 INFO L87 Difference]: Start difference. First operand 4165 states and 5955 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:35,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:35,617 INFO L93 Difference]: Finished difference Result 7175 states and 10308 transitions. [2022-02-21 00:02:35,617 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:35,617 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:35,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:35,617 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:35,618 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:35,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 110 transitions. [2022-02-21 00:02:35,618 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 110 transitions. [2022-02-21 00:02:35,686 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 110 edges. 110 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:37,311 INFO L225 Difference]: With dead ends: 7175 [2022-02-21 00:02:37,312 INFO L226 Difference]: Without dead ends: 7175 [2022-02-21 00:02:37,312 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,312 INFO L933 BasicCegarLoop]: 66 mSDtfsCounter, 32 mSDsluCounter, 59 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 125 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,312 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [32 Valid, 125 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,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7175 states. [2022-02-21 00:02:37,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7175 to 6149. [2022-02-21 00:02:37,394 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:37,400 INFO L82 GeneralOperation]: Start isEquivalent. First operand 7175 states. Second operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (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,406 INFO L74 IsIncluded]: Start isIncluded. First operand 7175 states. Second operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (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,411 INFO L87 Difference]: Start difference. First operand 7175 states. Second operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:39,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:39,113 INFO L93 Difference]: Finished difference Result 7175 states and 10308 transitions. [2022-02-21 00:02:39,113 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10308 transitions. [2022-02-21 00:02:39,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:39,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:39,124 INFO L74 IsIncluded]: Start isIncluded. First operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 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 7175 states. [2022-02-21 00:02:39,128 INFO L87 Difference]: Start difference. First operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 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 7175 states. [2022-02-21 00:02:40,718 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:40,718 INFO L93 Difference]: Finished difference Result 7175 states and 10308 transitions. [2022-02-21 00:02:40,719 INFO L276 IsEmpty]: Start isEmpty. Operand 7175 states and 10308 transitions. [2022-02-21 00:02:40,724 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:40,724 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:40,724 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:40,724 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:40,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6149 states, 6148 states have (on average 1.385003253090436) internal successors, (8515), 6148 states have internal predecessors, (8515), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,080 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6149 states to 6149 states and 8515 transitions. [2022-02-21 00:02:42,080 INFO L78 Accepts]: Start accepts. Automaton has 6149 states and 8515 transitions. Word has length 25 [2022-02-21 00:02:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:42,080 INFO L470 AbstractCegarLoop]: Abstraction has 6149 states and 8515 transitions. [2022-02-21 00:02:42,081 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,081 INFO L276 IsEmpty]: Start isEmpty. Operand 6149 states and 8515 transitions. [2022-02-21 00:02:42,084 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-21 00:02:42,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:42,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:42,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-21 00:02:42,085 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:42,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:42,085 INFO L85 PathProgramCache]: Analyzing trace with hash 1726250396, now seen corresponding path program 1 times [2022-02-21 00:02:42,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:42,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [529020959] [2022-02-21 00:02:42,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:42,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:42,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:42,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {123257#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {123257#true} is VALID [2022-02-21 00:02:42,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {123257#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {123257#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {123257#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {123257#true} assume !(0 != main_~p1~0#1); {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {123257#true} assume !(0 != main_~p2~0#1); {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 6: Hoare triple {123257#true} assume !(0 != main_~p3~0#1); {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 7: Hoare triple {123257#true} assume !(0 != main_~p4~0#1); {123257#true} is VALID [2022-02-21 00:02:42,116 INFO L290 TraceCheckUtils]: 8: Hoare triple {123257#true} assume !(0 != main_~p5~0#1); {123257#true} is VALID [2022-02-21 00:02:42,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {123257#true} assume !(0 != main_~p6~0#1); {123257#true} is VALID [2022-02-21 00:02:42,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {123257#true} assume !(0 != main_~p7~0#1); {123257#true} is VALID [2022-02-21 00:02:42,117 INFO L290 TraceCheckUtils]: 11: Hoare triple {123257#true} assume !(0 != main_~p8~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,117 INFO L290 TraceCheckUtils]: 12: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,118 INFO L290 TraceCheckUtils]: 13: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,118 INFO L290 TraceCheckUtils]: 14: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p11~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,118 INFO L290 TraceCheckUtils]: 15: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p1~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,119 INFO L290 TraceCheckUtils]: 16: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p2~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,119 INFO L290 TraceCheckUtils]: 17: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p3~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,119 INFO L290 TraceCheckUtils]: 18: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p4~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,120 INFO L290 TraceCheckUtils]: 19: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p5~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,120 INFO L290 TraceCheckUtils]: 20: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p6~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,120 INFO L290 TraceCheckUtils]: 21: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume !(0 != main_~p7~0#1); {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} is VALID [2022-02-21 00:02:42,121 INFO L290 TraceCheckUtils]: 22: Hoare triple {123259#(= |ULTIMATE.start_main_~p8~0#1| 0)} assume 0 != main_~p8~0#1; {123258#false} is VALID [2022-02-21 00:02:42,121 INFO L290 TraceCheckUtils]: 23: Hoare triple {123258#false} assume 1 != main_~lk8~0#1; {123258#false} is VALID [2022-02-21 00:02:42,121 INFO L290 TraceCheckUtils]: 24: Hoare triple {123258#false} assume !false; {123258#false} is VALID [2022-02-21 00:02:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:42,121 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:42,121 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [529020959] [2022-02-21 00:02:42,122 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [529020959] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:42,122 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:42,122 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:42,123 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1022276664] [2022-02-21 00:02:42,123 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:42,124 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:42,124 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:42,125 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:42,139 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:42,141 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:42,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:42,144 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:42,144 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:42,144 INFO L87 Difference]: Start difference. First operand 6149 states and 8515 transitions. Second operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:44,949 INFO L93 Difference]: Finished difference Result 8071 states and 11012 transitions. [2022-02-21 00:02:44,949 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:44,949 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-21 00:02:44,949 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:44,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,950 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-21 00:02:44,950 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:44,951 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 123 transitions. [2022-02-21 00:02:44,951 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 123 transitions. [2022-02-21 00:02:45,022 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:47,390 INFO L225 Difference]: With dead ends: 8071 [2022-02-21 00:02:47,391 INFO L226 Difference]: Without dead ends: 8071 [2022-02-21 00:02:47,391 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:47,392 INFO L933 BasicCegarLoop]: 106 mSDtfsCounter, 46 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 164 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:47,392 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [46 Valid, 164 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:47,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8071 states. [2022-02-21 00:02:47,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8071 to 8069. [2022-02-21 00:02:47,478 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:02:47,489 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8071 states. Second operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,500 INFO L74 IsIncluded]: Start isIncluded. First operand 8071 states. Second operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:47,546 INFO L87 Difference]: Start difference. First operand 8071 states. Second operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:50,277 INFO L93 Difference]: Finished difference Result 8071 states and 11012 transitions. [2022-02-21 00:02:50,277 INFO L276 IsEmpty]: Start isEmpty. Operand 8071 states and 11012 transitions. [2022-02-21 00:02:50,286 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:50,286 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:50,293 INFO L74 IsIncluded]: Start isIncluded. First operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8071 states. [2022-02-21 00:02:50,300 INFO L87 Difference]: Start difference. First operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8071 states. [2022-02-21 00:02:53,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:53,123 INFO L93 Difference]: Finished difference Result 8071 states and 11012 transitions. [2022-02-21 00:02:53,123 INFO L276 IsEmpty]: Start isEmpty. Operand 8071 states and 11012 transitions. [2022-02-21 00:02:53,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:02:53,131 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:02:53,131 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:02:53,131 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:02:53,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8069 states, 8068 states have (on average 1.364774417451661) internal successors, (11011), 8068 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:55,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8069 states to 8069 states and 11011 transitions. [2022-02-21 00:02:55,585 INFO L78 Accepts]: Start accepts. Automaton has 8069 states and 11011 transitions. Word has length 25 [2022-02-21 00:02:55,586 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:02:55,586 INFO L470 AbstractCegarLoop]: Abstraction has 8069 states and 11011 transitions. [2022-02-21 00:02:55,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.333333333333334) internal successors, (25), 3 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:55,586 INFO L276 IsEmpty]: Start isEmpty. Operand 8069 states and 11011 transitions. [2022-02-21 00:02:55,590 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:02:55,590 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:02:55,590 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:02:55,590 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-21 00:02:55,590 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:02:55,590 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:02:55,591 INFO L85 PathProgramCache]: Analyzing trace with hash -1040733483, now seen corresponding path program 1 times [2022-02-21 00:02:55,591 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:02:55,591 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [491201637] [2022-02-21 00:02:55,591 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:02:55,591 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:02:55,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:02:55,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {155544#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {155544#true} is VALID [2022-02-21 00:02:55,626 INFO L290 TraceCheckUtils]: 1: Hoare triple {155544#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {155544#true} is VALID [2022-02-21 00:02:55,626 INFO L290 TraceCheckUtils]: 2: Hoare triple {155544#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {155544#true} is VALID [2022-02-21 00:02:55,626 INFO L290 TraceCheckUtils]: 3: Hoare triple {155544#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {155544#true} is VALID [2022-02-21 00:02:55,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {155544#true} assume !(0 != main_~p1~0#1); {155544#true} is VALID [2022-02-21 00:02:55,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {155544#true} assume !(0 != main_~p2~0#1); {155544#true} is VALID [2022-02-21 00:02:55,626 INFO L290 TraceCheckUtils]: 6: Hoare triple {155544#true} assume !(0 != main_~p3~0#1); {155544#true} is VALID [2022-02-21 00:02:55,627 INFO L290 TraceCheckUtils]: 7: Hoare triple {155544#true} assume !(0 != main_~p4~0#1); {155544#true} is VALID [2022-02-21 00:02:55,627 INFO L290 TraceCheckUtils]: 8: Hoare triple {155544#true} assume !(0 != main_~p5~0#1); {155544#true} is VALID [2022-02-21 00:02:55,627 INFO L290 TraceCheckUtils]: 9: Hoare triple {155544#true} assume !(0 != main_~p6~0#1); {155544#true} is VALID [2022-02-21 00:02:55,627 INFO L290 TraceCheckUtils]: 10: Hoare triple {155544#true} assume !(0 != main_~p7~0#1); {155544#true} is VALID [2022-02-21 00:02:55,627 INFO L290 TraceCheckUtils]: 11: Hoare triple {155544#true} assume 0 != main_~p8~0#1;main_~lk8~0#1 := 1; {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,628 INFO L290 TraceCheckUtils]: 12: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,628 INFO L290 TraceCheckUtils]: 13: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,629 INFO L290 TraceCheckUtils]: 14: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p11~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,629 INFO L290 TraceCheckUtils]: 15: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p1~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,629 INFO L290 TraceCheckUtils]: 16: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p2~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,630 INFO L290 TraceCheckUtils]: 17: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p3~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,630 INFO L290 TraceCheckUtils]: 18: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p4~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p5~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,631 INFO L290 TraceCheckUtils]: 20: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p6~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,631 INFO L290 TraceCheckUtils]: 21: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p7~0#1); {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} is VALID [2022-02-21 00:02:55,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {155546#(not (= |ULTIMATE.start_main_~p8~0#1| 0))} assume !(0 != main_~p8~0#1); {155545#false} is VALID [2022-02-21 00:02:55,632 INFO L290 TraceCheckUtils]: 23: Hoare triple {155545#false} assume 0 != main_~p9~0#1; {155545#false} is VALID [2022-02-21 00:02:55,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {155545#false} assume 1 != main_~lk9~0#1; {155545#false} is VALID [2022-02-21 00:02:55,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {155545#false} assume !false; {155545#false} is VALID [2022-02-21 00:02:55,632 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:02:55,632 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:02:55,632 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [491201637] [2022-02-21 00:02:55,633 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [491201637] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:02:55,633 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:02:55,633 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:02:55,633 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [528327942] [2022-02-21 00:02:55,633 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:02:55,634 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:02:55,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:02:55,634 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:55,651 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:02:55,651 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:02:55,652 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:02:55,652 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:02:55,652 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:02:55,652 INFO L87 Difference]: Start difference. First operand 8069 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:58,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:02:58,544 INFO L93 Difference]: Finished difference Result 8199 states and 11012 transitions. [2022-02-21 00:02:58,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:02:58,544 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:02:58,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:02:58,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:58,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:02:58,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 122 transitions. [2022-02-21 00:02:58,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 122 transitions. [2022-02-21 00:02:58,617 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:00,653 INFO L225 Difference]: With dead ends: 8199 [2022-02-21 00:03:00,654 INFO L226 Difference]: Without dead ends: 8199 [2022-02-21 00:03:00,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:00,654 INFO L933 BasicCegarLoop]: 91 mSDtfsCounter, 48 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 148 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:00,654 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [48 Valid, 148 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:00,657 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8199 states. [2022-02-21 00:03:00,725 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8199 to 8197. [2022-02-21 00:03:00,725 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:00,734 INFO L82 GeneralOperation]: Start isEquivalent. First operand 8199 states. Second operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:00,742 INFO L74 IsIncluded]: Start isIncluded. First operand 8199 states. Second operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:00,750 INFO L87 Difference]: Start difference. First operand 8199 states. Second operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:02,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:02,837 INFO L93 Difference]: Finished difference Result 8199 states and 11012 transitions. [2022-02-21 00:03:02,837 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 11012 transitions. [2022-02-21 00:03:02,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:02,843 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:02,850 INFO L74 IsIncluded]: Start isIncluded. First operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8199 states. [2022-02-21 00:03:02,856 INFO L87 Difference]: Start difference. First operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 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 8199 states. [2022-02-21 00:03:05,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:05,020 INFO L93 Difference]: Finished difference Result 8199 states and 11012 transitions. [2022-02-21 00:03:05,020 INFO L276 IsEmpty]: Start isEmpty. Operand 8199 states and 11012 transitions. [2022-02-21 00:03:05,026 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-21 00:03:05,026 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-21 00:03:05,026 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-21 00:03:05,027 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-21 00:03:05,032 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8197 states, 8196 states have (on average 1.343460224499756) internal successors, (11011), 8196 states have internal predecessors, (11011), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,255 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8197 states to 8197 states and 11011 transitions. [2022-02-21 00:03:07,255 INFO L78 Accepts]: Start accepts. Automaton has 8197 states and 11011 transitions. Word has length 26 [2022-02-21 00:03:07,255 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-21 00:03:07,255 INFO L470 AbstractCegarLoop]: Abstraction has 8197 states and 11011 transitions. [2022-02-21 00:03:07,255 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,256 INFO L276 IsEmpty]: Start isEmpty. Operand 8197 states and 11011 transitions. [2022-02-21 00:03:07,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-21 00:03:07,259 INFO L506 BasicCegarLoop]: Found error trace [2022-02-21 00:03:07,259 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-21 00:03:07,259 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-21 00:03:07,259 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK] === [2022-02-21 00:03:07,259 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-21 00:03:07,259 INFO L85 PathProgramCache]: Analyzing trace with hash 1974370135, now seen corresponding path program 1 times [2022-02-21 00:03:07,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-21 00:03:07,260 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049105019] [2022-02-21 00:03:07,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-21 00:03:07,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-21 00:03:07,270 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-21 00:03:07,280 INFO L290 TraceCheckUtils]: 0: Hoare triple {188343#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(16, 2);call #Ultimate.allocInit(12, 3); {188343#true} is VALID [2022-02-21 00:03:07,280 INFO L290 TraceCheckUtils]: 1: Hoare triple {188343#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet4#1, main_#t~nondet5#1, main_#t~nondet6#1, main_#t~nondet7#1, main_#t~nondet8#1, main_#t~nondet9#1, main_#t~nondet10#1, main_#t~nondet11#1, main_#t~nondet12#1, main_#t~nondet13#1, main_#t~nondet14#1, main_#t~nondet15#1, main_~p1~0#1, main_~lk1~0#1, main_~p2~0#1, main_~lk2~0#1, main_~p3~0#1, main_~lk3~0#1, main_~p4~0#1, main_~lk4~0#1, main_~p5~0#1, main_~lk5~0#1, main_~p6~0#1, main_~lk6~0#1, main_~p7~0#1, main_~lk7~0#1, main_~p8~0#1, main_~lk8~0#1, main_~p9~0#1, main_~lk9~0#1, main_~p10~0#1, main_~lk10~0#1, main_~p11~0#1, main_~lk11~0#1, main_~cond~0#1;assume -2147483648 <= main_#t~nondet4#1 && main_#t~nondet4#1 <= 2147483647;main_~p1~0#1 := main_#t~nondet4#1;havoc main_#t~nondet4#1;havoc main_~lk1~0#1;assume -2147483648 <= main_#t~nondet5#1 && main_#t~nondet5#1 <= 2147483647;main_~p2~0#1 := main_#t~nondet5#1;havoc main_#t~nondet5#1;havoc main_~lk2~0#1;assume -2147483648 <= main_#t~nondet6#1 && main_#t~nondet6#1 <= 2147483647;main_~p3~0#1 := main_#t~nondet6#1;havoc main_#t~nondet6#1;havoc main_~lk3~0#1;assume -2147483648 <= main_#t~nondet7#1 && main_#t~nondet7#1 <= 2147483647;main_~p4~0#1 := main_#t~nondet7#1;havoc main_#t~nondet7#1;havoc main_~lk4~0#1;assume -2147483648 <= main_#t~nondet8#1 && main_#t~nondet8#1 <= 2147483647;main_~p5~0#1 := main_#t~nondet8#1;havoc main_#t~nondet8#1;havoc main_~lk5~0#1;assume -2147483648 <= main_#t~nondet9#1 && main_#t~nondet9#1 <= 2147483647;main_~p6~0#1 := main_#t~nondet9#1;havoc main_#t~nondet9#1;havoc main_~lk6~0#1;assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647;main_~p7~0#1 := main_#t~nondet10#1;havoc main_#t~nondet10#1;havoc main_~lk7~0#1;assume -2147483648 <= main_#t~nondet11#1 && main_#t~nondet11#1 <= 2147483647;main_~p8~0#1 := main_#t~nondet11#1;havoc main_#t~nondet11#1;havoc main_~lk8~0#1;assume -2147483648 <= main_#t~nondet12#1 && main_#t~nondet12#1 <= 2147483647;main_~p9~0#1 := main_#t~nondet12#1;havoc main_#t~nondet12#1;havoc main_~lk9~0#1;assume -2147483648 <= main_#t~nondet13#1 && main_#t~nondet13#1 <= 2147483647;main_~p10~0#1 := main_#t~nondet13#1;havoc main_#t~nondet13#1;havoc main_~lk10~0#1;assume -2147483648 <= main_#t~nondet14#1 && main_#t~nondet14#1 <= 2147483647;main_~p11~0#1 := main_#t~nondet14#1;havoc main_#t~nondet14#1;havoc main_~lk11~0#1;havoc main_~cond~0#1; {188343#true} is VALID [2022-02-21 00:03:07,281 INFO L290 TraceCheckUtils]: 2: Hoare triple {188343#true} assume !false;assume -2147483648 <= main_#t~nondet15#1 && main_#t~nondet15#1 <= 2147483647;main_~cond~0#1 := main_#t~nondet15#1;havoc main_#t~nondet15#1; {188343#true} is VALID [2022-02-21 00:03:07,281 INFO L290 TraceCheckUtils]: 3: Hoare triple {188343#true} assume !(0 == main_~cond~0#1);main_~lk1~0#1 := 0;main_~lk2~0#1 := 0;main_~lk3~0#1 := 0;main_~lk4~0#1 := 0;main_~lk5~0#1 := 0;main_~lk6~0#1 := 0;main_~lk7~0#1 := 0;main_~lk8~0#1 := 0;main_~lk9~0#1 := 0;main_~lk10~0#1 := 0;main_~lk11~0#1 := 0; {188343#true} is VALID [2022-02-21 00:03:07,281 INFO L290 TraceCheckUtils]: 4: Hoare triple {188343#true} assume !(0 != main_~p1~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 5: Hoare triple {188343#true} assume !(0 != main_~p2~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 6: Hoare triple {188343#true} assume !(0 != main_~p3~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 7: Hoare triple {188343#true} assume !(0 != main_~p4~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 8: Hoare triple {188343#true} assume !(0 != main_~p5~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 9: Hoare triple {188343#true} assume !(0 != main_~p6~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 10: Hoare triple {188343#true} assume !(0 != main_~p7~0#1); {188343#true} is VALID [2022-02-21 00:03:07,282 INFO L290 TraceCheckUtils]: 11: Hoare triple {188343#true} assume !(0 != main_~p8~0#1); {188343#true} is VALID [2022-02-21 00:03:07,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {188343#true} assume 0 != main_~p9~0#1;main_~lk9~0#1 := 1; {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,283 INFO L290 TraceCheckUtils]: 13: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p10~0#1;main_~lk10~0#1 := 1; {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,283 INFO L290 TraceCheckUtils]: 14: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p11~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,283 INFO L290 TraceCheckUtils]: 15: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p1~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,284 INFO L290 TraceCheckUtils]: 16: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p2~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,284 INFO L290 TraceCheckUtils]: 17: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p3~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,284 INFO L290 TraceCheckUtils]: 18: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p4~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,284 INFO L290 TraceCheckUtils]: 19: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p5~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,285 INFO L290 TraceCheckUtils]: 20: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p6~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,285 INFO L290 TraceCheckUtils]: 21: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p7~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,285 INFO L290 TraceCheckUtils]: 22: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume !(0 != main_~p8~0#1); {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,286 INFO L290 TraceCheckUtils]: 23: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 0 != main_~p9~0#1; {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} is VALID [2022-02-21 00:03:07,286 INFO L290 TraceCheckUtils]: 24: Hoare triple {188345#(= |ULTIMATE.start_main_~lk9~0#1| 1)} assume 1 != main_~lk9~0#1; {188344#false} is VALID [2022-02-21 00:03:07,286 INFO L290 TraceCheckUtils]: 25: Hoare triple {188344#false} assume !false; {188344#false} is VALID [2022-02-21 00:03:07,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-21 00:03:07,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-21 00:03:07,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049105019] [2022-02-21 00:03:07,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049105019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-21 00:03:07,287 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-21 00:03:07,287 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-21 00:03:07,287 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1294173177] [2022-02-21 00:03:07,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-21 00:03:07,287 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:03:07,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-21 00:03:07,288 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:07,300 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:07,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-21 00:03:07,300 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-21 00:03:07,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-21 00:03:07,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:07,301 INFO L87 Difference]: Start difference. First operand 8197 states and 11011 transitions. Second operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:15,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-21 00:03:15,285 INFO L93 Difference]: Finished difference Result 13831 states and 18564 transitions. [2022-02-21 00:03:15,286 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-21 00:03:15,286 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-21 00:03:15,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-21 00:03:15,286 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:15,286 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-21 00:03:15,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 8.666666666666666) internal successors, (26), 3 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:15,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 106 transitions. [2022-02-21 00:03:15,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 106 transitions. [2022-02-21 00:03:15,349 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-21 00:03:22,835 INFO L225 Difference]: With dead ends: 13831 [2022-02-21 00:03:22,835 INFO L226 Difference]: Without dead ends: 13831 [2022-02-21 00:03:22,836 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-21 00:03:22,836 INFO L933 BasicCegarLoop]: 65 mSDtfsCounter, 29 mSDsluCounter, 58 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 29 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-21 00:03:22,838 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [29 Valid, 123 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-21 00:03:22,849 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13831 states. [2022-02-21 00:03:22,991 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13831 to 12293. [2022-02-21 00:03:22,991 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-21 00:03:23,006 INFO L82 GeneralOperation]: Start isEquivalent. First operand 13831 states. Second operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,022 INFO L74 IsIncluded]: Start isIncluded. First operand 13831 states. Second operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-21 00:03:23,067 INFO L87 Difference]: Start difference. First operand 13831 states. Second operand has 12293 states, 12292 states have (on average 1.3019036771884152) internal successors, (16003), 12292 states have internal predecessors, (16003), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)