./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memcleanup.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (memcleanup) 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/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:36:30,388 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:36:30,390 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:36:30,429 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:36:30,433 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:36:30,434 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:36:30,436 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:36:30,440 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:36:30,442 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:36:30,443 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:36:30,444 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:36:30,444 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:36:30,446 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:36:30,448 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:36:30,449 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:36:30,451 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:36:30,452 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:36:30,456 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:36:30,457 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:36:30,473 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:36:30,474 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:36:30,475 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:36:30,476 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:36:30,476 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:36:30,478 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:36:30,478 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:36:30,478 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:36:30,479 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:36:30,480 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:36:30,480 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:36:30,481 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:36:30,481 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:36:30,482 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:36:30,483 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:36:30,483 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:36:30,484 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:36:30,485 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:36:30,485 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:36:30,485 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:36:30,486 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:36:30,486 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:36:30,487 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Default.epf [2022-02-20 23:36:30,512 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:36:30,512 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:36:30,512 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:36:30,512 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:36:30,513 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:36:30,513 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:36:30,513 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:36:30,513 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:36:30,514 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:36:30,514 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:36:30,515 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:36:30,515 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:36:30,515 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:36:30,515 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:36:30,516 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:36:30,517 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:36:30,517 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:36:30,517 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:36:30,517 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:30,517 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:36:30,517 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:36:30,517 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:36:30,518 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:36:30,518 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-memcleanup) ) 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2022-02-20 23:36:30,729 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:36:30,753 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:36:30,755 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:36:30,756 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:36:30,757 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:36:30,758 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 23:36:30,808 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d0da157/45a7407d50ac4a539ace0cbbd0de2f97/FLAG4f1d58aea [2022-02-20 23:36:31,205 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:36:31,209 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 23:36:31,218 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d0da157/45a7407d50ac4a539ace0cbbd0de2f97/FLAG4f1d58aea [2022-02-20 23:36:31,588 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e0d0da157/45a7407d50ac4a539ace0cbbd0de2f97 [2022-02-20 23:36:31,590 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:36:31,591 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:36:31,603 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:31,604 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:36:31,606 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:36:31,607 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,607 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@7636e942 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31, skipping insertion in model container [2022-02-20 23:36:31,607 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,612 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:36:31,642 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:36:31,804 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/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 23:36:31,829 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:31,835 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:36:31,859 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/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 23:36:31,873 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:36:31,903 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:36:31,903 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31 WrapperNode [2022-02-20 23:36:31,903 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:36:31,905 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:31,905 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:36:31,905 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:36:31,911 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,924 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,952 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 294 [2022-02-20 23:36:31,953 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:36:31,953 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:36:31,954 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:36:31,954 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:36:31,959 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,960 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,963 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,963 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,973 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,979 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,980 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:31,983 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:36:31,984 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:36:31,984 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:36:31,984 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:36:31,985 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (1/1) ... [2022-02-20 23:36:32,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:36:32,012 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:36:32,022 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-20 23:36:32,033 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-20 23:36:32,054 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 23:36:32,055 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-02-20 23:36:32,055 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-02-20 23:36:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-02-20 23:36:32,056 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-02-20 23:36:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:36:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:36:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:36:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:36:32,056 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:36:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:36:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:36:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:36:32,057 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:36:32,057 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:36:32,145 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:36:32,146 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:36:32,765 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:36:32,780 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:36:32,780 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-02-20 23:36:32,782 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32 BoogieIcfgContainer [2022-02-20 23:36:32,783 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:36:32,784 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:36:32,784 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:36:32,787 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:36:32,787 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:36:31" (1/3) ... [2022-02-20 23:36:32,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a52510c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:36:31" (2/3) ... [2022-02-20 23:36:32,788 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6a52510c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:36:32, skipping insertion in model container [2022-02-20 23:36:32,788 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:36:32" (3/3) ... [2022-02-20 23:36:32,789 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-02-20 23:36:32,793 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:36:32,793 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2022-02-20 23:36:32,822 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:36:32,826 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-20 23:36:32,827 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2022-02-20 23:36:32,893 INFO L276 IsEmpty]: Start isEmpty. Operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:36:32,901 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:36:32,903 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:32,903 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:36:32,904 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:32,911 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:32,911 INFO L85 PathProgramCache]: Analyzing trace with hash 56404890, now seen corresponding path program 1 times [2022-02-20 23:36:32,918 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:32,918 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1376793527] [2022-02-20 23:36:32,919 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:32,919 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:33,018 INFO L290 TraceCheckUtils]: 0: Hoare triple {265#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {265#true} is VALID [2022-02-20 23:36:33,018 INFO L290 TraceCheckUtils]: 1: Hoare triple {265#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {265#true} is VALID [2022-02-20 23:36:33,019 INFO L290 TraceCheckUtils]: 2: Hoare triple {265#true} assume !true; {266#false} is VALID [2022-02-20 23:36:33,019 INFO L290 TraceCheckUtils]: 3: Hoare triple {266#false} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {266#false} is VALID [2022-02-20 23:36:33,019 INFO L290 TraceCheckUtils]: 4: Hoare triple {266#false} assume !(#valid == main_old_#valid#1); {266#false} is VALID [2022-02-20 23:36:33,020 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-20 23:36:33,021 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:33,021 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1376793527] [2022-02-20 23:36:33,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1376793527] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:33,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:33,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:33,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [883915168] [2022-02-20 23:36:33,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:33,027 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-20 23:36:33,028 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:33,030 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-20 23:36:33,036 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-20 23:36:33,036 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:36:33,036 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:33,050 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:36:33,051 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:36:33,058 INFO L87 Difference]: Start difference. First operand has 262 states, 139 states have (on average 2.194244604316547) internal successors, (305), 259 states have internal predecessors, (305), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) 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-20 23:36:33,249 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,250 INFO L93 Difference]: Finished difference Result 260 states and 285 transitions. [2022-02-20 23:36:33,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:36:33,250 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-20 23:36:33,250 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:33,251 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-20 23:36:33,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2022-02-20 23:36:33,260 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-20 23:36:33,265 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 321 transitions. [2022-02-20 23:36:33,265 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 321 transitions. [2022-02-20 23:36:33,494 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:33,513 INFO L225 Difference]: With dead ends: 260 [2022-02-20 23:36:33,514 INFO L226 Difference]: Without dead ends: 258 [2022-02-20 23:36:33,515 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-20 23:36:33,519 INFO L933 BasicCegarLoop]: 285 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, 285 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-20 23:36:33,520 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 285 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:33,535 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 258 states. [2022-02-20 23:36:33,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 258 to 258. [2022-02-20 23:36:33,554 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:33,555 INFO L82 GeneralOperation]: Start isEquivalent. First operand 258 states. Second operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:33,557 INFO L74 IsIncluded]: Start isIncluded. First operand 258 states. Second operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:33,558 INFO L87 Difference]: Start difference. First operand 258 states. Second operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:33,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,578 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2022-02-20 23:36:33,578 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2022-02-20 23:36:33,580 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,581 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,582 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 258 states. [2022-02-20 23:36:33,582 INFO L87 Difference]: Start difference. First operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 258 states. [2022-02-20 23:36:33,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:33,595 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2022-02-20 23:36:33,595 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2022-02-20 23:36:33,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:33,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:33,597 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:33,597 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:33,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 137 states have (on average 1.9416058394160585) internal successors, (266), 255 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:33,605 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 283 transitions. [2022-02-20 23:36:33,606 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 283 transitions. Word has length 5 [2022-02-20 23:36:33,606 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:33,606 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 283 transitions. [2022-02-20 23:36:33,606 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-20 23:36:33,607 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 283 transitions. [2022-02-20 23:36:33,607 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:36:33,607 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:33,607 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:36:33,608 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:36:33,608 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:33,608 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:33,608 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491005, now seen corresponding path program 1 times [2022-02-20 23:36:33,609 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:33,609 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1437333348] [2022-02-20 23:36:33,609 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:33,609 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:33,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:33,658 INFO L290 TraceCheckUtils]: 0: Hoare triple {1303#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1303#true} is VALID [2022-02-20 23:36:33,659 INFO L290 TraceCheckUtils]: 1: Hoare triple {1303#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:36:33,660 INFO L290 TraceCheckUtils]: 2: Hoare triple {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:36:33,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:36:33,661 INFO L290 TraceCheckUtils]: 4: Hoare triple {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:36:33,662 INFO L290 TraceCheckUtils]: 5: Hoare triple {1305#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {1304#false} is VALID [2022-02-20 23:36:33,662 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-20 23:36:33,662 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:33,662 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1437333348] [2022-02-20 23:36:33,663 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1437333348] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:33,663 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:33,663 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:33,663 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749675191] [2022-02-20 23:36:33,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:33,664 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-20 23:36:33,665 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:33,665 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-20 23:36:33,669 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-20 23:36:33,669 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:33,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:33,670 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:33,670 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:33,670 INFO L87 Difference]: Start difference. First operand 258 states and 283 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-20 23:36:34,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,090 INFO L93 Difference]: Finished difference Result 391 states and 435 transitions. [2022-02-20 23:36:34,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:34,091 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-20 23:36:34,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:34,091 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-20 23:36:34,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 23:36:34,095 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-20 23:36:34,099 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 436 transitions. [2022-02-20 23:36:34,099 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 436 transitions. [2022-02-20 23:36:34,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 436 edges. 436 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:34,405 INFO L225 Difference]: With dead ends: 391 [2022-02-20 23:36:34,405 INFO L226 Difference]: Without dead ends: 390 [2022-02-20 23:36:34,405 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-20 23:36:34,406 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 133 mSDsluCounter, 161 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 396 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:34,407 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 396 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:34,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 390 states. [2022-02-20 23:36:34,414 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 390 to 261. [2022-02-20 23:36:34,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:34,415 INFO L82 GeneralOperation]: Start isEquivalent. First operand 390 states. Second operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:34,416 INFO L74 IsIncluded]: Start isIncluded. First operand 390 states. Second operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:34,416 INFO L87 Difference]: Start difference. First operand 390 states. Second operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:34,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,425 INFO L93 Difference]: Finished difference Result 390 states and 434 transitions. [2022-02-20 23:36:34,425 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 434 transitions. [2022-02-20 23:36:34,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,427 INFO L74 IsIncluded]: Start isIncluded. First operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-02-20 23:36:34,428 INFO L87 Difference]: Start difference. First operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 390 states. [2022-02-20 23:36:34,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,437 INFO L93 Difference]: Finished difference Result 390 states and 434 transitions. [2022-02-20 23:36:34,437 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 434 transitions. [2022-02-20 23:36:34,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:34,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:34,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:34,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:34,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 261 states, 140 states have (on average 1.9285714285714286) internal successors, (270), 258 states have internal predecessors, (270), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:34,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 261 states to 261 states and 287 transitions. [2022-02-20 23:36:34,444 INFO L78 Accepts]: Start accepts. Automaton has 261 states and 287 transitions. Word has length 6 [2022-02-20 23:36:34,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:34,444 INFO L470 AbstractCegarLoop]: Abstraction has 261 states and 287 transitions. [2022-02-20 23:36:34,444 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-20 23:36:34,445 INFO L276 IsEmpty]: Start isEmpty. Operand 261 states and 287 transitions. [2022-02-20 23:36:34,445 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:36:34,445 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:34,445 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:36:34,445 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:36:34,445 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:34,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:34,446 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491563, now seen corresponding path program 1 times [2022-02-20 23:36:34,446 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:34,446 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1723927441] [2022-02-20 23:36:34,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:34,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:34,459 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:34,475 INFO L290 TraceCheckUtils]: 0: Hoare triple {2740#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2740#true} is VALID [2022-02-20 23:36:34,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {2740#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {2740#true} is VALID [2022-02-20 23:36:34,475 INFO L290 TraceCheckUtils]: 2: Hoare triple {2740#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2740#true} is VALID [2022-02-20 23:36:34,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {2740#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {2742#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:34,476 INFO L290 TraceCheckUtils]: 4: Hoare triple {2742#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {2742#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:34,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {2742#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} assume !(1 == #valid[main_~node~1#1.base]); {2741#false} is VALID [2022-02-20 23:36:34,477 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-20 23:36:34,477 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:34,477 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1723927441] [2022-02-20 23:36:34,478 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1723927441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:34,478 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:34,478 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:34,478 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1083348218] [2022-02-20 23:36:34,478 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:34,479 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-20 23:36:34,479 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:34,479 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-20 23:36:34,483 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-20 23:36:34,483 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:34,483 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:34,484 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:34,484 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:34,484 INFO L87 Difference]: Start difference. First operand 261 states and 287 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-20 23:36:34,957 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:34,957 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2022-02-20 23:36:34,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:34,958 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-20 23:36:34,958 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:34,958 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-20 23:36:34,966 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-02-20 23:36:34,966 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-20 23:36:34,970 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 491 transitions. [2022-02-20 23:36:34,970 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 491 transitions. [2022-02-20 23:36:35,270 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 491 edges. 491 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:35,277 INFO L225 Difference]: With dead ends: 439 [2022-02-20 23:36:35,277 INFO L226 Difference]: Without dead ends: 439 [2022-02-20 23:36:35,278 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-20 23:36:35,278 INFO L933 BasicCegarLoop]: 404 mSDtfsCounter, 199 mSDsluCounter, 165 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 201 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:35,279 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [201 Valid, 569 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:35,280 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 439 states. [2022-02-20 23:36:35,284 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 439 to 259. [2022-02-20 23:36:35,285 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:35,285 INFO L82 GeneralOperation]: Start isEquivalent. First operand 439 states. Second operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:35,286 INFO L74 IsIncluded]: Start isIncluded. First operand 439 states. Second operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:35,286 INFO L87 Difference]: Start difference. First operand 439 states. Second operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:35,296 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,296 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2022-02-20 23:36:35,296 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 489 transitions. [2022-02-20 23:36:35,297 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,297 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,298 INFO L74 IsIncluded]: Start isIncluded. First operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 439 states. [2022-02-20 23:36:35,299 INFO L87 Difference]: Start difference. First operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 439 states. [2022-02-20 23:36:35,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,309 INFO L93 Difference]: Finished difference Result 439 states and 489 transitions. [2022-02-20 23:36:35,309 INFO L276 IsEmpty]: Start isEmpty. Operand 439 states and 489 transitions. [2022-02-20 23:36:35,309 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:35,310 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:35,310 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:35,310 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:35,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 259 states, 140 states have (on average 1.9142857142857144) internal successors, (268), 256 states have internal predecessors, (268), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:35,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 259 states to 259 states and 285 transitions. [2022-02-20 23:36:35,316 INFO L78 Accepts]: Start accepts. Automaton has 259 states and 285 transitions. Word has length 6 [2022-02-20 23:36:35,316 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:35,316 INFO L470 AbstractCegarLoop]: Abstraction has 259 states and 285 transitions. [2022-02-20 23:36:35,316 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-20 23:36:35,316 INFO L276 IsEmpty]: Start isEmpty. Operand 259 states and 285 transitions. [2022-02-20 23:36:35,316 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:36:35,316 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:35,316 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:36:35,316 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:36:35,317 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:35,317 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:35,317 INFO L85 PathProgramCache]: Analyzing trace with hash 1747491564, now seen corresponding path program 1 times [2022-02-20 23:36:35,317 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:35,317 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560363638] [2022-02-20 23:36:35,317 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:35,317 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:35,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:35,354 INFO L290 TraceCheckUtils]: 0: Hoare triple {4321#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4321#true} is VALID [2022-02-20 23:36:35,355 INFO L290 TraceCheckUtils]: 1: Hoare triple {4321#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {4321#true} is VALID [2022-02-20 23:36:35,355 INFO L290 TraceCheckUtils]: 2: Hoare triple {4321#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4321#true} is VALID [2022-02-20 23:36:35,356 INFO L290 TraceCheckUtils]: 3: Hoare triple {4321#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {4323#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:35,356 INFO L290 TraceCheckUtils]: 4: Hoare triple {4323#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {4323#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:35,357 INFO L290 TraceCheckUtils]: 5: Hoare triple {4323#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} assume !(4 + main_~node~1#1.offset <= #length[main_~node~1#1.base] && 0 <= main_~node~1#1.offset); {4322#false} is VALID [2022-02-20 23:36:35,357 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-20 23:36:35,357 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:35,357 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560363638] [2022-02-20 23:36:35,357 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560363638] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:35,358 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:35,358 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:35,358 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1777012533] [2022-02-20 23:36:35,358 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:35,358 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-20 23:36:35,358 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:35,359 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-20 23:36:35,362 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-20 23:36:35,362 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:35,363 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:35,363 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:35,363 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:35,363 INFO L87 Difference]: Start difference. First operand 259 states and 285 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-20 23:36:35,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:35,799 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2022-02-20 23:36:35,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:35,799 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-20 23:36:35,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:35,799 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-20 23:36:35,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 23:36:35,803 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-20 23:36:35,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 446 transitions. [2022-02-20 23:36:35,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 446 transitions. [2022-02-20 23:36:36,066 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,072 INFO L225 Difference]: With dead ends: 400 [2022-02-20 23:36:36,072 INFO L226 Difference]: Without dead ends: 400 [2022-02-20 23:36:36,073 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-20 23:36:36,074 INFO L933 BasicCegarLoop]: 387 mSDtfsCounter, 162 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 560 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:36,074 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 560 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:36,075 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 400 states. [2022-02-20 23:36:36,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 400 to 257. [2022-02-20 23:36:36,080 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:36,080 INFO L82 GeneralOperation]: Start isEquivalent. First operand 400 states. Second operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,081 INFO L74 IsIncluded]: Start isIncluded. First operand 400 states. Second operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,081 INFO L87 Difference]: Start difference. First operand 400 states. Second operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,088 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2022-02-20 23:36:36,089 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 444 transitions. [2022-02-20 23:36:36,089 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,089 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,090 INFO L74 IsIncluded]: Start isIncluded. First operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 400 states. [2022-02-20 23:36:36,090 INFO L87 Difference]: Start difference. First operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 400 states. [2022-02-20 23:36:36,097 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,098 INFO L93 Difference]: Finished difference Result 400 states and 444 transitions. [2022-02-20 23:36:36,098 INFO L276 IsEmpty]: Start isEmpty. Operand 400 states and 444 transitions. [2022-02-20 23:36:36,098 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,099 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:36,099 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:36,099 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 257 states, 140 states have (on average 1.9) internal successors, (266), 254 states have internal predecessors, (266), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 257 states to 257 states and 283 transitions. [2022-02-20 23:36:36,103 INFO L78 Accepts]: Start accepts. Automaton has 257 states and 283 transitions. Word has length 6 [2022-02-20 23:36:36,103 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:36,103 INFO L470 AbstractCegarLoop]: Abstraction has 257 states and 283 transitions. [2022-02-20 23:36:36,104 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-20 23:36:36,104 INFO L276 IsEmpty]: Start isEmpty. Operand 257 states and 283 transitions. [2022-02-20 23:36:36,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:36:36,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:36,104 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:36,104 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:36:36,104 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:36,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:36,105 INFO L85 PathProgramCache]: Analyzing trace with hash 6274696, now seen corresponding path program 1 times [2022-02-20 23:36:36,105 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:36,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [700783088] [2022-02-20 23:36:36,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:36,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:36,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {5783#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {5783#true} is VALID [2022-02-20 23:36:36,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {5783#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {5785#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:36:36,127 INFO L290 TraceCheckUtils]: 2: Hoare triple {5785#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {5785#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:36:36,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {5785#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {5785#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:36:36,127 INFO L290 TraceCheckUtils]: 4: Hoare triple {5785#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {5784#false} is VALID [2022-02-20 23:36:36,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {5784#false} assume inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0; {5784#false} is VALID [2022-02-20 23:36:36,128 INFO L272 TraceCheckUtils]: 6: Hoare triple {5784#false} call fail(); {5784#false} is VALID [2022-02-20 23:36:36,128 INFO L290 TraceCheckUtils]: 7: Hoare triple {5784#false} assume !false; {5784#false} is VALID [2022-02-20 23:36:36,128 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-20 23:36:36,128 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,129 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [700783088] [2022-02-20 23:36:36,129 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [700783088] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,129 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,129 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:36:36,129 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [880147230] [2022-02-20 23:36:36,129 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,130 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:36:36,130 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,130 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,134 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,135 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:36,135 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,135 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:36,135 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:36,135 INFO L87 Difference]: Start difference. First operand 257 states and 283 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,344 INFO L93 Difference]: Finished difference Result 272 states and 296 transitions. [2022-02-20 23:36:36,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:36,345 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 23:36:36,345 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:36,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 23:36:36,347 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,349 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 23:36:36,349 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 297 transitions. [2022-02-20 23:36:36,511 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,514 INFO L225 Difference]: With dead ends: 272 [2022-02-20 23:36:36,514 INFO L226 Difference]: Without dead ends: 271 [2022-02-20 23:36:36,514 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-20 23:36:36,515 INFO L933 BasicCegarLoop]: 278 mSDtfsCounter, 14 mSDsluCounter, 259 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:36,515 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 537 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:36,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 271 states. [2022-02-20 23:36:36,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 271 to 256. [2022-02-20 23:36:36,518 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:36,519 INFO L82 GeneralOperation]: Start isEquivalent. First operand 271 states. Second operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,519 INFO L74 IsIncluded]: Start isIncluded. First operand 271 states. Second operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,519 INFO L87 Difference]: Start difference. First operand 271 states. Second operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,523 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2022-02-20 23:36:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 295 transitions. [2022-02-20 23:36:36,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 271 states. [2022-02-20 23:36:36,525 INFO L87 Difference]: Start difference. First operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 271 states. [2022-02-20 23:36:36,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,529 INFO L93 Difference]: Finished difference Result 271 states and 295 transitions. [2022-02-20 23:36:36,529 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 295 transitions. [2022-02-20 23:36:36,529 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:36,529 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:36,529 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:36,530 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:36,530 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 139 states have (on average 1.8992805755395683) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:36,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2022-02-20 23:36:36,534 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 8 [2022-02-20 23:36:36,534 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:36,534 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2022-02-20 23:36:36,534 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,534 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2022-02-20 23:36:36,534 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:36:36,535 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:36,535 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:36,535 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:36:36,535 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:36,535 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:36,535 INFO L85 PathProgramCache]: Analyzing trace with hash -849555632, now seen corresponding path program 1 times [2022-02-20 23:36:36,536 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:36,536 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1855502601] [2022-02-20 23:36:36,536 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:36,536 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:36,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:36,586 INFO L290 TraceCheckUtils]: 0: Hoare triple {6858#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {6858#true} is VALID [2022-02-20 23:36:36,586 INFO L290 TraceCheckUtils]: 1: Hoare triple {6858#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {6858#true} is VALID [2022-02-20 23:36:36,586 INFO L290 TraceCheckUtils]: 2: Hoare triple {6858#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {6858#true} is VALID [2022-02-20 23:36:36,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {6858#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {6858#true} is VALID [2022-02-20 23:36:36,586 INFO L290 TraceCheckUtils]: 4: Hoare triple {6858#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {6858#true} is VALID [2022-02-20 23:36:36,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {6858#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {6858#true} is VALID [2022-02-20 23:36:36,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {6858#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {6858#true} is VALID [2022-02-20 23:36:36,587 INFO L290 TraceCheckUtils]: 7: Hoare triple {6858#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {6858#true} is VALID [2022-02-20 23:36:36,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {6858#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {6860#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:36:36,588 INFO L290 TraceCheckUtils]: 9: Hoare triple {6860#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {6860#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:36:36,589 INFO L290 TraceCheckUtils]: 10: Hoare triple {6860#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (- 8)) 0))} assume !(4 + main_~item~0#1.offset <= #length[main_~item~0#1.base] && 0 <= main_~item~0#1.offset); {6859#false} is VALID [2022-02-20 23:36:36,589 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:36,589 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:36,589 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1855502601] [2022-02-20 23:36:36,589 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1855502601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:36,589 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:36,589 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:36,590 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11722818] [2022-02-20 23:36:36,590 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:36,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:36:36,590 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:36,591 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:36,597 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:36,597 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:36,597 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:36,598 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:36,598 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:36,975 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2022-02-20 23:36:36,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:36,975 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:36:36,975 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:36,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-02-20 23:36:36,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:36,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-02-20 23:36:36,980 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 377 transitions. [2022-02-20 23:36:37,209 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,213 INFO L225 Difference]: With dead ends: 342 [2022-02-20 23:36:37,213 INFO L226 Difference]: Without dead ends: 342 [2022-02-20 23:36:37,214 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-20 23:36:37,214 INFO L933 BasicCegarLoop]: 227 mSDtfsCounter, 160 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 144 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 346 SdHoareTripleChecker+Invalid, 146 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 144 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:37,215 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 346 Invalid, 146 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 144 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:37,215 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 342 states. [2022-02-20 23:36:37,218 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 342 to 254. [2022-02-20 23:36:37,218 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:37,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 342 states. Second operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,219 INFO L74 IsIncluded]: Start isIncluded. First operand 342 states. Second operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,219 INFO L87 Difference]: Start difference. First operand 342 states. Second operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,224 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2022-02-20 23:36:37,224 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 375 transitions. [2022-02-20 23:36:37,225 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,225 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,225 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 342 states. [2022-02-20 23:36:37,226 INFO L87 Difference]: Start difference. First operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 342 states. [2022-02-20 23:36:37,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,231 INFO L93 Difference]: Finished difference Result 342 states and 375 transitions. [2022-02-20 23:36:37,231 INFO L276 IsEmpty]: Start isEmpty. Operand 342 states and 375 transitions. [2022-02-20 23:36:37,231 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,231 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,232 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:37,232 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:37,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 139 states have (on average 1.8848920863309353) internal successors, (262), 251 states have internal predecessors, (262), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,235 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 279 transitions. [2022-02-20 23:36:37,235 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 279 transitions. Word has length 11 [2022-02-20 23:36:37,236 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:37,236 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 279 transitions. [2022-02-20 23:36:37,236 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,236 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 279 transitions. [2022-02-20 23:36:37,236 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:36:37,236 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:37,236 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:37,237 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:36:37,237 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:37,237 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:37,237 INFO L85 PathProgramCache]: Analyzing trace with hash -849555633, now seen corresponding path program 1 times [2022-02-20 23:36:37,237 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:37,238 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2097662277] [2022-02-20 23:36:37,238 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:37,238 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:37,254 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:37,267 INFO L290 TraceCheckUtils]: 0: Hoare triple {8143#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {8143#true} is VALID [2022-02-20 23:36:37,267 INFO L290 TraceCheckUtils]: 1: Hoare triple {8143#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {8143#true} is VALID [2022-02-20 23:36:37,267 INFO L290 TraceCheckUtils]: 2: Hoare triple {8143#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {8143#true} is VALID [2022-02-20 23:36:37,267 INFO L290 TraceCheckUtils]: 3: Hoare triple {8143#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {8143#true} is VALID [2022-02-20 23:36:37,268 INFO L290 TraceCheckUtils]: 4: Hoare triple {8143#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {8143#true} is VALID [2022-02-20 23:36:37,268 INFO L290 TraceCheckUtils]: 5: Hoare triple {8143#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {8143#true} is VALID [2022-02-20 23:36:37,268 INFO L290 TraceCheckUtils]: 6: Hoare triple {8143#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {8143#true} is VALID [2022-02-20 23:36:37,268 INFO L290 TraceCheckUtils]: 7: Hoare triple {8143#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {8143#true} is VALID [2022-02-20 23:36:37,269 INFO L290 TraceCheckUtils]: 8: Hoare triple {8143#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {8145#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,269 INFO L290 TraceCheckUtils]: 9: Hoare triple {8145#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {8145#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:36:37,269 INFO L290 TraceCheckUtils]: 10: Hoare triple {8145#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} assume !(1 == #valid[main_~item~0#1.base]); {8144#false} is VALID [2022-02-20 23:36:37,269 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-20 23:36:37,270 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:37,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2097662277] [2022-02-20 23:36:37,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2097662277] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:37,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:37,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:36:37,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1939018131] [2022-02-20 23:36:37,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:37,271 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:36:37,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:37,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,277 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:36:37,277 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:37,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:36:37,278 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:36:37,278 INFO L87 Difference]: Start difference. First operand 254 states and 279 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,643 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2022-02-20 23:36:37,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:36:37,643 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 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 11 [2022-02-20 23:36:37,643 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:37,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2022-02-20 23:36:37,646 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,647 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 418 transitions. [2022-02-20 23:36:37,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 418 transitions. [2022-02-20 23:36:37,901 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,906 INFO L225 Difference]: With dead ends: 377 [2022-02-20 23:36:37,906 INFO L226 Difference]: Without dead ends: 377 [2022-02-20 23:36:37,906 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-20 23:36:37,907 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 193 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 312 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:37,907 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 312 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:37,908 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 377 states. [2022-02-20 23:36:37,911 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 377 to 252. [2022-02-20 23:36:37,911 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:37,912 INFO L82 GeneralOperation]: Start isEquivalent. First operand 377 states. Second operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,912 INFO L74 IsIncluded]: Start isIncluded. First operand 377 states. Second operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,913 INFO L87 Difference]: Start difference. First operand 377 states. Second operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,919 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,919 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2022-02-20 23:36:37,919 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 416 transitions. [2022-02-20 23:36:37,920 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,920 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 377 states. [2022-02-20 23:36:37,921 INFO L87 Difference]: Start difference. First operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 377 states. [2022-02-20 23:36:37,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:37,927 INFO L93 Difference]: Finished difference Result 377 states and 416 transitions. [2022-02-20 23:36:37,927 INFO L276 IsEmpty]: Start isEmpty. Operand 377 states and 416 transitions. [2022-02-20 23:36:37,928 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:37,928 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:37,928 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:37,928 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:37,929 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.870503597122302) internal successors, (260), 249 states have internal predecessors, (260), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:37,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 277 transitions. [2022-02-20 23:36:37,932 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 277 transitions. Word has length 11 [2022-02-20 23:36:37,932 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:37,933 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 277 transitions. [2022-02-20 23:36:37,933 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,933 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 277 transitions. [2022-02-20 23:36:37,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:36:37,933 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:37,933 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:37,934 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:36:37,934 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:37,934 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:37,934 INFO L85 PathProgramCache]: Analyzing trace with hash 321246795, now seen corresponding path program 1 times [2022-02-20 23:36:37,934 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:37,935 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [825038684] [2022-02-20 23:36:37,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:37,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:37,958 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:37,978 INFO L290 TraceCheckUtils]: 0: Hoare triple {9531#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {9531#true} is VALID [2022-02-20 23:36:37,979 INFO L290 TraceCheckUtils]: 1: Hoare triple {9531#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {9531#true} is VALID [2022-02-20 23:36:37,979 INFO L290 TraceCheckUtils]: 2: Hoare triple {9531#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {9531#true} is VALID [2022-02-20 23:36:37,979 INFO L290 TraceCheckUtils]: 3: Hoare triple {9531#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {9531#true} is VALID [2022-02-20 23:36:37,979 INFO L290 TraceCheckUtils]: 4: Hoare triple {9531#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {9531#true} is VALID [2022-02-20 23:36:37,980 INFO L290 TraceCheckUtils]: 5: Hoare triple {9531#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {9531#true} is VALID [2022-02-20 23:36:37,980 INFO L290 TraceCheckUtils]: 6: Hoare triple {9531#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {9531#true} is VALID [2022-02-20 23:36:37,980 INFO L290 TraceCheckUtils]: 7: Hoare triple {9531#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {9531#true} is VALID [2022-02-20 23:36:37,980 INFO L290 TraceCheckUtils]: 8: Hoare triple {9531#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:36:37,981 INFO L290 TraceCheckUtils]: 9: Hoare triple {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:36:37,981 INFO L290 TraceCheckUtils]: 10: Hoare triple {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:36:37,981 INFO L290 TraceCheckUtils]: 11: Hoare triple {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} is VALID [2022-02-20 23:36:37,982 INFO L290 TraceCheckUtils]: 12: Hoare triple {9533#(not (= |ULTIMATE.start_main_~item~0#1.base| 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {9534#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:36:37,982 INFO L290 TraceCheckUtils]: 13: Hoare triple {9534#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {9534#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:36:37,983 INFO L290 TraceCheckUtils]: 14: Hoare triple {9534#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {9534#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 23:36:37,983 INFO L290 TraceCheckUtils]: 15: Hoare triple {9534#(not (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume main_~data~0#1.base == 0 && main_~data~0#1.offset == 0;main_#res#1 := 0; {9532#false} is VALID [2022-02-20 23:36:37,983 INFO L290 TraceCheckUtils]: 16: Hoare triple {9532#false} assume !(#valid == main_old_#valid#1); {9532#false} is VALID [2022-02-20 23:36:37,983 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:37,984 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:37,984 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [825038684] [2022-02-20 23:36:37,984 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [825038684] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:37,984 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:37,984 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:37,984 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2081523433] [2022-02-20 23:36:37,984 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:37,985 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:36:37,985 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:37,985 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:37,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:37,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:36:37,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:37,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:36:37,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:36:37,996 INFO L87 Difference]: Start difference. First operand 252 states and 277 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,376 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2022-02-20 23:36:38,376 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:36:38,376 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2022-02-20 23:36:38,376 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:38,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-02-20 23:36:38,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,381 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 448 transitions. [2022-02-20 23:36:38,381 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 448 transitions. [2022-02-20 23:36:38,648 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 448 edges. 448 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:38,654 INFO L225 Difference]: With dead ends: 407 [2022-02-20 23:36:38,654 INFO L226 Difference]: Without dead ends: 407 [2022-02-20 23:36:38,654 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:38,655 INFO L933 BasicCegarLoop]: 266 mSDtfsCounter, 602 mSDsluCounter, 242 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 604 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:38,655 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [604 Valid, 508 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:36:38,656 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 407 states. [2022-02-20 23:36:38,659 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 407 to 252. [2022-02-20 23:36:38,659 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:38,659 INFO L82 GeneralOperation]: Start isEquivalent. First operand 407 states. Second operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:38,660 INFO L74 IsIncluded]: Start isIncluded. First operand 407 states. Second operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:38,660 INFO L87 Difference]: Start difference. First operand 407 states. Second operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:38,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,667 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2022-02-20 23:36:38,667 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 447 transitions. [2022-02-20 23:36:38,668 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,668 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,669 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 407 states. [2022-02-20 23:36:38,669 INFO L87 Difference]: Start difference. First operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 407 states. [2022-02-20 23:36:38,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:38,676 INFO L93 Difference]: Finished difference Result 407 states and 447 transitions. [2022-02-20 23:36:38,676 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 447 transitions. [2022-02-20 23:36:38,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:38,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:38,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:38,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:38,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 139 states have (on average 1.8633093525179856) internal successors, (259), 249 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:38,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 276 transitions. [2022-02-20 23:36:38,681 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 276 transitions. Word has length 17 [2022-02-20 23:36:38,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:38,682 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 276 transitions. [2022-02-20 23:36:38,682 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,682 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 276 transitions. [2022-02-20 23:36:38,682 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:36:38,682 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:38,682 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:38,682 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:36:38,683 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:38,683 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:38,683 INFO L85 PathProgramCache]: Analyzing trace with hash -519843690, now seen corresponding path program 1 times [2022-02-20 23:36:38,683 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:38,683 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984366762] [2022-02-20 23:36:38,684 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:38,684 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:38,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:38,728 INFO L290 TraceCheckUtils]: 0: Hoare triple {11013#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {11013#true} is VALID [2022-02-20 23:36:38,728 INFO L290 TraceCheckUtils]: 1: Hoare triple {11013#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {11013#true} is VALID [2022-02-20 23:36:38,728 INFO L290 TraceCheckUtils]: 2: Hoare triple {11013#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {11013#true} is VALID [2022-02-20 23:36:38,728 INFO L290 TraceCheckUtils]: 3: Hoare triple {11013#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {11013#true} is VALID [2022-02-20 23:36:38,729 INFO L290 TraceCheckUtils]: 4: Hoare triple {11013#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {11013#true} is VALID [2022-02-20 23:36:38,729 INFO L290 TraceCheckUtils]: 5: Hoare triple {11013#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {11013#true} is VALID [2022-02-20 23:36:38,729 INFO L290 TraceCheckUtils]: 6: Hoare triple {11013#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {11013#true} is VALID [2022-02-20 23:36:38,729 INFO L290 TraceCheckUtils]: 7: Hoare triple {11013#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {11013#true} is VALID [2022-02-20 23:36:38,729 INFO L290 TraceCheckUtils]: 8: Hoare triple {11013#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:36:38,730 INFO L290 TraceCheckUtils]: 9: Hoare triple {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:36:38,730 INFO L290 TraceCheckUtils]: 10: Hoare triple {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:36:38,730 INFO L290 TraceCheckUtils]: 11: Hoare triple {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 23:36:38,731 INFO L290 TraceCheckUtils]: 12: Hoare triple {11015#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {11016#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 23:36:38,731 INFO L290 TraceCheckUtils]: 13: Hoare triple {11016#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {11016#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 23:36:38,731 INFO L290 TraceCheckUtils]: 14: Hoare triple {11016#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {11016#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 23:36:38,732 INFO L290 TraceCheckUtils]: 15: Hoare triple {11016#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {11017#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| 0))} is VALID [2022-02-20 23:36:38,732 INFO L290 TraceCheckUtils]: 16: Hoare triple {11017#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| 0))} assume inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0; {11014#false} is VALID [2022-02-20 23:36:38,732 INFO L272 TraceCheckUtils]: 17: Hoare triple {11014#false} call fail(); {11014#false} is VALID [2022-02-20 23:36:38,732 INFO L290 TraceCheckUtils]: 18: Hoare triple {11014#false} assume !false; {11014#false} is VALID [2022-02-20 23:36:38,733 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:38,733 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:38,733 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984366762] [2022-02-20 23:36:38,733 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984366762] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:38,733 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:38,733 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:38,733 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1266340315] [2022-02-20 23:36:38,734 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:38,734 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:36:38,734 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:38,734 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:38,744 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-20 23:36:38,745 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:38,745 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:38,745 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:38,745 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:38,745 INFO L87 Difference]: Start difference. First operand 252 states and 276 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:39,480 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2022-02-20 23:36:39,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:39,480 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 23:36:39,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:39,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 794 transitions. [2022-02-20 23:36:39,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:39,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 794 transitions. [2022-02-20 23:36:39,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 794 transitions. [2022-02-20 23:36:39,978 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 794 edges. 794 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:39,992 INFO L225 Difference]: With dead ends: 714 [2022-02-20 23:36:39,992 INFO L226 Difference]: Without dead ends: 714 [2022-02-20 23:36:39,992 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:39,993 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 1478 mSDsluCounter, 459 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1480 SdHoareTripleChecker+Valid, 705 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:39,993 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1480 Valid, 705 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:39,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 714 states. [2022-02-20 23:36:39,997 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 714 to 280. [2022-02-20 23:36:39,997 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:39,998 INFO L82 GeneralOperation]: Start isEquivalent. First operand 714 states. Second operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:39,998 INFO L74 IsIncluded]: Start isIncluded. First operand 714 states. Second operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:39,999 INFO L87 Difference]: Start difference. First operand 714 states. Second operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:40,013 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,014 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2022-02-20 23:36:40,014 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 789 transitions. [2022-02-20 23:36:40,015 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,015 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,016 INFO L74 IsIncluded]: Start isIncluded. First operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 714 states. [2022-02-20 23:36:40,016 INFO L87 Difference]: Start difference. First operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 714 states. [2022-02-20 23:36:40,032 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:40,033 INFO L93 Difference]: Finished difference Result 714 states and 789 transitions. [2022-02-20 23:36:40,033 INFO L276 IsEmpty]: Start isEmpty. Operand 714 states and 789 transitions. [2022-02-20 23:36:40,034 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:40,034 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:40,034 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:40,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:40,035 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 280 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 277 states have internal predecessors, (312), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:40,038 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 280 states to 280 states and 328 transitions. [2022-02-20 23:36:40,039 INFO L78 Accepts]: Start accepts. Automaton has 280 states and 328 transitions. Word has length 19 [2022-02-20 23:36:40,039 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:40,039 INFO L470 AbstractCegarLoop]: Abstraction has 280 states and 328 transitions. [2022-02-20 23:36:40,039 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:40,039 INFO L276 IsEmpty]: Start isEmpty. Operand 280 states and 328 transitions. [2022-02-20 23:36:40,040 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:36:40,040 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:40,040 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:40,040 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:36:40,040 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:40,040 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:40,041 INFO L85 PathProgramCache]: Analyzing trace with hash -519854939, now seen corresponding path program 1 times [2022-02-20 23:36:40,041 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:40,041 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1876988203] [2022-02-20 23:36:40,041 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:40,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:40,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:40,103 INFO L290 TraceCheckUtils]: 0: Hoare triple {13449#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {13449#true} is VALID [2022-02-20 23:36:40,104 INFO L290 TraceCheckUtils]: 1: Hoare triple {13449#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {13449#true} is VALID [2022-02-20 23:36:40,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {13449#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {13449#true} is VALID [2022-02-20 23:36:40,105 INFO L290 TraceCheckUtils]: 3: Hoare triple {13449#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {13449#true} is VALID [2022-02-20 23:36:40,105 INFO L290 TraceCheckUtils]: 4: Hoare triple {13449#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {13449#true} is VALID [2022-02-20 23:36:40,105 INFO L290 TraceCheckUtils]: 5: Hoare triple {13449#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {13449#true} is VALID [2022-02-20 23:36:40,105 INFO L290 TraceCheckUtils]: 6: Hoare triple {13449#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {13449#true} is VALID [2022-02-20 23:36:40,106 INFO L290 TraceCheckUtils]: 7: Hoare triple {13449#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {13449#true} is VALID [2022-02-20 23:36:40,106 INFO L290 TraceCheckUtils]: 8: Hoare triple {13449#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {13449#true} is VALID [2022-02-20 23:36:40,106 INFO L290 TraceCheckUtils]: 9: Hoare triple {13449#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {13449#true} is VALID [2022-02-20 23:36:40,106 INFO L290 TraceCheckUtils]: 10: Hoare triple {13449#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {13451#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,107 INFO L290 TraceCheckUtils]: 11: Hoare triple {13451#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {13451#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,109 INFO L290 TraceCheckUtils]: 12: Hoare triple {13451#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) 1)} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {13452#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,110 INFO L290 TraceCheckUtils]: 13: Hoare triple {13452#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {13452#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,110 INFO L290 TraceCheckUtils]: 14: Hoare triple {13452#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {13452#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} is VALID [2022-02-20 23:36:40,111 INFO L290 TraceCheckUtils]: 15: Hoare triple {13452#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) 1)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {13453#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) 1)} is VALID [2022-02-20 23:36:40,111 INFO L290 TraceCheckUtils]: 16: Hoare triple {13453#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) 1)} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {13453#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) 1)} is VALID [2022-02-20 23:36:40,113 INFO L290 TraceCheckUtils]: 17: Hoare triple {13453#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) 1)} goto; {13453#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) 1)} is VALID [2022-02-20 23:36:40,113 INFO L290 TraceCheckUtils]: 18: Hoare triple {13453#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) 1)} assume !(1 == #valid[inspect_before_~shape#1.base]); {13450#false} is VALID [2022-02-20 23:36:40,114 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:40,114 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:40,114 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1876988203] [2022-02-20 23:36:40,114 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1876988203] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:40,114 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:40,114 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:40,114 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [549270222] [2022-02-20 23:36:40,114 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:40,115 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:40,116 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:40,116 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:40,126 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-20 23:36:40,126 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:40,126 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:40,127 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:40,127 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:40,127 INFO L87 Difference]: Start difference. First operand 280 states and 328 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,048 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,049 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2022-02-20 23:36:41,049 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:36:41,049 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,049 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:41,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 499 transitions. [2022-02-20 23:36:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 499 transitions. [2022-02-20 23:36:41,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 499 transitions. [2022-02-20 23:36:41,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 499 edges. 499 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:41,399 INFO L225 Difference]: With dead ends: 466 [2022-02-20 23:36:41,400 INFO L226 Difference]: Without dead ends: 466 [2022-02-20 23:36:41,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:41,401 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 646 mSDsluCounter, 364 mSDsCounter, 0 mSdLazyCounter, 465 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 648 SdHoareTripleChecker+Valid, 547 SdHoareTripleChecker+Invalid, 502 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 465 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:41,402 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [648 Valid, 547 Invalid, 502 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 465 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:41,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 466 states. [2022-02-20 23:36:41,405 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 466 to 271. [2022-02-20 23:36:41,406 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:41,406 INFO L82 GeneralOperation]: Start isEquivalent. First operand 466 states. Second operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:41,406 INFO L74 IsIncluded]: Start isIncluded. First operand 466 states. Second operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:41,407 INFO L87 Difference]: Start difference. First operand 466 states. Second operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:41,415 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,416 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2022-02-20 23:36:41,416 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 533 transitions. [2022-02-20 23:36:41,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,417 INFO L74 IsIncluded]: Start isIncluded. First operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 466 states. [2022-02-20 23:36:41,417 INFO L87 Difference]: Start difference. First operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 466 states. [2022-02-20 23:36:41,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:41,426 INFO L93 Difference]: Finished difference Result 466 states and 533 transitions. [2022-02-20 23:36:41,426 INFO L276 IsEmpty]: Start isEmpty. Operand 466 states and 533 transitions. [2022-02-20 23:36:41,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:41,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:41,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:41,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:41,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 271 states, 168 states have (on average 1.7857142857142858) internal successors, (300), 268 states have internal predecessors, (300), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:41,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 271 states to 271 states and 316 transitions. [2022-02-20 23:36:41,431 INFO L78 Accepts]: Start accepts. Automaton has 271 states and 316 transitions. Word has length 19 [2022-02-20 23:36:41,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:41,432 INFO L470 AbstractCegarLoop]: Abstraction has 271 states and 316 transitions. [2022-02-20 23:36:41,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,432 INFO L276 IsEmpty]: Start isEmpty. Operand 271 states and 316 transitions. [2022-02-20 23:36:41,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:36:41,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:41,432 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:41,433 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:36:41,433 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:41,433 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:41,433 INFO L85 PathProgramCache]: Analyzing trace with hash -519854938, now seen corresponding path program 1 times [2022-02-20 23:36:41,433 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:41,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459596568] [2022-02-20 23:36:41,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:41,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:41,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:41,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {15132#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {15132#true} is VALID [2022-02-20 23:36:41,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {15132#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {15132#true} is VALID [2022-02-20 23:36:41,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {15132#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {15132#true} is VALID [2022-02-20 23:36:41,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {15132#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {15132#true} is VALID [2022-02-20 23:36:41,527 INFO L290 TraceCheckUtils]: 4: Hoare triple {15132#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {15132#true} is VALID [2022-02-20 23:36:41,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {15132#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {15132#true} is VALID [2022-02-20 23:36:41,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {15132#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {15132#true} is VALID [2022-02-20 23:36:41,527 INFO L290 TraceCheckUtils]: 7: Hoare triple {15132#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {15132#true} is VALID [2022-02-20 23:36:41,528 INFO L290 TraceCheckUtils]: 8: Hoare triple {15132#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:36:41,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:36:41,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:36:41,530 INFO L290 TraceCheckUtils]: 11: Hoare triple {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} is VALID [2022-02-20 23:36:41,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {15134#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~item~0#1.base|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {15135#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:36:41,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {15135#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {15135#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:36:41,539 INFO L290 TraceCheckUtils]: 14: Hoare triple {15135#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {15135#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} is VALID [2022-02-20 23:36:41,542 INFO L290 TraceCheckUtils]: 15: Hoare triple {15135#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= (select |#length| |ULTIMATE.start_main_~data~0#1.base|) 8))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {15136#(and (= (+ (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|))} is VALID [2022-02-20 23:36:41,543 INFO L290 TraceCheckUtils]: 16: Hoare triple {15136#(and (= (+ (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {15136#(and (= (+ (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|))} is VALID [2022-02-20 23:36:41,543 INFO L290 TraceCheckUtils]: 17: Hoare triple {15136#(and (= (+ (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|))} goto; {15136#(and (= (+ (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|))} is VALID [2022-02-20 23:36:41,544 INFO L290 TraceCheckUtils]: 18: Hoare triple {15136#(and (= (+ (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (- 8)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|))} assume !(4 + (4 + inspect_before_~shape#1.offset) <= #length[inspect_before_~shape#1.base] && 0 <= 4 + inspect_before_~shape#1.offset); {15133#false} is VALID [2022-02-20 23:36:41,544 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:41,545 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:41,545 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459596568] [2022-02-20 23:36:41,545 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459596568] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:41,545 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:41,545 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:36:41,545 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [572053251] [2022-02-20 23:36:41,545 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:41,546 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,546 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:41,546 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:41,557 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-20 23:36:41,557 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:41,557 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:41,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:41,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:41,558 INFO L87 Difference]: Start difference. First operand 271 states and 316 transitions. Second operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:42,579 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:42,580 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2022-02-20 23:36:42,580 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:36:42,580 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:42,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:42,580 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:42,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2022-02-20 23:36:42,585 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:42,589 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 680 transitions. [2022-02-20 23:36:42,589 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 680 transitions. [2022-02-20 23:36:43,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 680 edges. 680 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,045 INFO L225 Difference]: With dead ends: 606 [2022-02-20 23:36:43,045 INFO L226 Difference]: Without dead ends: 606 [2022-02-20 23:36:43,045 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:36:43,045 INFO L933 BasicCegarLoop]: 205 mSDtfsCounter, 891 mSDsluCounter, 366 mSDsCounter, 0 mSdLazyCounter, 384 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 891 SdHoareTripleChecker+Valid, 571 SdHoareTripleChecker+Invalid, 398 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 384 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:43,046 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [891 Valid, 571 Invalid, 398 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 384 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:36:43,046 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-02-20 23:36:43,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 291. [2022-02-20 23:36:43,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:43,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,051 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,051 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,062 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,062 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2022-02-20 23:36:43,063 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 668 transitions. [2022-02-20 23:36:43,063 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,064 INFO L74 IsIncluded]: Start isIncluded. First operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 606 states. [2022-02-20 23:36:43,064 INFO L87 Difference]: Start difference. First operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 606 states. [2022-02-20 23:36:43,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,076 INFO L93 Difference]: Finished difference Result 606 states and 668 transitions. [2022-02-20 23:36:43,076 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 668 transitions. [2022-02-20 23:36:43,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:43,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:43,077 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 291 states, 188 states have (on average 1.7234042553191489) internal successors, (324), 288 states have internal predecessors, (324), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 291 states to 291 states and 340 transitions. [2022-02-20 23:36:43,081 INFO L78 Accepts]: Start accepts. Automaton has 291 states and 340 transitions. Word has length 19 [2022-02-20 23:36:43,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:43,082 INFO L470 AbstractCegarLoop]: Abstraction has 291 states and 340 transitions. [2022-02-20 23:36:43,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.75) internal successors, (19), 5 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-20 23:36:43,082 INFO L276 IsEmpty]: Start isEmpty. Operand 291 states and 340 transitions. [2022-02-20 23:36:43,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:36:43,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:43,082 INFO L514 BasicCegarLoop]: trace histogram [2, 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-20 23:36:43,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:36:43,083 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:43,083 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:43,083 INFO L85 PathProgramCache]: Analyzing trace with hash -1987558854, now seen corresponding path program 1 times [2022-02-20 23:36:43,083 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:43,083 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [744492281] [2022-02-20 23:36:43,084 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:43,084 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:43,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:43,135 INFO L290 TraceCheckUtils]: 0: Hoare triple {17255#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {17255#true} is VALID [2022-02-20 23:36:43,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {17255#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 2: Hoare triple {17255#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {17255#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {17255#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 5: Hoare triple {17255#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 6: Hoare triple {17255#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {17255#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 8: Hoare triple {17255#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {17255#true} is VALID [2022-02-20 23:36:43,136 INFO L290 TraceCheckUtils]: 9: Hoare triple {17255#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 10: Hoare triple {17255#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 11: Hoare triple {17255#true} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 12: Hoare triple {17255#true} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 13: Hoare triple {17255#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 14: Hoare triple {17255#true} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 15: Hoare triple {17255#true} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {17255#true} is VALID [2022-02-20 23:36:43,137 INFO L290 TraceCheckUtils]: 16: Hoare triple {17255#true} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {17255#true} is VALID [2022-02-20 23:36:43,138 INFO L290 TraceCheckUtils]: 17: Hoare triple {17255#true} goto; {17255#true} is VALID [2022-02-20 23:36:43,138 INFO L290 TraceCheckUtils]: 18: Hoare triple {17255#true} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {17257#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} is VALID [2022-02-20 23:36:43,139 INFO L290 TraceCheckUtils]: 19: Hoare triple {17257#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} assume !(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {17258#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 23:36:43,139 INFO L290 TraceCheckUtils]: 20: Hoare triple {17258#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {17258#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 23:36:43,140 INFO L290 TraceCheckUtils]: 21: Hoare triple {17258#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} goto; {17258#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 23:36:43,140 INFO L290 TraceCheckUtils]: 22: Hoare triple {17258#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} SUMMARY for call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L623-4 {17259#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| 0))} is VALID [2022-02-20 23:36:43,141 INFO L290 TraceCheckUtils]: 23: Hoare triple {17259#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| 0))} assume !(inspect_before_#t~mem27#1.base == 0 && inspect_before_#t~mem27#1.offset == 0);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {17256#false} is VALID [2022-02-20 23:36:43,141 INFO L272 TraceCheckUtils]: 24: Hoare triple {17256#false} call fail(); {17256#false} is VALID [2022-02-20 23:36:43,141 INFO L290 TraceCheckUtils]: 25: Hoare triple {17256#false} assume !false; {17256#false} is VALID [2022-02-20 23:36:43,141 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:36:43,141 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:43,142 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [744492281] [2022-02-20 23:36:43,142 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [744492281] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:43,142 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:43,142 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:43,142 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1526727322] [2022-02-20 23:36:43,142 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:43,142 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:36:43,143 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:43,143 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:43,156 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-20 23:36:43,156 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:43,156 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:43,157 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:43,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:43,157 INFO L87 Difference]: Start difference. First operand 291 states and 340 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:43,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,772 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2022-02-20 23:36:43,772 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:43,773 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:36:43,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:43,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:43,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2022-02-20 23:36:43,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:43,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 353 transitions. [2022-02-20 23:36:43,777 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 353 transitions. [2022-02-20 23:36:43,982 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 353 edges. 353 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:43,987 INFO L225 Difference]: With dead ends: 373 [2022-02-20 23:36:43,987 INFO L226 Difference]: Without dead ends: 373 [2022-02-20 23:36:43,987 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:43,988 INFO L933 BasicCegarLoop]: 235 mSDtfsCounter, 103 mSDsluCounter, 603 mSDsCounter, 0 mSdLazyCounter, 182 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 103 SdHoareTripleChecker+Valid, 838 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 182 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:43,988 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [103 Valid, 838 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 182 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:43,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 373 states. [2022-02-20 23:36:43,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 373 to 290. [2022-02-20 23:36:43,992 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:43,992 INFO L82 GeneralOperation]: Start isEquivalent. First operand 373 states. Second operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,993 INFO L74 IsIncluded]: Start isIncluded. First operand 373 states. Second operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,993 INFO L87 Difference]: Start difference. First operand 373 states. Second operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:43,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:43,998 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2022-02-20 23:36:43,998 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 428 transitions. [2022-02-20 23:36:43,999 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:43,999 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:43,999 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 373 states. [2022-02-20 23:36:44,000 INFO L87 Difference]: Start difference. First operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 373 states. [2022-02-20 23:36:44,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,005 INFO L93 Difference]: Finished difference Result 373 states and 428 transitions. [2022-02-20 23:36:44,005 INFO L276 IsEmpty]: Start isEmpty. Operand 373 states and 428 transitions. [2022-02-20 23:36:44,006 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,006 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,006 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:44,006 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:44,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 188 states have (on average 1.7127659574468086) internal successors, (322), 287 states have internal predecessors, (322), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:44,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 337 transitions. [2022-02-20 23:36:44,010 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 337 transitions. Word has length 26 [2022-02-20 23:36:44,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:44,010 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 337 transitions. [2022-02-20 23:36:44,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,011 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 337 transitions. [2022-02-20 23:36:44,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:36:44,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:44,011 INFO L514 BasicCegarLoop]: trace histogram [2, 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-20 23:36:44,011 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:36:44,012 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:44,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:44,012 INFO L85 PathProgramCache]: Analyzing trace with hash 1626991364, now seen corresponding path program 1 times [2022-02-20 23:36:44,012 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:44,012 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [378227622] [2022-02-20 23:36:44,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:44,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:44,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:44,056 INFO L290 TraceCheckUtils]: 0: Hoare triple {18673#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {18673#true} is VALID [2022-02-20 23:36:44,056 INFO L290 TraceCheckUtils]: 1: Hoare triple {18673#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {18673#true} is VALID [2022-02-20 23:36:44,056 INFO L290 TraceCheckUtils]: 2: Hoare triple {18673#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {18673#true} is VALID [2022-02-20 23:36:44,056 INFO L290 TraceCheckUtils]: 3: Hoare triple {18673#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {18673#true} is VALID [2022-02-20 23:36:44,056 INFO L290 TraceCheckUtils]: 4: Hoare triple {18673#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {18673#true} is VALID [2022-02-20 23:36:44,056 INFO L290 TraceCheckUtils]: 5: Hoare triple {18673#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 6: Hoare triple {18673#true} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 7: Hoare triple {18673#true} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 8: Hoare triple {18673#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 9: Hoare triple {18673#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 10: Hoare triple {18673#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 11: Hoare triple {18673#true} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {18673#true} is VALID [2022-02-20 23:36:44,057 INFO L290 TraceCheckUtils]: 12: Hoare triple {18673#true} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {18673#true} is VALID [2022-02-20 23:36:44,058 INFO L290 TraceCheckUtils]: 13: Hoare triple {18673#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {18673#true} is VALID [2022-02-20 23:36:44,058 INFO L290 TraceCheckUtils]: 14: Hoare triple {18673#true} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {18673#true} is VALID [2022-02-20 23:36:44,058 INFO L290 TraceCheckUtils]: 15: Hoare triple {18673#true} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {18673#true} is VALID [2022-02-20 23:36:44,058 INFO L290 TraceCheckUtils]: 16: Hoare triple {18673#true} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {18673#true} is VALID [2022-02-20 23:36:44,058 INFO L290 TraceCheckUtils]: 17: Hoare triple {18673#true} goto; {18673#true} is VALID [2022-02-20 23:36:44,059 INFO L290 TraceCheckUtils]: 18: Hoare triple {18673#true} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {18675#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} is VALID [2022-02-20 23:36:44,059 INFO L290 TraceCheckUtils]: 19: Hoare triple {18675#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {18676#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} is VALID [2022-02-20 23:36:44,060 INFO L290 TraceCheckUtils]: 20: Hoare triple {18676#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {18676#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} is VALID [2022-02-20 23:36:44,060 INFO L290 TraceCheckUtils]: 21: Hoare triple {18676#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} goto; {18676#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} is VALID [2022-02-20 23:36:44,061 INFO L290 TraceCheckUtils]: 22: Hoare triple {18676#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} SUMMARY for call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L618-4 {18677#(or (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.base| 0)) (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.offset| 0)))} is VALID [2022-02-20 23:36:44,064 INFO L290 TraceCheckUtils]: 23: Hoare triple {18677#(or (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.base| 0)) (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.offset| 0)))} assume inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {18674#false} is VALID [2022-02-20 23:36:44,064 INFO L272 TraceCheckUtils]: 24: Hoare triple {18674#false} call fail(); {18674#false} is VALID [2022-02-20 23:36:44,065 INFO L290 TraceCheckUtils]: 25: Hoare triple {18674#false} assume !false; {18674#false} is VALID [2022-02-20 23:36:44,065 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 23:36:44,065 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:44,065 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [378227622] [2022-02-20 23:36:44,065 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [378227622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:44,065 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:44,065 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:36:44,066 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1605576587] [2022-02-20 23:36:44,066 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,066 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:36:44,066 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,066 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,079 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-20 23:36:44,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:36:44,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,080 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:36:44,080 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:36:44,080 INFO L87 Difference]: Start difference. First operand 290 states and 337 transitions. Second operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,567 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,568 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2022-02-20 23:36:44,568 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:36:44,568 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:36:44,568 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:44,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2022-02-20 23:36:44,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 260 transitions. [2022-02-20 23:36:44,571 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 260 transitions. [2022-02-20 23:36:44,730 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 260 edges. 260 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,734 INFO L225 Difference]: With dead ends: 289 [2022-02-20 23:36:44,734 INFO L226 Difference]: Without dead ends: 289 [2022-02-20 23:36:44,734 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:36:44,736 INFO L933 BasicCegarLoop]: 245 mSDtfsCounter, 19 mSDsluCounter, 618 mSDsCounter, 0 mSdLazyCounter, 148 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 863 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 148 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:44,736 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [19 Valid, 863 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 148 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:36:44,737 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 289 states. [2022-02-20 23:36:44,740 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 289 to 289. [2022-02-20 23:36:44,740 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:44,740 INFO L82 GeneralOperation]: Start isEquivalent. First operand 289 states. Second operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:44,741 INFO L74 IsIncluded]: Start isIncluded. First operand 289 states. Second operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:44,741 INFO L87 Difference]: Start difference. First operand 289 states. Second operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:44,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,745 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2022-02-20 23:36:44,745 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2022-02-20 23:36:44,745 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,745 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,746 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 289 states. [2022-02-20 23:36:44,746 INFO L87 Difference]: Start difference. First operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 289 states. [2022-02-20 23:36:44,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:44,751 INFO L93 Difference]: Finished difference Result 289 states and 334 transitions. [2022-02-20 23:36:44,751 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2022-02-20 23:36:44,752 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:44,752 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:44,752 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:44,752 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:44,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.702127659574468) internal successors, (320), 286 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:44,755 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 334 transitions. [2022-02-20 23:36:44,756 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 334 transitions. Word has length 26 [2022-02-20 23:36:44,756 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:44,756 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 334 transitions. [2022-02-20 23:36:44,756 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.8) internal successors, (24), 5 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,756 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 334 transitions. [2022-02-20 23:36:44,757 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:36:44,757 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:44,757 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:44,757 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:36:44,758 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:44,759 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:44,760 INFO L85 PathProgramCache]: Analyzing trace with hash -1169692160, now seen corresponding path program 1 times [2022-02-20 23:36:44,760 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:44,760 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687757132] [2022-02-20 23:36:44,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:44,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:44,779 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:44,852 INFO L290 TraceCheckUtils]: 0: Hoare triple {19838#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {19838#true} is VALID [2022-02-20 23:36:44,852 INFO L290 TraceCheckUtils]: 1: Hoare triple {19838#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {19838#true} is VALID [2022-02-20 23:36:44,852 INFO L290 TraceCheckUtils]: 2: Hoare triple {19838#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {19838#true} is VALID [2022-02-20 23:36:44,853 INFO L290 TraceCheckUtils]: 3: Hoare triple {19838#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,853 INFO L290 TraceCheckUtils]: 4: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,853 INFO L290 TraceCheckUtils]: 5: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,854 INFO L290 TraceCheckUtils]: 6: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,854 INFO L290 TraceCheckUtils]: 7: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,854 INFO L290 TraceCheckUtils]: 8: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,855 INFO L290 TraceCheckUtils]: 9: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:44,855 INFO L290 TraceCheckUtils]: 10: Hoare triple {19840#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {19841#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:44,856 INFO L290 TraceCheckUtils]: 11: Hoare triple {19841#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {19841#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:44,856 INFO L290 TraceCheckUtils]: 12: Hoare triple {19841#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {19842#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:36:44,857 INFO L290 TraceCheckUtils]: 13: Hoare triple {19842#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {19842#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:36:44,857 INFO L290 TraceCheckUtils]: 14: Hoare triple {19842#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {19842#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:36:44,857 INFO L290 TraceCheckUtils]: 15: Hoare triple {19842#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,858 INFO L290 TraceCheckUtils]: 16: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,858 INFO L290 TraceCheckUtils]: 17: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,858 INFO L290 TraceCheckUtils]: 18: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,859 INFO L290 TraceCheckUtils]: 19: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,859 INFO L290 TraceCheckUtils]: 20: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,859 INFO L290 TraceCheckUtils]: 21: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,860 INFO L290 TraceCheckUtils]: 22: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L623-4 {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,860 INFO L290 TraceCheckUtils]: 23: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !!(inspect_before_#t~mem27#1.base == 0 && inspect_before_#t~mem27#1.offset == 0);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,861 INFO L290 TraceCheckUtils]: 24: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:44,864 INFO L290 TraceCheckUtils]: 25: Hoare triple {19843#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L624-4 {19844#(not (= |ULTIMATE.start_inspect_before_#t~mem28#1.base| 0))} is VALID [2022-02-20 23:36:44,864 INFO L290 TraceCheckUtils]: 26: Hoare triple {19844#(not (= |ULTIMATE.start_inspect_before_#t~mem28#1.base| 0))} assume inspect_before_#t~mem28#1.base == 0 && inspect_before_#t~mem28#1.offset == 0;havoc inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset; {19839#false} is VALID [2022-02-20 23:36:44,864 INFO L272 TraceCheckUtils]: 27: Hoare triple {19839#false} call fail(); {19839#false} is VALID [2022-02-20 23:36:44,865 INFO L290 TraceCheckUtils]: 28: Hoare triple {19839#false} assume !false; {19839#false} is VALID [2022-02-20 23:36:44,865 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:44,865 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:44,865 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687757132] [2022-02-20 23:36:44,865 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687757132] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:44,865 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:44,865 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:44,866 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1062769675] [2022-02-20 23:36:44,866 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:44,866 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:36:44,866 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:44,866 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:44,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:44,884 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:36:44,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:44,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:36:44,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:44,885 INFO L87 Difference]: Start difference. First operand 289 states and 334 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:45,912 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:45,913 INFO L93 Difference]: Finished difference Result 604 states and 661 transitions. [2022-02-20 23:36:45,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:36:45,913 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:36:45,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:45,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:45,916 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 662 transitions. [2022-02-20 23:36:45,916 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:45,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 662 transitions. [2022-02-20 23:36:45,918 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 662 transitions. [2022-02-20 23:36:46,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 662 edges. 662 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,347 INFO L225 Difference]: With dead ends: 604 [2022-02-20 23:36:46,347 INFO L226 Difference]: Without dead ends: 604 [2022-02-20 23:36:46,347 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:46,348 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1281 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1283 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:46,348 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1283 Valid, 1040 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:46,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 604 states. [2022-02-20 23:36:46,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 604 to 289. [2022-02-20 23:36:46,352 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:46,352 INFO L82 GeneralOperation]: Start isEquivalent. First operand 604 states. Second operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:46,352 INFO L74 IsIncluded]: Start isIncluded. First operand 604 states. Second operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:46,353 INFO L87 Difference]: Start difference. First operand 604 states. Second operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:46,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,363 INFO L93 Difference]: Finished difference Result 604 states and 661 transitions. [2022-02-20 23:36:46,363 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 661 transitions. [2022-02-20 23:36:46,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,364 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 604 states. [2022-02-20 23:36:46,365 INFO L87 Difference]: Start difference. First operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 604 states. [2022-02-20 23:36:46,375 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:46,375 INFO L93 Difference]: Finished difference Result 604 states and 661 transitions. [2022-02-20 23:36:46,375 INFO L276 IsEmpty]: Start isEmpty. Operand 604 states and 661 transitions. [2022-02-20 23:36:46,376 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:46,376 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:46,376 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:46,377 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:46,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.696808510638298) internal successors, (319), 286 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:46,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 333 transitions. [2022-02-20 23:36:46,380 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 333 transitions. Word has length 29 [2022-02-20 23:36:46,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:46,380 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 333 transitions. [2022-02-20 23:36:46,381 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:46,381 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 333 transitions. [2022-02-20 23:36:46,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:36:46,381 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:46,381 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:46,381 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:36:46,382 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:46,382 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:46,382 INFO L85 PathProgramCache]: Analyzing trace with hash 698957523, now seen corresponding path program 1 times [2022-02-20 23:36:46,382 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:46,382 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879727810] [2022-02-20 23:36:46,382 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:46,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:46,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:46,427 INFO L290 TraceCheckUtils]: 0: Hoare triple {21959#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {21959#true} is VALID [2022-02-20 23:36:46,428 INFO L290 TraceCheckUtils]: 1: Hoare triple {21959#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {21959#true} is VALID [2022-02-20 23:36:46,428 INFO L290 TraceCheckUtils]: 2: Hoare triple {21959#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {21959#true} is VALID [2022-02-20 23:36:46,428 INFO L290 TraceCheckUtils]: 3: Hoare triple {21959#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,428 INFO L290 TraceCheckUtils]: 4: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,429 INFO L290 TraceCheckUtils]: 5: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,429 INFO L290 TraceCheckUtils]: 6: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,429 INFO L290 TraceCheckUtils]: 7: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,430 INFO L290 TraceCheckUtils]: 8: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,430 INFO L290 TraceCheckUtils]: 9: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 23:36:46,430 INFO L290 TraceCheckUtils]: 10: Hoare triple {21961#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {21962#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:46,431 INFO L290 TraceCheckUtils]: 11: Hoare triple {21962#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {21962#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:46,431 INFO L290 TraceCheckUtils]: 12: Hoare triple {21962#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {21963#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:36:46,432 INFO L290 TraceCheckUtils]: 13: Hoare triple {21963#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {21963#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:36:46,432 INFO L290 TraceCheckUtils]: 14: Hoare triple {21963#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {21963#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 23:36:46,432 INFO L290 TraceCheckUtils]: 15: Hoare triple {21963#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,433 INFO L290 TraceCheckUtils]: 16: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,433 INFO L290 TraceCheckUtils]: 17: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,433 INFO L290 TraceCheckUtils]: 18: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,434 INFO L290 TraceCheckUtils]: 19: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,434 INFO L290 TraceCheckUtils]: 20: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,435 INFO L290 TraceCheckUtils]: 21: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,435 INFO L290 TraceCheckUtils]: 22: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L618-4 {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,436 INFO L290 TraceCheckUtils]: 23: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,436 INFO L290 TraceCheckUtils]: 24: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:46,436 INFO L290 TraceCheckUtils]: 25: Hoare triple {21964#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L619-4 {21965#(not (= |ULTIMATE.start_inspect_before_#t~mem23#1.base| 0))} is VALID [2022-02-20 23:36:46,437 INFO L290 TraceCheckUtils]: 26: Hoare triple {21965#(not (= |ULTIMATE.start_inspect_before_#t~mem23#1.base| 0))} assume inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0;havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {21960#false} is VALID [2022-02-20 23:36:46,437 INFO L272 TraceCheckUtils]: 27: Hoare triple {21960#false} call fail(); {21960#false} is VALID [2022-02-20 23:36:46,437 INFO L290 TraceCheckUtils]: 28: Hoare triple {21960#false} assume !false; {21960#false} is VALID [2022-02-20 23:36:46,437 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:46,437 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:46,437 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879727810] [2022-02-20 23:36:46,438 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879727810] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:46,438 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:46,438 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:36:46,438 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [152879258] [2022-02-20 23:36:46,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:46,438 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:36:46,439 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:46,439 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:46,455 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 29 edges. 29 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:46,455 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:36:46,455 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:46,456 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:36:46,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:36:46,456 INFO L87 Difference]: Start difference. First operand 289 states and 333 transitions. Second operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:47,427 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,427 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2022-02-20 23:36:47,427 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:36:47,427 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:36:47,428 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:47,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:47,435 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 660 transitions. [2022-02-20 23:36:47,435 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:47,438 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 660 transitions. [2022-02-20 23:36:47,438 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 660 transitions. [2022-02-20 23:36:47,838 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 660 edges. 660 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:47,849 INFO L225 Difference]: With dead ends: 603 [2022-02-20 23:36:47,849 INFO L226 Difference]: Without dead ends: 603 [2022-02-20 23:36:47,851 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:36:47,852 INFO L933 BasicCegarLoop]: 221 mSDtfsCounter, 1277 mSDsluCounter, 819 mSDsCounter, 0 mSdLazyCounter, 289 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1279 SdHoareTripleChecker+Valid, 1040 SdHoareTripleChecker+Invalid, 300 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 289 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:47,853 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1279 Valid, 1040 Invalid, 300 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 289 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:36:47,853 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 603 states. [2022-02-20 23:36:47,858 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 603 to 289. [2022-02-20 23:36:47,858 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:47,859 INFO L82 GeneralOperation]: Start isEquivalent. First operand 603 states. Second operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:47,859 INFO L74 IsIncluded]: Start isIncluded. First operand 603 states. Second operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:47,859 INFO L87 Difference]: Start difference. First operand 603 states. Second operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:47,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,871 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2022-02-20 23:36:47,871 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 659 transitions. [2022-02-20 23:36:47,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:47,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:47,873 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-02-20 23:36:47,873 INFO L87 Difference]: Start difference. First operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 603 states. [2022-02-20 23:36:47,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:47,884 INFO L93 Difference]: Finished difference Result 603 states and 659 transitions. [2022-02-20 23:36:47,884 INFO L276 IsEmpty]: Start isEmpty. Operand 603 states and 659 transitions. [2022-02-20 23:36:47,885 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:47,885 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:47,885 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:47,885 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:47,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 188 states have (on average 1.6914893617021276) internal successors, (318), 286 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:47,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 332 transitions. [2022-02-20 23:36:47,890 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 332 transitions. Word has length 29 [2022-02-20 23:36:47,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:47,890 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 332 transitions. [2022-02-20 23:36:47,890 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.0) internal successors, (28), 7 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:47,890 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 332 transitions. [2022-02-20 23:36:47,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:36:47,891 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:47,891 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:47,891 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:36:47,892 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr26REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:47,892 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:47,892 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933732, now seen corresponding path program 1 times [2022-02-20 23:36:47,892 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:47,892 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1683142466] [2022-02-20 23:36:47,892 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:47,892 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:47,915 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:48,007 INFO L290 TraceCheckUtils]: 0: Hoare triple {24077#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {24077#true} is VALID [2022-02-20 23:36:48,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {24077#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {24077#true} is VALID [2022-02-20 23:36:48,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {24077#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {24077#true} is VALID [2022-02-20 23:36:48,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {24077#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:48,008 INFO L290 TraceCheckUtils]: 4: Hoare triple {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:48,008 INFO L290 TraceCheckUtils]: 5: Hoare triple {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:48,009 INFO L290 TraceCheckUtils]: 6: Hoare triple {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:48,009 INFO L290 TraceCheckUtils]: 7: Hoare triple {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:48,009 INFO L290 TraceCheckUtils]: 8: Hoare triple {24079#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {24080#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} is VALID [2022-02-20 23:36:48,010 INFO L290 TraceCheckUtils]: 9: Hoare triple {24080#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {24080#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} is VALID [2022-02-20 23:36:48,010 INFO L290 TraceCheckUtils]: 10: Hoare triple {24080#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {24081#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:36:48,012 INFO L290 TraceCheckUtils]: 11: Hoare triple {24081#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {24081#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:36:48,016 INFO L290 TraceCheckUtils]: 12: Hoare triple {24081#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {24082#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:48,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {24082#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {24082#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:48,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {24082#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {24082#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:48,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {24082#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {24083#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} is VALID [2022-02-20 23:36:48,019 INFO L290 TraceCheckUtils]: 16: Hoare triple {24083#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {24083#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} is VALID [2022-02-20 23:36:48,020 INFO L290 TraceCheckUtils]: 17: Hoare triple {24083#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} goto; {24083#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} is VALID [2022-02-20 23:36:48,020 INFO L290 TraceCheckUtils]: 18: Hoare triple {24083#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,020 INFO L290 TraceCheckUtils]: 19: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,021 INFO L290 TraceCheckUtils]: 20: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,021 INFO L290 TraceCheckUtils]: 21: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} goto; {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,021 INFO L290 TraceCheckUtils]: 22: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} SUMMARY for call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L623-4 {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,021 INFO L290 TraceCheckUtils]: 23: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !!(inspect_before_#t~mem27#1.base == 0 && inspect_before_#t~mem27#1.offset == 0);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,022 INFO L290 TraceCheckUtils]: 24: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} goto; {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,022 INFO L290 TraceCheckUtils]: 25: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} SUMMARY for call inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L624-4 {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,022 INFO L290 TraceCheckUtils]: 26: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !(inspect_before_#t~mem28#1.base == 0 && inspect_before_#t~mem28#1.offset == 0);havoc inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset; {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,023 INFO L290 TraceCheckUtils]: 27: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} goto; {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:48,023 INFO L290 TraceCheckUtils]: 28: Hoare triple {24084#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} SUMMARY for call inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L625-5 {24085#(= (select |#valid| |ULTIMATE.start_inspect_before_#t~mem29#1.base|) 1)} is VALID [2022-02-20 23:36:48,023 INFO L290 TraceCheckUtils]: 29: Hoare triple {24085#(= (select |#valid| |ULTIMATE.start_inspect_before_#t~mem29#1.base|) 1)} assume !(1 == #valid[inspect_before_#t~mem29#1.base]); {24078#false} is VALID [2022-02-20 23:36:48,023 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:48,024 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:48,024 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1683142466] [2022-02-20 23:36:48,024 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1683142466] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:48,024 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:48,024 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:48,024 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [311104292] [2022-02-20 23:36:48,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:48,025 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:48,025 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:48,025 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:48,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:48,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:48,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:48,044 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:48,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:48,045 INFO L87 Difference]: Start difference. First operand 289 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:49,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:49,726 INFO L93 Difference]: Finished difference Result 676 states and 747 transitions. [2022-02-20 23:36:49,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:36:49,726 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:49,727 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:49,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:49,732 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 748 transitions. [2022-02-20 23:36:49,732 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:49,738 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 748 transitions. [2022-02-20 23:36:49,738 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 748 transitions. [2022-02-20 23:36:50,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 748 edges. 748 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:50,257 INFO L225 Difference]: With dead ends: 676 [2022-02-20 23:36:50,257 INFO L226 Difference]: Without dead ends: 676 [2022-02-20 23:36:50,257 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:36:50,258 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1609 mSDsluCounter, 631 mSDsCounter, 0 mSdLazyCounter, 671 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1611 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 712 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 671 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:50,258 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1611 Valid, 809 Invalid, 712 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 671 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:36:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 676 states. [2022-02-20 23:36:50,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 676 to 290. [2022-02-20 23:36:50,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:50,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 676 states. Second operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:50,264 INFO L74 IsIncluded]: Start isIncluded. First operand 676 states. Second operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:50,264 INFO L87 Difference]: Start difference. First operand 676 states. Second operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:50,277 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:50,278 INFO L93 Difference]: Finished difference Result 676 states and 747 transitions. [2022-02-20 23:36:50,278 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 747 transitions. [2022-02-20 23:36:50,278 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:50,279 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:50,279 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 676 states. [2022-02-20 23:36:50,279 INFO L87 Difference]: Start difference. First operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 676 states. [2022-02-20 23:36:50,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:50,293 INFO L93 Difference]: Finished difference Result 676 states and 747 transitions. [2022-02-20 23:36:50,293 INFO L276 IsEmpty]: Start isEmpty. Operand 676 states and 747 transitions. [2022-02-20 23:36:50,294 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:50,294 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:50,294 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:50,294 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:50,295 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.693121693121693) internal successors, (320), 287 states have internal predecessors, (320), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:50,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 334 transitions. [2022-02-20 23:36:50,299 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 334 transitions. Word has length 30 [2022-02-20 23:36:50,299 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:50,299 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 334 transitions. [2022-02-20 23:36:50,299 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:50,299 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 334 transitions. [2022-02-20 23:36:50,299 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:36:50,300 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:50,300 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:50,300 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:36:50,300 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:50,300 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:50,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1900933731, now seen corresponding path program 1 times [2022-02-20 23:36:50,301 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:50,301 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [755187424] [2022-02-20 23:36:50,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:50,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:50,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:50,434 INFO L290 TraceCheckUtils]: 0: Hoare triple {26421#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {26421#true} is VALID [2022-02-20 23:36:50,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {26421#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {26421#true} is VALID [2022-02-20 23:36:50,434 INFO L290 TraceCheckUtils]: 2: Hoare triple {26421#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {26421#true} is VALID [2022-02-20 23:36:50,441 INFO L290 TraceCheckUtils]: 3: Hoare triple {26421#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {26423#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,441 INFO L290 TraceCheckUtils]: 4: Hoare triple {26423#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {26423#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,442 INFO L290 TraceCheckUtils]: 5: Hoare triple {26423#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {26424#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,443 INFO L290 TraceCheckUtils]: 6: Hoare triple {26424#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {26424#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,443 INFO L290 TraceCheckUtils]: 7: Hoare triple {26424#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {26424#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,444 INFO L290 TraceCheckUtils]: 8: Hoare triple {26424#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {26425#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,445 INFO L290 TraceCheckUtils]: 9: Hoare triple {26425#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {26425#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:50,445 INFO L290 TraceCheckUtils]: 10: Hoare triple {26425#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {26426#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:50,446 INFO L290 TraceCheckUtils]: 11: Hoare triple {26426#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {26426#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:50,447 INFO L290 TraceCheckUtils]: 12: Hoare triple {26426#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {26427#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} is VALID [2022-02-20 23:36:50,447 INFO L290 TraceCheckUtils]: 13: Hoare triple {26427#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {26427#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} is VALID [2022-02-20 23:36:50,448 INFO L290 TraceCheckUtils]: 14: Hoare triple {26427#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {26427#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} is VALID [2022-02-20 23:36:50,448 INFO L290 TraceCheckUtils]: 15: Hoare triple {26427#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,449 INFO L290 TraceCheckUtils]: 16: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,449 INFO L290 TraceCheckUtils]: 17: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,450 INFO L290 TraceCheckUtils]: 18: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,450 INFO L290 TraceCheckUtils]: 19: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,451 INFO L290 TraceCheckUtils]: 20: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,451 INFO L290 TraceCheckUtils]: 21: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,452 INFO L290 TraceCheckUtils]: 22: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L623-4 {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,452 INFO L290 TraceCheckUtils]: 23: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !!(inspect_before_#t~mem27#1.base == 0 && inspect_before_#t~mem27#1.offset == 0);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,453 INFO L290 TraceCheckUtils]: 24: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,453 INFO L290 TraceCheckUtils]: 25: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L624-4 {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,454 INFO L290 TraceCheckUtils]: 26: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem28#1.base == 0 && inspect_before_#t~mem28#1.offset == 0);havoc inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,454 INFO L290 TraceCheckUtils]: 27: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:50,455 INFO L290 TraceCheckUtils]: 28: Hoare triple {26428#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L625-5 {26429#(and (= (select |#length| |ULTIMATE.start_inspect_before_#t~mem29#1.base|) 8) (= |ULTIMATE.start_inspect_before_#t~mem29#1.offset| 0))} is VALID [2022-02-20 23:36:50,455 INFO L290 TraceCheckUtils]: 29: Hoare triple {26429#(and (= (select |#length| |ULTIMATE.start_inspect_before_#t~mem29#1.base|) 8) (= |ULTIMATE.start_inspect_before_#t~mem29#1.offset| 0))} assume !(4 + inspect_before_#t~mem29#1.offset <= #length[inspect_before_#t~mem29#1.base] && 0 <= inspect_before_#t~mem29#1.offset); {26422#false} is VALID [2022-02-20 23:36:50,455 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:50,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:50,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [755187424] [2022-02-20 23:36:50,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [755187424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:50,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:50,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:50,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1592119971] [2022-02-20 23:36:50,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:50,457 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:50,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:50,457 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:50,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:50,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:50,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:50,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:50,478 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:50,478 INFO L87 Difference]: Start difference. First operand 290 states and 334 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:52,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:52,824 INFO L93 Difference]: Finished difference Result 801 states and 880 transitions. [2022-02-20 23:36:52,825 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:36:52,825 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:52,825 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:52,825 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:52,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 881 transitions. [2022-02-20 23:36:52,828 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:52,831 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 881 transitions. [2022-02-20 23:36:52,832 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 881 transitions. [2022-02-20 23:36:53,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 881 edges. 881 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,498 INFO L225 Difference]: With dead ends: 801 [2022-02-20 23:36:53,498 INFO L226 Difference]: Without dead ends: 801 [2022-02-20 23:36:53,498 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:36:53,499 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 1764 mSDsluCounter, 629 mSDsCounter, 0 mSdLazyCounter, 923 mSolverCounterSat, 42 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1764 SdHoareTripleChecker+Valid, 773 SdHoareTripleChecker+Invalid, 965 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 923 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:53,499 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1764 Valid, 773 Invalid, 965 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 923 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:36:53,499 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 801 states. [2022-02-20 23:36:53,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 801 to 290. [2022-02-20 23:36:53,503 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:53,503 INFO L82 GeneralOperation]: Start isEquivalent. First operand 801 states. Second operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:53,504 INFO L74 IsIncluded]: Start isIncluded. First operand 801 states. Second operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:53,504 INFO L87 Difference]: Start difference. First operand 801 states. Second operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:53,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,522 INFO L93 Difference]: Finished difference Result 801 states and 880 transitions. [2022-02-20 23:36:53,522 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 880 transitions. [2022-02-20 23:36:53,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,524 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 801 states. [2022-02-20 23:36:53,524 INFO L87 Difference]: Start difference. First operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 801 states. [2022-02-20 23:36:53,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:53,543 INFO L93 Difference]: Finished difference Result 801 states and 880 transitions. [2022-02-20 23:36:53,543 INFO L276 IsEmpty]: Start isEmpty. Operand 801 states and 880 transitions. [2022-02-20 23:36:53,544 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:53,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:53,545 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:53,545 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:53,545 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.687830687830688) internal successors, (319), 287 states have internal predecessors, (319), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:53,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 333 transitions. [2022-02-20 23:36:53,548 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 333 transitions. Word has length 30 [2022-02-20 23:36:53,549 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:53,549 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 333 transitions. [2022-02-20 23:36:53,549 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:53,549 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 333 transitions. [2022-02-20 23:36:53,549 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:36:53,549 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:53,549 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:53,549 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:36:53,550 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:53,550 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:53,550 INFO L85 PathProgramCache]: Analyzing trace with hash 192556862, now seen corresponding path program 1 times [2022-02-20 23:36:53,550 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:53,550 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1452348605] [2022-02-20 23:36:53,550 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:53,551 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:53,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:53,627 INFO L290 TraceCheckUtils]: 0: Hoare triple {29148#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {29148#true} is VALID [2022-02-20 23:36:53,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {29148#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {29148#true} is VALID [2022-02-20 23:36:53,628 INFO L290 TraceCheckUtils]: 2: Hoare triple {29148#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {29148#true} is VALID [2022-02-20 23:36:53,628 INFO L290 TraceCheckUtils]: 3: Hoare triple {29148#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {29148#true} is VALID [2022-02-20 23:36:53,628 INFO L290 TraceCheckUtils]: 4: Hoare triple {29148#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {29148#true} is VALID [2022-02-20 23:36:53,629 INFO L290 TraceCheckUtils]: 5: Hoare triple {29148#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {29150#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:53,629 INFO L290 TraceCheckUtils]: 6: Hoare triple {29150#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {29150#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:53,629 INFO L290 TraceCheckUtils]: 7: Hoare triple {29150#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {29150#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} is VALID [2022-02-20 23:36:53,630 INFO L290 TraceCheckUtils]: 8: Hoare triple {29150#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1)} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {29151#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} is VALID [2022-02-20 23:36:53,630 INFO L290 TraceCheckUtils]: 9: Hoare triple {29151#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {29151#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} is VALID [2022-02-20 23:36:53,631 INFO L290 TraceCheckUtils]: 10: Hoare triple {29151#(or (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {29152#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:36:53,632 INFO L290 TraceCheckUtils]: 11: Hoare triple {29152#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {29152#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} is VALID [2022-02-20 23:36:53,632 INFO L290 TraceCheckUtils]: 12: Hoare triple {29152#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 1) (= |ULTIMATE.start_main_~item~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {29153#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:53,633 INFO L290 TraceCheckUtils]: 13: Hoare triple {29153#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {29153#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:53,633 INFO L290 TraceCheckUtils]: 14: Hoare triple {29153#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {29153#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} is VALID [2022-02-20 23:36:53,634 INFO L290 TraceCheckUtils]: 15: Hoare triple {29153#(or (= |ULTIMATE.start_main_~data~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 1))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {29154#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} is VALID [2022-02-20 23:36:53,634 INFO L290 TraceCheckUtils]: 16: Hoare triple {29154#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {29154#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} is VALID [2022-02-20 23:36:53,634 INFO L290 TraceCheckUtils]: 17: Hoare triple {29154#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} goto; {29154#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} is VALID [2022-02-20 23:36:53,635 INFO L290 TraceCheckUtils]: 18: Hoare triple {29154#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1) (= |ULTIMATE.start_inspect_before_~shape#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,635 INFO L290 TraceCheckUtils]: 19: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,635 INFO L290 TraceCheckUtils]: 20: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,635 INFO L290 TraceCheckUtils]: 21: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} goto; {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,636 INFO L290 TraceCheckUtils]: 22: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} SUMMARY for call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L618-4 {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,636 INFO L290 TraceCheckUtils]: 23: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,636 INFO L290 TraceCheckUtils]: 24: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} goto; {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,637 INFO L290 TraceCheckUtils]: 25: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} SUMMARY for call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L619-4 {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,637 INFO L290 TraceCheckUtils]: 26: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} assume !(inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0);havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,637 INFO L290 TraceCheckUtils]: 27: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} goto; {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} is VALID [2022-02-20 23:36:53,638 INFO L290 TraceCheckUtils]: 28: Hoare triple {29155#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|)) 1)} SUMMARY for call inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L620-5 {29156#(= (select |#valid| |ULTIMATE.start_inspect_before_#t~mem24#1.base|) 1)} is VALID [2022-02-20 23:36:53,638 INFO L290 TraceCheckUtils]: 29: Hoare triple {29156#(= (select |#valid| |ULTIMATE.start_inspect_before_#t~mem24#1.base|) 1)} assume !(1 == #valid[inspect_before_#t~mem24#1.base]); {29149#false} is VALID [2022-02-20 23:36:53,638 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:53,638 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:53,638 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1452348605] [2022-02-20 23:36:53,639 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1452348605] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:53,639 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:53,639 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:53,639 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1242680331] [2022-02-20 23:36:53,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:53,639 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:53,639 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:53,640 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:53,657 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:53,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:53,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:53,657 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:53,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:53,658 INFO L87 Difference]: Start difference. First operand 290 states and 333 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:55,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:55,524 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2022-02-20 23:36:55,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:36:55,524 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:55,524 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:55,524 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:55,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 746 transitions. [2022-02-20 23:36:55,528 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:55,533 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 746 transitions. [2022-02-20 23:36:55,533 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 746 transitions. [2022-02-20 23:36:56,036 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 746 edges. 746 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:56,049 INFO L225 Difference]: With dead ends: 674 [2022-02-20 23:36:56,049 INFO L226 Difference]: Without dead ends: 674 [2022-02-20 23:36:56,049 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 18 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=82, Invalid=158, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:36:56,050 INFO L933 BasicCegarLoop]: 178 mSDtfsCounter, 1100 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 918 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1102 SdHoareTripleChecker+Valid, 1092 SdHoareTripleChecker+Invalid, 945 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 918 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:56,050 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1102 Valid, 1092 Invalid, 945 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 918 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:36:56,051 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-02-20 23:36:56,054 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 290. [2022-02-20 23:36:56,054 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:56,055 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:56,055 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:56,055 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:56,067 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:56,068 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2022-02-20 23:36:56,068 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 745 transitions. [2022-02-20 23:36:56,069 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:56,069 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:56,069 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 674 states. [2022-02-20 23:36:56,070 INFO L87 Difference]: Start difference. First operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 674 states. [2022-02-20 23:36:56,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:56,082 INFO L93 Difference]: Finished difference Result 674 states and 745 transitions. [2022-02-20 23:36:56,082 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 745 transitions. [2022-02-20 23:36:56,083 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:56,083 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:56,083 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:56,084 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:56,084 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6825396825396826) internal successors, (318), 287 states have internal predecessors, (318), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:56,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 332 transitions. [2022-02-20 23:36:56,087 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 332 transitions. Word has length 30 [2022-02-20 23:36:56,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:56,088 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 332 transitions. [2022-02-20 23:36:56,088 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:56,088 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 332 transitions. [2022-02-20 23:36:56,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:36:56,088 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:56,088 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:56,088 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:36:56,089 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:56,089 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:56,089 INFO L85 PathProgramCache]: Analyzing trace with hash 192556863, now seen corresponding path program 1 times [2022-02-20 23:36:56,089 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:56,089 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1371278183] [2022-02-20 23:36:56,089 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:56,089 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:56,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:36:56,190 INFO L290 TraceCheckUtils]: 0: Hoare triple {31486#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {31486#true} is VALID [2022-02-20 23:36:56,190 INFO L290 TraceCheckUtils]: 1: Hoare triple {31486#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {31486#true} is VALID [2022-02-20 23:36:56,190 INFO L290 TraceCheckUtils]: 2: Hoare triple {31486#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {31486#true} is VALID [2022-02-20 23:36:56,191 INFO L290 TraceCheckUtils]: 3: Hoare triple {31486#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {31488#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,192 INFO L290 TraceCheckUtils]: 4: Hoare triple {31488#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {31488#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,192 INFO L290 TraceCheckUtils]: 5: Hoare triple {31488#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4); srcloc: L641-2 {31489#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,193 INFO L290 TraceCheckUtils]: 6: Hoare triple {31489#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647; {31489#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,193 INFO L290 TraceCheckUtils]: 7: Hoare triple {31489#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} SUMMARY for call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4); srcloc: L644 {31489#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,194 INFO L290 TraceCheckUtils]: 8: Hoare triple {31489#(and (= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) 1) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)))} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {31490#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,194 INFO L290 TraceCheckUtils]: 9: Hoare triple {31490#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {31490#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} is VALID [2022-02-20 23:36:56,195 INFO L290 TraceCheckUtils]: 10: Hoare triple {31490#(and (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (not (= |ULTIMATE.start_main_~item~0#1.base| |ULTIMATE.start_main_~node~1#1.base|)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4); srcloc: L646-2 {31491#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:56,196 INFO L290 TraceCheckUtils]: 11: Hoare triple {31491#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4); srcloc: L648 {31491#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:36:56,196 INFO L290 TraceCheckUtils]: 12: Hoare triple {31491#(and (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|)) 8) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) |ULTIMATE.start_main_~item~0#1.offset|) 0))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {31492#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} is VALID [2022-02-20 23:36:56,197 INFO L290 TraceCheckUtils]: 13: Hoare triple {31492#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {31492#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} is VALID [2022-02-20 23:36:56,201 INFO L290 TraceCheckUtils]: 14: Hoare triple {31492#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {31492#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} is VALID [2022-02-20 23:36:56,202 INFO L290 TraceCheckUtils]: 15: Hoare triple {31492#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)) 8))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,202 INFO L290 TraceCheckUtils]: 16: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,203 INFO L290 TraceCheckUtils]: 17: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L616-4 {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,204 INFO L290 TraceCheckUtils]: 19: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,204 INFO L290 TraceCheckUtils]: 20: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,204 INFO L290 TraceCheckUtils]: 21: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,205 INFO L290 TraceCheckUtils]: 22: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); srcloc: L618-4 {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,205 INFO L290 TraceCheckUtils]: 23: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,206 INFO L290 TraceCheckUtils]: 24: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,206 INFO L290 TraceCheckUtils]: 25: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L619-4 {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,207 INFO L290 TraceCheckUtils]: 26: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0);havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,207 INFO L290 TraceCheckUtils]: 27: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 23:36:56,208 INFO L290 TraceCheckUtils]: 28: Hoare triple {31493#(and (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} SUMMARY for call inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); srcloc: L620-5 {31494#(and (= |ULTIMATE.start_inspect_before_#t~mem24#1.offset| 0) (= (select |#length| |ULTIMATE.start_inspect_before_#t~mem24#1.base|) 8))} is VALID [2022-02-20 23:36:56,208 INFO L290 TraceCheckUtils]: 29: Hoare triple {31494#(and (= |ULTIMATE.start_inspect_before_#t~mem24#1.offset| 0) (= (select |#length| |ULTIMATE.start_inspect_before_#t~mem24#1.base|) 8))} assume !(4 + inspect_before_#t~mem24#1.offset <= #length[inspect_before_#t~mem24#1.base] && 0 <= inspect_before_#t~mem24#1.offset); {31487#false} is VALID [2022-02-20 23:36:56,209 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:36:56,209 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:36:56,209 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1371278183] [2022-02-20 23:36:56,209 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1371278183] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:36:56,209 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:36:56,209 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:36:56,210 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [600929261] [2022-02-20 23:36:56,210 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:36:56,211 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:56,211 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:36:56,211 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:56,231 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:56,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:36:56,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:36:56,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:36:56,233 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:36:56,233 INFO L87 Difference]: Start difference. First operand 290 states and 332 transitions. Second operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,605 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:58,606 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2022-02-20 23:36:58,606 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:36:58,606 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2022-02-20 23:36:58,606 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:36:58,606 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 879 transitions. [2022-02-20 23:36:58,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:58,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 879 transitions. [2022-02-20 23:36:58,613 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 879 transitions. [2022-02-20 23:36:59,298 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 879 edges. 879 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:36:59,316 INFO L225 Difference]: With dead ends: 799 [2022-02-20 23:36:59,316 INFO L226 Difference]: Without dead ends: 799 [2022-02-20 23:36:59,316 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 60 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=124, Invalid=256, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:36:59,316 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 2091 mSDsluCounter, 604 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 53 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2091 SdHoareTripleChecker+Valid, 748 SdHoareTripleChecker+Invalid, 905 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 53 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:36:59,316 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2091 Valid, 748 Invalid, 905 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [53 Valid, 852 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:36:59,317 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 799 states. [2022-02-20 23:36:59,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 799 to 290. [2022-02-20 23:36:59,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:36:59,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 799 states. Second operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:59,321 INFO L74 IsIncluded]: Start isIncluded. First operand 799 states. Second operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:59,321 INFO L87 Difference]: Start difference. First operand 799 states. Second operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:59,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:59,339 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2022-02-20 23:36:59,340 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 878 transitions. [2022-02-20 23:36:59,341 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:59,341 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:59,341 INFO L74 IsIncluded]: Start isIncluded. First operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 799 states. [2022-02-20 23:36:59,342 INFO L87 Difference]: Start difference. First operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 799 states. [2022-02-20 23:36:59,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:36:59,361 INFO L93 Difference]: Finished difference Result 799 states and 878 transitions. [2022-02-20 23:36:59,361 INFO L276 IsEmpty]: Start isEmpty. Operand 799 states and 878 transitions. [2022-02-20 23:36:59,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:36:59,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:36:59,362 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:36:59,362 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:36:59,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 290 states, 189 states have (on average 1.6772486772486772) internal successors, (317), 287 states have internal predecessors, (317), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:36:59,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 290 states to 290 states and 331 transitions. [2022-02-20 23:36:59,365 INFO L78 Accepts]: Start accepts. Automaton has 290 states and 331 transitions. Word has length 30 [2022-02-20 23:36:59,366 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:36:59,366 INFO L470 AbstractCegarLoop]: Abstraction has 290 states and 331 transitions. [2022-02-20 23:36:59,366 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.75) internal successors, (30), 9 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:36:59,366 INFO L276 IsEmpty]: Start isEmpty. Operand 290 states and 331 transitions. [2022-02-20 23:36:59,366 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:36:59,366 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:36:59,366 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:59,367 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:36:59,367 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:36:59,367 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:36:59,367 INFO L85 PathProgramCache]: Analyzing trace with hash -1572782387, now seen corresponding path program 1 times [2022-02-20 23:36:59,367 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:36:59,367 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1052631839] [2022-02-20 23:36:59,368 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:36:59,368 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:36:59,385 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:36:59,385 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 23:36:59,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 23:36:59,413 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 23:36:59,413 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 23:36:59,414 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONMEMORY_LEAK (104 of 105 remaining) [2022-02-20 23:36:59,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr0REQUIRES_VIOLATION (103 of 105 remaining) [2022-02-20 23:36:59,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr1REQUIRES_VIOLATION (102 of 105 remaining) [2022-02-20 23:36:59,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr2REQUIRES_VIOLATION (101 of 105 remaining) [2022-02-20 23:36:59,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr3REQUIRES_VIOLATION (100 of 105 remaining) [2022-02-20 23:36:59,415 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr4REQUIRES_VIOLATION (99 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr5REQUIRES_VIOLATION (98 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr6REQUIRES_VIOLATION (97 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr7REQUIRES_VIOLATION (96 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr8REQUIRES_VIOLATION (95 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr9REQUIRES_VIOLATION (94 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr10REQUIRES_VIOLATION (93 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr11REQUIRES_VIOLATION (92 of 105 remaining) [2022-02-20 23:36:59,416 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr12REQUIRES_VIOLATION (91 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location merge_single_nodeErr13REQUIRES_VIOLATION (90 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr0REQUIRES_VIOLATION (89 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr1REQUIRES_VIOLATION (88 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr2REQUIRES_VIOLATION (87 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr3REQUIRES_VIOLATION (86 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr4REQUIRES_VIOLATION (85 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr5REQUIRES_VIOLATION (84 of 105 remaining) [2022-02-20 23:36:59,417 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr6REQUIRES_VIOLATION (83 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr7REQUIRES_VIOLATION (82 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr8REQUIRES_VIOLATION (81 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr9REQUIRES_VIOLATION (80 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr10REQUIRES_VIOLATION (79 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr11REQUIRES_VIOLATION (78 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr12REQUIRES_VIOLATION (77 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr13REQUIRES_VIOLATION (76 of 105 remaining) [2022-02-20 23:36:59,418 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr14REQUIRES_VIOLATION (75 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr15REQUIRES_VIOLATION (74 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr16REQUIRES_VIOLATION (73 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr17REQUIRES_VIOLATION (72 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr18REQUIRES_VIOLATION (71 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr19REQUIRES_VIOLATION (70 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr20REQUIRES_VIOLATION (69 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr21REQUIRES_VIOLATION (68 of 105 remaining) [2022-02-20 23:36:59,419 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr22REQUIRES_VIOLATION (67 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr23REQUIRES_VIOLATION (66 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr24REQUIRES_VIOLATION (65 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr25REQUIRES_VIOLATION (64 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr26REQUIRES_VIOLATION (63 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr27REQUIRES_VIOLATION (62 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr28REQUIRES_VIOLATION (61 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr29REQUIRES_VIOLATION (60 of 105 remaining) [2022-02-20 23:36:59,420 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr30REQUIRES_VIOLATION (59 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr31REQUIRES_VIOLATION (58 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr32REQUIRES_VIOLATION (57 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr33REQUIRES_VIOLATION (56 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr34REQUIRES_VIOLATION (55 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr35REQUIRES_VIOLATION (54 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr36REQUIRES_VIOLATION (53 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr37REQUIRES_VIOLATION (52 of 105 remaining) [2022-02-20 23:36:59,421 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr38REQUIRES_VIOLATION (51 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr39REQUIRES_VIOLATION (50 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr40REQUIRES_VIOLATION (49 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr41REQUIRES_VIOLATION (48 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr42REQUIRES_VIOLATION (47 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr43REQUIRES_VIOLATION (46 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr44REQUIRES_VIOLATION (45 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr45REQUIRES_VIOLATION (44 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr46REQUIRES_VIOLATION (43 of 105 remaining) [2022-02-20 23:36:59,422 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr47REQUIRES_VIOLATION (42 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr48REQUIRES_VIOLATION (41 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr49REQUIRES_VIOLATION (40 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr50REQUIRES_VIOLATION (39 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr51REQUIRES_VIOLATION (38 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr52REQUIRES_VIOLATION (37 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr53REQUIRES_VIOLATION (36 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr54REQUIRES_VIOLATION (35 of 105 remaining) [2022-02-20 23:36:59,423 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr55REQUIRES_VIOLATION (34 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr56REQUIRES_VIOLATION (33 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr57REQUIRES_VIOLATION (32 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr58REQUIRES_VIOLATION (31 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr59REQUIRES_VIOLATION (30 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr60REQUIRES_VIOLATION (29 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr61REQUIRES_VIOLATION (28 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr62REQUIRES_VIOLATION (27 of 105 remaining) [2022-02-20 23:36:59,424 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr63REQUIRES_VIOLATION (26 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_FREE (25 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr65ASSERT_VIOLATIONMEMORY_FREE (24 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_FREE (23 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr67REQUIRES_VIOLATION (22 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr68REQUIRES_VIOLATION (21 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr69REQUIRES_VIOLATION (20 of 105 remaining) [2022-02-20 23:36:59,425 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr70REQUIRES_VIOLATION (19 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr71REQUIRES_VIOLATION (18 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr72REQUIRES_VIOLATION (17 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr73REQUIRES_VIOLATION (16 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr74REQUIRES_VIOLATION (15 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr75REQUIRES_VIOLATION (14 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr76REQUIRES_VIOLATION (13 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr77REQUIRES_VIOLATION (12 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr78REQUIRES_VIOLATION (11 of 105 remaining) [2022-02-20 23:36:59,426 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr79REQUIRES_VIOLATION (10 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr80REQUIRES_VIOLATION (9 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr81ASSERT_VIOLATIONMEMORY_FREE (8 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr82ASSERT_VIOLATIONMEMORY_FREE (7 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr83ASSERT_VIOLATIONMEMORY_FREE (6 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr84REQUIRES_VIOLATION (5 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr85REQUIRES_VIOLATION (4 of 105 remaining) [2022-02-20 23:36:59,427 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr86ASSERT_VIOLATIONMEMORY_FREE (3 of 105 remaining) [2022-02-20 23:36:59,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr87ASSERT_VIOLATIONMEMORY_FREE (2 of 105 remaining) [2022-02-20 23:36:59,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr88ASSERT_VIOLATIONMEMORY_FREE (1 of 105 remaining) [2022-02-20 23:36:59,428 INFO L764 garLoopResultBuilder]: Registering result UNKNOWN for location ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK (0 of 105 remaining) [2022-02-20 23:36:59,428 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:36:59,431 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:36:59,433 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 23:36:59,448 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call fail(); [2022-02-20 23:36:59,448 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 23:36:59,453 INFO L158 Benchmark]: Toolchain (without parser) took 27861.94ms. Allocated memory was 92.3MB in the beginning and 195.0MB in the end (delta: 102.8MB). Free memory was 52.8MB in the beginning and 128.6MB in the end (delta: -75.9MB). Peak memory consumption was 27.5MB. Max. memory is 16.1GB. [2022-02-20 23:36:59,453 INFO L158 Benchmark]: CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:36:59,453 INFO L158 Benchmark]: CACSL2BoogieTranslator took 301.15ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 52.5MB in the beginning and 102.3MB in the end (delta: -49.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. [2022-02-20 23:36:59,453 INFO L158 Benchmark]: Boogie Procedure Inliner took 47.87ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 98.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:59,453 INFO L158 Benchmark]: Boogie Preprocessor took 29.95ms. Allocated memory is still 134.2MB. Free memory was 98.8MB in the beginning and 95.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:59,454 INFO L158 Benchmark]: RCFGBuilder took 798.92ms. Allocated memory is still 134.2MB. Free memory was 95.3MB in the beginning and 104.3MB in the end (delta: -9.0MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. [2022-02-20 23:36:59,454 INFO L158 Benchmark]: TraceAbstraction took 26667.97ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 103.4MB in the beginning and 128.6MB in the end (delta: -25.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. [2022-02-20 23:36:59,454 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.16ms. Allocated memory is still 92.3MB. Free memory is still 70.3MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 301.15ms. Allocated memory was 92.3MB in the beginning and 134.2MB in the end (delta: 41.9MB). Free memory was 52.5MB in the beginning and 102.3MB in the end (delta: -49.8MB). Peak memory consumption was 14.0MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 47.87ms. Allocated memory is still 134.2MB. Free memory was 102.3MB in the beginning and 98.8MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 29.95ms. Allocated memory is still 134.2MB. Free memory was 98.8MB in the beginning and 95.3MB in the end (delta: 3.5MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 798.92ms. Allocated memory is still 134.2MB. Free memory was 95.3MB in the beginning and 104.3MB in the end (delta: -9.0MB). Peak memory consumption was 49.7MB. Max. memory is 16.1GB. * TraceAbstraction took 26667.97ms. Allocated memory was 134.2MB in the beginning and 195.0MB in the end (delta: 60.8MB). Free memory was 103.4MB in the beginning and 128.6MB in the end (delta: -25.2MB). Peak memory consumption was 35.2MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:36:59,481 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### 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/heap-manipulation/merge_sort-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.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-memcleanup) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:37:01,125 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:37:01,127 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:37:01,158 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:37:01,158 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:37:01,160 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:37:01,161 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:37:01,165 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:37:01,167 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:37:01,169 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:37:01,170 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:37:01,173 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:37:01,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:37:01,183 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:37:01,183 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:37:01,184 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:37:01,184 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:37:01,185 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:37:01,185 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:37:01,186 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:37:01,187 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:37:01,204 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:37:01,205 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:37:01,206 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:37:01,212 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:37:01,213 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:37:01,213 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:37:01,214 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:37:01,214 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:37:01,215 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:37:01,215 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:37:01,216 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:37:01,217 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:37:01,217 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:37:01,218 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:37:01,218 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:37:01,219 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:37:01,219 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:37:01,219 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:37:01,220 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:37:01,221 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:37:01,235 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-MemCleanup-32bit-Automizer_Bitvector.epf [2022-02-20 23:37:01,260 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:37:01,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:37:01,261 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:37:01,261 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:37:01,262 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:37:01,262 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:37:01,263 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:37:01,263 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:37:01,263 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:37:01,263 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:37:01,264 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:37:01,264 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:37:01,264 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:37:01,264 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:37:01,264 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:37:01,264 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:37:01,265 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:37:01,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:37:01,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:37:01,266 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:37:01,266 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:37:01,266 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:37:01,266 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:37:01,267 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:37:01,267 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:37:01,267 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:37:01,267 INFO L138 SettingsManager]: * Logic for external solver=AUFBV 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-memcleanup) ) 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2022-02-20 23:37:01,544 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:37:01,568 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:37:01,570 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:37:01,571 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:37:01,573 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:37:01,574 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 23:37:01,638 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4349c10be/d7a370dc93714b46b3d2128447bdfd78/FLAGf9a1f5c7c [2022-02-20 23:37:02,008 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:37:02,008 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 23:37:02,021 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4349c10be/d7a370dc93714b46b3d2128447bdfd78/FLAGf9a1f5c7c [2022-02-20 23:37:02,356 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/4349c10be/d7a370dc93714b46b3d2128447bdfd78 [2022-02-20 23:37:02,358 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:37:02,360 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:37:02,361 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:37:02,362 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:37:02,367 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:37:02,368 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,368 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@15d59bba and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02, skipping insertion in model container [2022-02-20 23:37:02,370 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,374 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:37:02,399 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:37:02,610 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/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 23:37:02,648 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:37:02,667 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:37:02,700 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/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 23:37:02,733 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:37:02,762 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:37:02,763 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02 WrapperNode [2022-02-20 23:37:02,763 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:37:02,764 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:37:02,764 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:37:02,764 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:37:02,768 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,799 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,836 INFO L137 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 293 [2022-02-20 23:37:02,843 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:37:02,844 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:37:02,844 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:37:02,845 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:37:02,850 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,850 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,853 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,853 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,864 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,868 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,870 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,873 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:37:02,874 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:37:02,874 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:37:02,874 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:37:02,874 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (1/1) ... [2022-02-20 23:37:02,894 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:37:02,900 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:37:02,910 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-20 23:37:02,916 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-20 23:37:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 23:37:02,936 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-02-20 23:37:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-02-20 23:37:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-02-20 23:37:02,937 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-02-20 23:37:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:37:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:37:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:37:02,937 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:37:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:37:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 23:37:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:37:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:37:02,938 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:37:02,938 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:37:03,027 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:37:03,032 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:37:03,717 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:37:03,723 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:37:03,724 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-02-20 23:37:03,725 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:03 BoogieIcfgContainer [2022-02-20 23:37:03,725 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:37:03,730 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:37:03,730 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:37:03,732 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:37:03,732 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:37:02" (1/3) ... [2022-02-20 23:37:03,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1481b784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:03, skipping insertion in model container [2022-02-20 23:37:03,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:37:02" (2/3) ... [2022-02-20 23:37:03,733 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1481b784 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:37:03, skipping insertion in model container [2022-02-20 23:37:03,733 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:37:03" (3/3) ... [2022-02-20 23:37:03,734 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-02-20 23:37:03,749 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:37:03,749 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 105 error locations. [2022-02-20 23:37:03,782 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:37:03,786 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-20 23:37:03,786 INFO L340 AbstractCegarLoop]: Starting to check reachability of 105 error locations. [2022-02-20 23:37:03,805 INFO L276 IsEmpty]: Start isEmpty. Operand has 260 states, 137 states have (on average 2.2116788321167884) internal successors, (303), 257 states have internal predecessors, (303), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 23:37:03,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:37:03,809 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:03,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:37:03,810 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:03,818 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:03,818 INFO L85 PathProgramCache]: Analyzing trace with hash 56402904, now seen corresponding path program 1 times [2022-02-20 23:37:03,826 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:03,827 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [351593279] [2022-02-20 23:37:03,827 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:03,828 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:03,828 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:03,830 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:03,831 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 23:37:03,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:03,883 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 23:37:03,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:03,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:03,917 INFO L290 TraceCheckUtils]: 0: Hoare triple {263#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {263#true} is VALID [2022-02-20 23:37:03,918 INFO L290 TraceCheckUtils]: 1: Hoare triple {263#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {263#true} is VALID [2022-02-20 23:37:03,918 INFO L290 TraceCheckUtils]: 2: Hoare triple {263#true} assume !true; {264#false} is VALID [2022-02-20 23:37:03,919 INFO L290 TraceCheckUtils]: 3: Hoare triple {264#false} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {264#false} is VALID [2022-02-20 23:37:03,919 INFO L290 TraceCheckUtils]: 4: Hoare triple {264#false} assume !(#valid == main_old_#valid#1); {264#false} is VALID [2022-02-20 23:37:03,920 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-20 23:37:03,920 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:03,920 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:03,921 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [351593279] [2022-02-20 23:37:03,921 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [351593279] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:03,921 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:03,921 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:03,922 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1175797166] [2022-02-20 23:37:03,923 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:03,926 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-20 23:37:03,927 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:03,929 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-20 23:37:03,934 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-20 23:37:03,934 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:37:03,934 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:03,947 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:37:03,948 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:37:03,955 INFO L87 Difference]: Start difference. First operand has 260 states, 137 states have (on average 2.2116788321167884) internal successors, (303), 257 states have internal predecessors, (303), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) 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-20 23:37:04,329 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,330 INFO L93 Difference]: Finished difference Result 258 states and 283 transitions. [2022-02-20 23:37:04,330 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:37:04,330 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-20 23:37:04,330 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:04,331 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-20 23:37:04,338 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2022-02-20 23:37:04,338 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-20 23:37:04,341 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 319 transitions. [2022-02-20 23:37:04,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 319 transitions. [2022-02-20 23:37:04,620 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 319 edges. 319 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:04,645 INFO L225 Difference]: With dead ends: 258 [2022-02-20 23:37:04,646 INFO L226 Difference]: Without dead ends: 256 [2022-02-20 23:37:04,647 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 4 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-20 23:37:04,652 INFO L933 BasicCegarLoop]: 283 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, 283 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-20 23:37:04,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 283 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:04,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 256 states. [2022-02-20 23:37:04,680 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 256 to 256. [2022-02-20 23:37:04,681 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:04,682 INFO L82 GeneralOperation]: Start isEquivalent. First operand 256 states. Second operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:04,683 INFO L74 IsIncluded]: Start isIncluded. First operand 256 states. Second operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:04,683 INFO L87 Difference]: Start difference. First operand 256 states. Second operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:04,693 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,693 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2022-02-20 23:37:04,694 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2022-02-20 23:37:04,695 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,695 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 256 states. [2022-02-20 23:37:04,696 INFO L87 Difference]: Start difference. First operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 256 states. [2022-02-20 23:37:04,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:04,705 INFO L93 Difference]: Finished difference Result 256 states and 281 transitions. [2022-02-20 23:37:04,705 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2022-02-20 23:37:04,707 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:04,707 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:04,707 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:04,707 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:04,708 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 135 states have (on average 1.9555555555555555) internal successors, (264), 253 states have internal predecessors, (264), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:04,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 281 transitions. [2022-02-20 23:37:04,716 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 281 transitions. Word has length 5 [2022-02-20 23:37:04,716 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:04,716 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 281 transitions. [2022-02-20 23:37:04,716 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-20 23:37:04,717 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 281 transitions. [2022-02-20 23:37:04,721 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:37:04,721 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:04,721 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:37:04,727 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:04,928 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:04,928 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:04,929 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:04,929 INFO L85 PathProgramCache]: Analyzing trace with hash 56374074, now seen corresponding path program 1 times [2022-02-20 23:37:04,929 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:04,929 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [738542613] [2022-02-20 23:37:04,929 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:04,929 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:04,930 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:04,931 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:04,932 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 23:37:04,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:04,969 INFO L263 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 2 conjunts are in the unsatisfiable core [2022-02-20 23:37:05,000 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:05,000 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:05,014 INFO L290 TraceCheckUtils]: 0: Hoare triple {1305#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {1305#true} is VALID [2022-02-20 23:37:05,015 INFO L290 TraceCheckUtils]: 1: Hoare triple {1305#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {1313#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:37:05,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {1313#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {1313#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:37:05,016 INFO L290 TraceCheckUtils]: 3: Hoare triple {1313#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {1313#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} is VALID [2022-02-20 23:37:05,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {1313#(= |#valid| |ULTIMATE.start_main_old_#valid#1|)} assume !(#valid == main_old_#valid#1); {1306#false} is VALID [2022-02-20 23:37:05,016 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-20 23:37:05,016 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:05,016 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:05,017 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [738542613] [2022-02-20 23:37:05,017 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [738542613] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:05,017 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:05,017 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:05,017 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1597304330] [2022-02-20 23:37:05,017 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:05,018 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:05,018 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:05,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:05,022 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-20 23:37:05,022 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:05,022 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:05,023 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:05,023 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:05,023 INFO L87 Difference]: Start difference. First operand 256 states and 281 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:05,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:05,947 INFO L93 Difference]: Finished difference Result 388 states and 432 transitions. [2022-02-20 23:37:05,947 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:05,948 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:05,948 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:05,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:05,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-02-20 23:37:05,952 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:05,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 433 transitions. [2022-02-20 23:37:05,956 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 433 transitions. [2022-02-20 23:37:06,299 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 433 edges. 433 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:06,306 INFO L225 Difference]: With dead ends: 388 [2022-02-20 23:37:06,306 INFO L226 Difference]: Without dead ends: 387 [2022-02-20 23:37:06,307 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 23:37:06,307 INFO L933 BasicCegarLoop]: 233 mSDtfsCounter, 133 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 392 SdHoareTripleChecker+Invalid, 169 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:06,308 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [133 Valid, 392 Invalid, 169 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:06,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 387 states. [2022-02-20 23:37:06,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 387 to 258. [2022-02-20 23:37:06,316 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:06,316 INFO L82 GeneralOperation]: Start isEquivalent. First operand 387 states. Second operand has 258 states, 137 states have (on average 1.948905109489051) internal successors, (267), 255 states have internal predecessors, (267), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:06,317 INFO L74 IsIncluded]: Start isIncluded. First operand 387 states. Second operand has 258 states, 137 states have (on average 1.948905109489051) internal successors, (267), 255 states have internal predecessors, (267), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:06,317 INFO L87 Difference]: Start difference. First operand 387 states. Second operand has 258 states, 137 states have (on average 1.948905109489051) internal successors, (267), 255 states have internal predecessors, (267), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:06,340 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:06,341 INFO L93 Difference]: Finished difference Result 387 states and 431 transitions. [2022-02-20 23:37:06,341 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 431 transitions. [2022-02-20 23:37:06,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:06,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:06,346 INFO L74 IsIncluded]: Start isIncluded. First operand has 258 states, 137 states have (on average 1.948905109489051) internal successors, (267), 255 states have internal predecessors, (267), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 387 states. [2022-02-20 23:37:06,346 INFO L87 Difference]: Start difference. First operand has 258 states, 137 states have (on average 1.948905109489051) internal successors, (267), 255 states have internal predecessors, (267), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 387 states. [2022-02-20 23:37:06,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:06,358 INFO L93 Difference]: Finished difference Result 387 states and 431 transitions. [2022-02-20 23:37:06,358 INFO L276 IsEmpty]: Start isEmpty. Operand 387 states and 431 transitions. [2022-02-20 23:37:06,359 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:06,359 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:06,359 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:06,359 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:06,359 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 137 states have (on average 1.948905109489051) internal successors, (267), 255 states have internal predecessors, (267), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:06,365 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 284 transitions. [2022-02-20 23:37:06,365 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 284 transitions. Word has length 5 [2022-02-20 23:37:06,365 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:06,365 INFO L470 AbstractCegarLoop]: Abstraction has 258 states and 284 transitions. [2022-02-20 23:37:06,365 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:06,365 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 284 transitions. [2022-02-20 23:37:06,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:37:06,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:06,365 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:37:06,376 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:06,571 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:06,572 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:06,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:06,573 INFO L85 PathProgramCache]: Analyzing trace with hash 56374664, now seen corresponding path program 1 times [2022-02-20 23:37:06,575 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:06,575 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [711040415] [2022-02-20 23:37:06,575 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:06,575 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:06,575 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:06,577 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:06,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 23:37:06,611 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:06,612 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:37:06,615 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:06,616 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:06,663 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:37:06,670 INFO L290 TraceCheckUtils]: 0: Hoare triple {2742#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {2742#true} is VALID [2022-02-20 23:37:06,671 INFO L290 TraceCheckUtils]: 1: Hoare triple {2742#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {2742#true} is VALID [2022-02-20 23:37:06,672 INFO L290 TraceCheckUtils]: 2: Hoare triple {2742#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {2753#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:06,672 INFO L290 TraceCheckUtils]: 3: Hoare triple {2753#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) (_ bv1 1))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {2753#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:06,673 INFO L290 TraceCheckUtils]: 4: Hoare triple {2753#(= (select |#valid| |ULTIMATE.start_main_~node~1#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~node~1#1.base]); {2743#false} is VALID [2022-02-20 23:37:06,673 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-20 23:37:06,673 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:06,673 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:06,674 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [711040415] [2022-02-20 23:37:06,676 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [711040415] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:06,677 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:06,677 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:06,677 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1260916087] [2022-02-20 23:37:06,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:06,677 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:06,677 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:06,677 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:06,681 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-20 23:37:06,681 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:06,681 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:06,682 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:06,684 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:06,684 INFO L87 Difference]: Start difference. First operand 258 states and 284 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:07,777 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:07,777 INFO L93 Difference]: Finished difference Result 436 states and 486 transitions. [2022-02-20 23:37:07,777 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:07,778 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:07,778 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:07,778 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:07,782 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-02-20 23:37:07,782 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 488 transitions. [2022-02-20 23:37:07,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 488 transitions. [2022-02-20 23:37:08,156 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 488 edges. 488 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:08,164 INFO L225 Difference]: With dead ends: 436 [2022-02-20 23:37:08,164 INFO L226 Difference]: Without dead ends: 436 [2022-02-20 23:37:08,164 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 23:37:08,165 INFO L933 BasicCegarLoop]: 401 mSDtfsCounter, 197 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 565 SdHoareTripleChecker+Invalid, 205 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:08,165 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 565 Invalid, 205 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:37:08,166 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 436 states. [2022-02-20 23:37:08,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 436 to 256. [2022-02-20 23:37:08,171 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:08,172 INFO L82 GeneralOperation]: Start isEquivalent. First operand 436 states. Second operand has 256 states, 137 states have (on average 1.9343065693430657) internal successors, (265), 253 states have internal predecessors, (265), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:08,172 INFO L74 IsIncluded]: Start isIncluded. First operand 436 states. Second operand has 256 states, 137 states have (on average 1.9343065693430657) internal successors, (265), 253 states have internal predecessors, (265), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:08,173 INFO L87 Difference]: Start difference. First operand 436 states. Second operand has 256 states, 137 states have (on average 1.9343065693430657) internal successors, (265), 253 states have internal predecessors, (265), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:08,187 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:08,187 INFO L93 Difference]: Finished difference Result 436 states and 486 transitions. [2022-02-20 23:37:08,187 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 486 transitions. [2022-02-20 23:37:08,188 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:08,188 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:08,189 INFO L74 IsIncluded]: Start isIncluded. First operand has 256 states, 137 states have (on average 1.9343065693430657) internal successors, (265), 253 states have internal predecessors, (265), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 436 states. [2022-02-20 23:37:08,189 INFO L87 Difference]: Start difference. First operand has 256 states, 137 states have (on average 1.9343065693430657) internal successors, (265), 253 states have internal predecessors, (265), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 436 states. [2022-02-20 23:37:08,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:08,200 INFO L93 Difference]: Finished difference Result 436 states and 486 transitions. [2022-02-20 23:37:08,200 INFO L276 IsEmpty]: Start isEmpty. Operand 436 states and 486 transitions. [2022-02-20 23:37:08,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:08,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:08,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:08,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:08,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 256 states, 137 states have (on average 1.9343065693430657) internal successors, (265), 253 states have internal predecessors, (265), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:08,207 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 256 states to 256 states and 282 transitions. [2022-02-20 23:37:08,207 INFO L78 Accepts]: Start accepts. Automaton has 256 states and 282 transitions. Word has length 5 [2022-02-20 23:37:08,207 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:08,207 INFO L470 AbstractCegarLoop]: Abstraction has 256 states and 282 transitions. [2022-02-20 23:37:08,207 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:08,208 INFO L276 IsEmpty]: Start isEmpty. Operand 256 states and 282 transitions. [2022-02-20 23:37:08,208 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:37:08,208 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:08,208 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:37:08,216 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:08,416 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:08,418 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:08,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:08,419 INFO L85 PathProgramCache]: Analyzing trace with hash 56374665, now seen corresponding path program 1 times [2022-02-20 23:37:08,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:08,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [32221860] [2022-02-20 23:37:08,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:08,419 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:08,419 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:08,420 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:08,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 23:37:08,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:08,457 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:37:08,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:08,465 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:08,477 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:37:08,492 INFO L290 TraceCheckUtils]: 0: Hoare triple {4323#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {4323#true} is VALID [2022-02-20 23:37:08,492 INFO L290 TraceCheckUtils]: 1: Hoare triple {4323#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {4323#true} is VALID [2022-02-20 23:37:08,493 INFO L290 TraceCheckUtils]: 2: Hoare triple {4323#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {4334#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (= |ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:37:08,494 INFO L290 TraceCheckUtils]: 3: Hoare triple {4334#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (= |ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {4334#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (= |ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:37:08,494 INFO L290 TraceCheckUtils]: 4: Hoare triple {4334#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~node~1#1.base|)) (= |ULTIMATE.start_main_~node~1#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~node~1#1.offset), #length[main_~node~1#1.base]) && ~bvule32(main_~node~1#1.offset, ~bvadd32(4bv32, main_~node~1#1.offset))) && ~bvule32(0bv32, main_~node~1#1.offset)); {4324#false} is VALID [2022-02-20 23:37:08,494 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-20 23:37:08,494 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:08,494 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:08,494 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [32221860] [2022-02-20 23:37:08,495 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [32221860] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:08,495 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:08,495 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:08,495 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1347707693] [2022-02-20 23:37:08,495 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:08,495 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:08,495 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:08,495 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:08,502 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-20 23:37:08,502 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:08,502 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:08,503 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:08,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:08,503 INFO L87 Difference]: Start difference. First operand 256 states and 282 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:09,661 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:09,662 INFO L93 Difference]: Finished difference Result 397 states and 441 transitions. [2022-02-20 23:37:09,662 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:09,662 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:09,662 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:09,662 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:09,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 23:37:09,666 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:09,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 443 transitions. [2022-02-20 23:37:09,670 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 443 transitions. [2022-02-20 23:37:10,013 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 443 edges. 443 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:10,019 INFO L225 Difference]: With dead ends: 397 [2022-02-20 23:37:10,019 INFO L226 Difference]: Without dead ends: 397 [2022-02-20 23:37:10,019 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 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-20 23:37:10,020 INFO L933 BasicCegarLoop]: 384 mSDtfsCounter, 160 mSDsluCounter, 172 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 160 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:10,020 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [160 Valid, 556 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:37:10,021 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-02-20 23:37:10,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 254. [2022-02-20 23:37:10,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:10,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 254 states, 137 states have (on average 1.9197080291970803) internal successors, (263), 251 states have internal predecessors, (263), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:10,026 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 254 states, 137 states have (on average 1.9197080291970803) internal successors, (263), 251 states have internal predecessors, (263), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:10,026 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 254 states, 137 states have (on average 1.9197080291970803) internal successors, (263), 251 states have internal predecessors, (263), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:10,035 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:10,035 INFO L93 Difference]: Finished difference Result 397 states and 441 transitions. [2022-02-20 23:37:10,035 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 441 transitions. [2022-02-20 23:37:10,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:10,036 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:10,036 INFO L74 IsIncluded]: Start isIncluded. First operand has 254 states, 137 states have (on average 1.9197080291970803) internal successors, (263), 251 states have internal predecessors, (263), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 397 states. [2022-02-20 23:37:10,036 INFO L87 Difference]: Start difference. First operand has 254 states, 137 states have (on average 1.9197080291970803) internal successors, (263), 251 states have internal predecessors, (263), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 397 states. [2022-02-20 23:37:10,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:10,044 INFO L93 Difference]: Finished difference Result 397 states and 441 transitions. [2022-02-20 23:37:10,044 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 441 transitions. [2022-02-20 23:37:10,045 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:10,045 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:10,045 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:10,045 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:10,045 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 254 states, 137 states have (on average 1.9197080291970803) internal successors, (263), 251 states have internal predecessors, (263), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:10,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 254 states to 254 states and 280 transitions. [2022-02-20 23:37:10,050 INFO L78 Accepts]: Start accepts. Automaton has 254 states and 280 transitions. Word has length 5 [2022-02-20 23:37:10,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:10,052 INFO L470 AbstractCegarLoop]: Abstraction has 254 states and 280 transitions. [2022-02-20 23:37:10,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 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-20 23:37:10,052 INFO L276 IsEmpty]: Start isEmpty. Operand 254 states and 280 transitions. [2022-02-20 23:37:10,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:37:10,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:10,053 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:10,067 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:10,261 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:10,261 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:10,261 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:10,262 INFO L85 PathProgramCache]: Analyzing trace with hash -1659458169, now seen corresponding path program 1 times [2022-02-20 23:37:10,262 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:10,262 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1951393539] [2022-02-20 23:37:10,262 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:10,262 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:10,262 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:10,263 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:10,264 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 23:37:10,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:10,298 INFO L263 TraceCheckSpWp]: Trace formula consists of 28 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:37:10,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:10,302 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:10,338 INFO L290 TraceCheckUtils]: 0: Hoare triple {5785#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {5785#true} is VALID [2022-02-20 23:37:10,338 INFO L290 TraceCheckUtils]: 1: Hoare triple {5785#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {5793#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:10,339 INFO L290 TraceCheckUtils]: 2: Hoare triple {5793#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {5793#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:10,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {5793#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {5786#false} is VALID [2022-02-20 23:37:10,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {5786#false} assume inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32; {5786#false} is VALID [2022-02-20 23:37:10,339 INFO L272 TraceCheckUtils]: 5: Hoare triple {5786#false} call fail(); {5786#false} is VALID [2022-02-20 23:37:10,339 INFO L290 TraceCheckUtils]: 6: Hoare triple {5786#false} assume !false; {5786#false} is VALID [2022-02-20 23:37:10,340 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-20 23:37:10,340 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:10,340 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:10,340 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1951393539] [2022-02-20 23:37:10,340 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1951393539] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:10,340 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:10,340 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:37:10,340 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1991598776] [2022-02-20 23:37:10,340 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:10,341 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:37:10,341 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:10,341 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:10,345 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:10,345 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:10,345 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:10,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:10,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:10,346 INFO L87 Difference]: Start difference. First operand 254 states and 280 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:10,887 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:10,887 INFO L93 Difference]: Finished difference Result 268 states and 292 transitions. [2022-02-20 23:37:10,887 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:10,887 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 23:37:10,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:10,887 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:10,889 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2022-02-20 23:37:10,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:10,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 293 transitions. [2022-02-20 23:37:10,891 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 293 transitions. [2022-02-20 23:37:11,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 293 edges. 293 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:11,103 INFO L225 Difference]: With dead ends: 268 [2022-02-20 23:37:11,103 INFO L226 Difference]: Without dead ends: 267 [2022-02-20 23:37:11,103 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 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-20 23:37:11,104 INFO L933 BasicCegarLoop]: 276 mSDtfsCounter, 13 mSDsluCounter, 257 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:11,104 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [13 Valid, 533 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:37:11,105 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2022-02-20 23:37:11,107 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 253. [2022-02-20 23:37:11,107 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:11,108 INFO L82 GeneralOperation]: Start isEquivalent. First operand 267 states. Second operand has 253 states, 136 states have (on average 1.9191176470588236) internal successors, (261), 250 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:11,108 INFO L74 IsIncluded]: Start isIncluded. First operand 267 states. Second operand has 253 states, 136 states have (on average 1.9191176470588236) internal successors, (261), 250 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:11,108 INFO L87 Difference]: Start difference. First operand 267 states. Second operand has 253 states, 136 states have (on average 1.9191176470588236) internal successors, (261), 250 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:11,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:11,112 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2022-02-20 23:37:11,112 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 291 transitions. [2022-02-20 23:37:11,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:11,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:11,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 253 states, 136 states have (on average 1.9191176470588236) internal successors, (261), 250 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 267 states. [2022-02-20 23:37:11,113 INFO L87 Difference]: Start difference. First operand has 253 states, 136 states have (on average 1.9191176470588236) internal successors, (261), 250 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 267 states. [2022-02-20 23:37:11,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:11,117 INFO L93 Difference]: Finished difference Result 267 states and 291 transitions. [2022-02-20 23:37:11,117 INFO L276 IsEmpty]: Start isEmpty. Operand 267 states and 291 transitions. [2022-02-20 23:37:11,118 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:11,118 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:11,118 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:11,118 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:11,118 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 253 states, 136 states have (on average 1.9191176470588236) internal successors, (261), 250 states have internal predecessors, (261), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:11,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 278 transitions. [2022-02-20 23:37:11,122 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 278 transitions. Word has length 7 [2022-02-20 23:37:11,122 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:11,122 INFO L470 AbstractCegarLoop]: Abstraction has 253 states and 278 transitions. [2022-02-20 23:37:11,122 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:11,122 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 278 transitions. [2022-02-20 23:37:11,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:37:11,122 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:11,122 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:11,128 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 23:37:11,328 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:11,328 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:11,328 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:11,328 INFO L85 PathProgramCache]: Analyzing trace with hash -406871347, now seen corresponding path program 1 times [2022-02-20 23:37:11,328 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:11,329 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [438508093] [2022-02-20 23:37:11,329 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:11,329 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:11,329 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:11,330 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:11,331 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 23:37:11,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:11,375 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:37:11,381 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:11,382 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:11,399 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:37:11,406 INFO L290 TraceCheckUtils]: 0: Hoare triple {6863#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {6863#true} is VALID [2022-02-20 23:37:11,406 INFO L290 TraceCheckUtils]: 1: Hoare triple {6863#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {6863#true} is VALID [2022-02-20 23:37:11,406 INFO L290 TraceCheckUtils]: 2: Hoare triple {6863#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {6863#true} is VALID [2022-02-20 23:37:11,406 INFO L290 TraceCheckUtils]: 3: Hoare triple {6863#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {6863#true} is VALID [2022-02-20 23:37:11,406 INFO L290 TraceCheckUtils]: 4: Hoare triple {6863#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {6863#true} is VALID [2022-02-20 23:37:11,407 INFO L290 TraceCheckUtils]: 5: Hoare triple {6863#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {6863#true} is VALID [2022-02-20 23:37:11,407 INFO L290 TraceCheckUtils]: 6: Hoare triple {6863#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {6886#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:11,408 INFO L290 TraceCheckUtils]: 7: Hoare triple {6886#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {6886#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:11,408 INFO L290 TraceCheckUtils]: 8: Hoare triple {6886#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_~item~0#1.base]); {6864#false} is VALID [2022-02-20 23:37:11,408 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-20 23:37:11,408 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:11,408 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:11,408 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [438508093] [2022-02-20 23:37:11,408 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [438508093] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:11,410 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:11,410 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:11,410 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1752939200] [2022-02-20 23:37:11,411 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:11,411 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:37:11,411 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:11,411 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:11,418 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:11,418 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:11,418 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:11,419 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:11,419 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:11,419 INFO L87 Difference]: Start difference. First operand 253 states and 278 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:12,186 INFO L93 Difference]: Finished difference Result 375 states and 414 transitions. [2022-02-20 23:37:12,186 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:12,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:37:12,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:12,187 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,189 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 23:37:12,189 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,191 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 416 transitions. [2022-02-20 23:37:12,192 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 416 transitions. [2022-02-20 23:37:12,535 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 416 edges. 416 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:12,541 INFO L225 Difference]: With dead ends: 375 [2022-02-20 23:37:12,541 INFO L226 Difference]: Without dead ends: 375 [2022-02-20 23:37:12,542 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-20 23:37:12,543 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 193 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 180 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 195 SdHoareTripleChecker+Valid, 306 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 180 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:12,543 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [195 Valid, 306 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 180 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:12,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 375 states. [2022-02-20 23:37:12,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 375 to 251. [2022-02-20 23:37:12,548 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:12,548 INFO L82 GeneralOperation]: Start isEquivalent. First operand 375 states. Second operand has 251 states, 136 states have (on average 1.9044117647058822) internal successors, (259), 248 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:12,549 INFO L74 IsIncluded]: Start isIncluded. First operand 375 states. Second operand has 251 states, 136 states have (on average 1.9044117647058822) internal successors, (259), 248 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:12,549 INFO L87 Difference]: Start difference. First operand 375 states. Second operand has 251 states, 136 states have (on average 1.9044117647058822) internal successors, (259), 248 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:12,559 INFO L93 Difference]: Finished difference Result 375 states and 414 transitions. [2022-02-20 23:37:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 414 transitions. [2022-02-20 23:37:12,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:12,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:12,561 INFO L74 IsIncluded]: Start isIncluded. First operand has 251 states, 136 states have (on average 1.9044117647058822) internal successors, (259), 248 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-02-20 23:37:12,561 INFO L87 Difference]: Start difference. First operand has 251 states, 136 states have (on average 1.9044117647058822) internal successors, (259), 248 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 375 states. [2022-02-20 23:37:12,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:12,569 INFO L93 Difference]: Finished difference Result 375 states and 414 transitions. [2022-02-20 23:37:12,569 INFO L276 IsEmpty]: Start isEmpty. Operand 375 states and 414 transitions. [2022-02-20 23:37:12,570 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:12,570 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:12,570 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:12,570 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:12,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 251 states, 136 states have (on average 1.9044117647058822) internal successors, (259), 248 states have internal predecessors, (259), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:12,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 251 states to 251 states and 276 transitions. [2022-02-20 23:37:12,574 INFO L78 Accepts]: Start accepts. Automaton has 251 states and 276 transitions. Word has length 9 [2022-02-20 23:37:12,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:12,574 INFO L470 AbstractCegarLoop]: Abstraction has 251 states and 276 transitions. [2022-02-20 23:37:12,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,575 INFO L276 IsEmpty]: Start isEmpty. Operand 251 states and 276 transitions. [2022-02-20 23:37:12,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2022-02-20 23:37:12,575 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:12,575 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:12,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Ended with exit code 0 [2022-02-20 23:37:12,781 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:12,781 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:12,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:12,782 INFO L85 PathProgramCache]: Analyzing trace with hash -406871346, now seen corresponding path program 1 times [2022-02-20 23:37:12,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:12,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1910510019] [2022-02-20 23:37:12,782 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:12,782 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:12,782 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:12,783 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:12,784 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 23:37:12,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:12,840 INFO L263 TraceCheckSpWp]: Trace formula consists of 62 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:37:12,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:12,844 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:12,875 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:37:12,891 INFO L290 TraceCheckUtils]: 0: Hoare triple {8268#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {8268#true} is VALID [2022-02-20 23:37:12,891 INFO L290 TraceCheckUtils]: 1: Hoare triple {8268#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {8268#true} is VALID [2022-02-20 23:37:12,891 INFO L290 TraceCheckUtils]: 2: Hoare triple {8268#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {8268#true} is VALID [2022-02-20 23:37:12,891 INFO L290 TraceCheckUtils]: 3: Hoare triple {8268#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {8268#true} is VALID [2022-02-20 23:37:12,892 INFO L290 TraceCheckUtils]: 4: Hoare triple {8268#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {8268#true} is VALID [2022-02-20 23:37:12,892 INFO L290 TraceCheckUtils]: 5: Hoare triple {8268#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {8268#true} is VALID [2022-02-20 23:37:12,893 INFO L290 TraceCheckUtils]: 6: Hoare triple {8268#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {8291#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:12,893 INFO L290 TraceCheckUtils]: 7: Hoare triple {8291#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {8291#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:12,893 INFO L290 TraceCheckUtils]: 8: Hoare triple {8291#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !((~bvule32(~bvadd32(4bv32, main_~item~0#1.offset), #length[main_~item~0#1.base]) && ~bvule32(main_~item~0#1.offset, ~bvadd32(4bv32, main_~item~0#1.offset))) && ~bvule32(0bv32, main_~item~0#1.offset)); {8269#false} is VALID [2022-02-20 23:37:12,894 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-20 23:37:12,894 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:12,894 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:12,894 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1910510019] [2022-02-20 23:37:12,894 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1910510019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:12,894 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:12,894 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:37:12,894 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1841105729] [2022-02-20 23:37:12,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:12,894 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:37:12,894 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:12,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:12,903 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 9 edges. 9 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:12,903 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:37:12,903 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:12,904 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:37:12,904 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:37:12,904 INFO L87 Difference]: Start difference. First operand 251 states and 276 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:13,748 INFO L93 Difference]: Finished difference Result 336 states and 369 transitions. [2022-02-20 23:37:13,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:37:13,749 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 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 9 [2022-02-20 23:37:13,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:13,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-02-20 23:37:13,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:13,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 371 transitions. [2022-02-20 23:37:13,753 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 371 transitions. [2022-02-20 23:37:14,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 371 edges. 371 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:14,058 INFO L225 Difference]: With dead ends: 336 [2022-02-20 23:37:14,058 INFO L226 Difference]: Without dead ends: 336 [2022-02-20 23:37:14,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 7 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-20 23:37:14,059 INFO L933 BasicCegarLoop]: 223 mSDtfsCounter, 156 mSDsluCounter, 117 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 340 SdHoareTripleChecker+Invalid, 144 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:14,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [156 Valid, 340 Invalid, 144 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:14,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 336 states. [2022-02-20 23:37:14,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 336 to 249. [2022-02-20 23:37:14,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:14,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 336 states. Second operand has 249 states, 136 states have (on average 1.8897058823529411) internal successors, (257), 246 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:14,064 INFO L74 IsIncluded]: Start isIncluded. First operand 336 states. Second operand has 249 states, 136 states have (on average 1.8897058823529411) internal successors, (257), 246 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:14,065 INFO L87 Difference]: Start difference. First operand 336 states. Second operand has 249 states, 136 states have (on average 1.8897058823529411) internal successors, (257), 246 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:14,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:14,069 INFO L93 Difference]: Finished difference Result 336 states and 369 transitions. [2022-02-20 23:37:14,070 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 369 transitions. [2022-02-20 23:37:14,071 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:14,071 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:14,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 136 states have (on average 1.8897058823529411) internal successors, (257), 246 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 336 states. [2022-02-20 23:37:14,072 INFO L87 Difference]: Start difference. First operand has 249 states, 136 states have (on average 1.8897058823529411) internal successors, (257), 246 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 336 states. [2022-02-20 23:37:14,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:14,077 INFO L93 Difference]: Finished difference Result 336 states and 369 transitions. [2022-02-20 23:37:14,077 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 369 transitions. [2022-02-20 23:37:14,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:14,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:14,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:14,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:14,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 136 states have (on average 1.8897058823529411) internal successors, (257), 246 states have internal predecessors, (257), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:14,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 274 transitions. [2022-02-20 23:37:14,081 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 274 transitions. Word has length 9 [2022-02-20 23:37:14,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:14,082 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 274 transitions. [2022-02-20 23:37:14,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:14,082 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 274 transitions. [2022-02-20 23:37:14,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 23:37:14,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:14,082 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:14,091 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:14,289 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:14,289 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr89ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:14,290 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:14,290 INFO L85 PathProgramCache]: Analyzing trace with hash -395796626, now seen corresponding path program 1 times [2022-02-20 23:37:14,290 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:14,290 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [173914721] [2022-02-20 23:37:14,290 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:14,290 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:14,290 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:14,291 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:14,291 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 23:37:14,355 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:14,357 INFO L263 TraceCheckSpWp]: Trace formula consists of 94 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:37:14,363 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:14,363 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:14,398 INFO L290 TraceCheckUtils]: 0: Hoare triple {9554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {9554#true} is VALID [2022-02-20 23:37:14,398 INFO L290 TraceCheckUtils]: 1: Hoare triple {9554#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {9554#true} is VALID [2022-02-20 23:37:14,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {9554#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {9554#true} is VALID [2022-02-20 23:37:14,399 INFO L290 TraceCheckUtils]: 3: Hoare triple {9554#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {9554#true} is VALID [2022-02-20 23:37:14,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {9554#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {9554#true} is VALID [2022-02-20 23:37:14,402 INFO L290 TraceCheckUtils]: 5: Hoare triple {9554#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {9554#true} is VALID [2022-02-20 23:37:14,402 INFO L290 TraceCheckUtils]: 6: Hoare triple {9554#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:14,403 INFO L290 TraceCheckUtils]: 7: Hoare triple {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:14,403 INFO L290 TraceCheckUtils]: 8: Hoare triple {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L646-2 {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:14,404 INFO L290 TraceCheckUtils]: 9: Hoare triple {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L648 {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:14,404 INFO L290 TraceCheckUtils]: 10: Hoare triple {9577#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {9590#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:14,404 INFO L290 TraceCheckUtils]: 11: Hoare triple {9590#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {9590#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:14,405 INFO L290 TraceCheckUtils]: 12: Hoare triple {9590#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32;main_#res#1 := 0bv32; {9555#false} is VALID [2022-02-20 23:37:14,406 INFO L290 TraceCheckUtils]: 13: Hoare triple {9555#false} assume !(#valid == main_old_#valid#1); {9555#false} is VALID [2022-02-20 23:37:14,407 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:14,407 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:14,407 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:14,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [173914721] [2022-02-20 23:37:14,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [173914721] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:14,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:14,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:14,407 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [147720935] [2022-02-20 23:37:14,407 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:14,407 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:37:14,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:14,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:14,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:14,421 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:37:14,421 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:14,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:37:14,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:37:14,422 INFO L87 Difference]: Start difference. First operand 249 states and 274 transitions. Second operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:15,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:15,220 INFO L93 Difference]: Finished difference Result 403 states and 443 transitions. [2022-02-20 23:37:15,220 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:37:15,220 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 23:37:15,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:15,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:15,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2022-02-20 23:37:15,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:15,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 444 transitions. [2022-02-20 23:37:15,234 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 444 transitions. [2022-02-20 23:37:15,607 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 444 edges. 444 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:15,613 INFO L225 Difference]: With dead ends: 403 [2022-02-20 23:37:15,613 INFO L226 Difference]: Without dead ends: 403 [2022-02-20 23:37:15,613 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:15,613 INFO L933 BasicCegarLoop]: 262 mSDtfsCounter, 599 mSDsluCounter, 238 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 601 SdHoareTripleChecker+Valid, 500 SdHoareTripleChecker+Invalid, 43 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:15,613 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [601 Valid, 500 Invalid, 43 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:37:15,614 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 403 states. [2022-02-20 23:37:15,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 403 to 249. [2022-02-20 23:37:15,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:15,617 INFO L82 GeneralOperation]: Start isEquivalent. First operand 403 states. Second operand has 249 states, 136 states have (on average 1.8823529411764706) internal successors, (256), 246 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:15,617 INFO L74 IsIncluded]: Start isIncluded. First operand 403 states. Second operand has 249 states, 136 states have (on average 1.8823529411764706) internal successors, (256), 246 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:15,618 INFO L87 Difference]: Start difference. First operand 403 states. Second operand has 249 states, 136 states have (on average 1.8823529411764706) internal successors, (256), 246 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:15,625 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:15,625 INFO L93 Difference]: Finished difference Result 403 states and 443 transitions. [2022-02-20 23:37:15,625 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 443 transitions. [2022-02-20 23:37:15,626 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:15,626 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:15,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 249 states, 136 states have (on average 1.8823529411764706) internal successors, (256), 246 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 403 states. [2022-02-20 23:37:15,628 INFO L87 Difference]: Start difference. First operand has 249 states, 136 states have (on average 1.8823529411764706) internal successors, (256), 246 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 403 states. [2022-02-20 23:37:15,636 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:15,636 INFO L93 Difference]: Finished difference Result 403 states and 443 transitions. [2022-02-20 23:37:15,636 INFO L276 IsEmpty]: Start isEmpty. Operand 403 states and 443 transitions. [2022-02-20 23:37:15,637 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:15,637 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:15,637 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:15,637 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:15,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 249 states, 136 states have (on average 1.8823529411764706) internal successors, (256), 246 states have internal predecessors, (256), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:15,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 249 states to 249 states and 273 transitions. [2022-02-20 23:37:15,641 INFO L78 Accepts]: Start accepts. Automaton has 249 states and 273 transitions. Word has length 14 [2022-02-20 23:37:15,641 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:15,641 INFO L470 AbstractCegarLoop]: Abstraction has 249 states and 273 transitions. [2022-02-20 23:37:15,641 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.5) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:15,641 INFO L276 IsEmpty]: Start isEmpty. Operand 249 states and 273 transitions. [2022-02-20 23:37:15,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:15,642 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:15,642 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:15,650 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Ended with exit code 0 [2022-02-20 23:37:15,848 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:15,850 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:15,852 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:15,852 INFO L85 PathProgramCache]: Analyzing trace with hash 1891163323, now seen corresponding path program 1 times [2022-02-20 23:37:15,852 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:15,852 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [100188577] [2022-02-20 23:37:15,852 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:15,852 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:15,852 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:15,853 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:15,854 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 23:37:15,923 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:15,925 INFO L263 TraceCheckSpWp]: Trace formula consists of 101 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 23:37:15,930 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:15,931 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:15,981 INFO L290 TraceCheckUtils]: 0: Hoare triple {11060#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {11060#true} is VALID [2022-02-20 23:37:15,981 INFO L290 TraceCheckUtils]: 1: Hoare triple {11060#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {11060#true} is VALID [2022-02-20 23:37:15,981 INFO L290 TraceCheckUtils]: 2: Hoare triple {11060#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {11060#true} is VALID [2022-02-20 23:37:15,981 INFO L290 TraceCheckUtils]: 3: Hoare triple {11060#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {11060#true} is VALID [2022-02-20 23:37:15,982 INFO L290 TraceCheckUtils]: 4: Hoare triple {11060#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {11060#true} is VALID [2022-02-20 23:37:15,982 INFO L290 TraceCheckUtils]: 5: Hoare triple {11060#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {11060#true} is VALID [2022-02-20 23:37:15,982 INFO L290 TraceCheckUtils]: 6: Hoare triple {11060#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:15,982 INFO L290 TraceCheckUtils]: 7: Hoare triple {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:15,983 INFO L290 TraceCheckUtils]: 8: Hoare triple {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L646-2 {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:15,983 INFO L290 TraceCheckUtils]: 9: Hoare triple {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L648 {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:15,984 INFO L290 TraceCheckUtils]: 10: Hoare triple {11083#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {11096#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:15,985 INFO L290 TraceCheckUtils]: 11: Hoare triple {11096#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {11096#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:15,985 INFO L290 TraceCheckUtils]: 12: Hoare triple {11096#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {11103#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:15,985 INFO L290 TraceCheckUtils]: 13: Hoare triple {11103#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| (_ bv0 32)))} assume inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32; {11061#false} is VALID [2022-02-20 23:37:15,985 INFO L272 TraceCheckUtils]: 14: Hoare triple {11061#false} call fail(); {11061#false} is VALID [2022-02-20 23:37:15,986 INFO L290 TraceCheckUtils]: 15: Hoare triple {11061#false} assume !false; {11061#false} is VALID [2022-02-20 23:37:15,986 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:15,986 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:15,986 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:15,986 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [100188577] [2022-02-20 23:37:15,986 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [100188577] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:15,988 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:15,988 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:37:15,988 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [207530733] [2022-02-20 23:37:15,988 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:15,989 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:15,989 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:15,989 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:16,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:16,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:16,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:16,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:16,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:16,002 INFO L87 Difference]: Start difference. First operand 249 states and 273 transitions. Second operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,505 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:17,505 INFO L93 Difference]: Finished difference Result 750 states and 827 transitions. [2022-02-20 23:37:17,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:37:17,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:17,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:17,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,512 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2022-02-20 23:37:17,512 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:17,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 830 transitions. [2022-02-20 23:37:17,518 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 830 transitions. [2022-02-20 23:37:18,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 830 edges. 830 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:18,223 INFO L225 Difference]: With dead ends: 750 [2022-02-20 23:37:18,223 INFO L226 Difference]: Without dead ends: 750 [2022-02-20 23:37:18,224 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:37:18,224 INFO L933 BasicCegarLoop]: 237 mSDtfsCounter, 1535 mSDsluCounter, 467 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1537 SdHoareTripleChecker+Valid, 704 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:18,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [1537 Valid, 704 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:37:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 750 states. [2022-02-20 23:37:18,228 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 750 to 252. [2022-02-20 23:37:18,229 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:18,229 INFO L82 GeneralOperation]: Start isEquivalent. First operand 750 states. Second operand has 252 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 249 states have internal predecessors, (262), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:18,229 INFO L74 IsIncluded]: Start isIncluded. First operand 750 states. Second operand has 252 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 249 states have internal predecessors, (262), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:18,230 INFO L87 Difference]: Start difference. First operand 750 states. Second operand has 252 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 249 states have internal predecessors, (262), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:18,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:18,250 INFO L93 Difference]: Finished difference Result 750 states and 827 transitions. [2022-02-20 23:37:18,250 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 827 transitions. [2022-02-20 23:37:18,251 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:18,251 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:18,252 INFO L74 IsIncluded]: Start isIncluded. First operand has 252 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 249 states have internal predecessors, (262), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 750 states. [2022-02-20 23:37:18,252 INFO L87 Difference]: Start difference. First operand has 252 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 249 states have internal predecessors, (262), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 750 states. [2022-02-20 23:37:18,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:18,271 INFO L93 Difference]: Finished difference Result 750 states and 827 transitions. [2022-02-20 23:37:18,272 INFO L276 IsEmpty]: Start isEmpty. Operand 750 states and 827 transitions. [2022-02-20 23:37:18,273 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:18,273 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:18,273 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:18,273 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:18,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 252 states, 140 states have (on average 1.8714285714285714) internal successors, (262), 249 states have internal predecessors, (262), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:18,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 252 states to 252 states and 278 transitions. [2022-02-20 23:37:18,277 INFO L78 Accepts]: Start accepts. Automaton has 252 states and 278 transitions. Word has length 16 [2022-02-20 23:37:18,277 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:18,277 INFO L470 AbstractCegarLoop]: Abstraction has 252 states and 278 transitions. [2022-02-20 23:37:18,277 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,278 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 278 transitions. [2022-02-20 23:37:18,278 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:18,278 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:18,278 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:18,299 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:18,484 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:18,485 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:18,485 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:18,485 INFO L85 PathProgramCache]: Analyzing trace with hash 1891152073, now seen corresponding path program 1 times [2022-02-20 23:37:18,486 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:18,486 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [833324052] [2022-02-20 23:37:18,486 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:18,486 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:18,486 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:18,487 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:18,491 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2022-02-20 23:37:18,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:18,556 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:37:18,561 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:18,562 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:18,579 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:37:18,664 INFO L290 TraceCheckUtils]: 0: Hoare triple {13621#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {13621#true} is VALID [2022-02-20 23:37:18,665 INFO L290 TraceCheckUtils]: 1: Hoare triple {13621#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {13621#true} is VALID [2022-02-20 23:37:18,665 INFO L290 TraceCheckUtils]: 2: Hoare triple {13621#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {13621#true} is VALID [2022-02-20 23:37:18,665 INFO L290 TraceCheckUtils]: 3: Hoare triple {13621#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {13621#true} is VALID [2022-02-20 23:37:18,665 INFO L290 TraceCheckUtils]: 4: Hoare triple {13621#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {13621#true} is VALID [2022-02-20 23:37:18,665 INFO L290 TraceCheckUtils]: 5: Hoare triple {13621#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {13621#true} is VALID [2022-02-20 23:37:18,666 INFO L290 TraceCheckUtils]: 6: Hoare triple {13621#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,667 INFO L290 TraceCheckUtils]: 7: Hoare triple {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,667 INFO L290 TraceCheckUtils]: 8: Hoare triple {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L646-2 {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,668 INFO L290 TraceCheckUtils]: 9: Hoare triple {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L648 {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,668 INFO L290 TraceCheckUtils]: 10: Hoare triple {13644#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_main_~item~0#1.base|) (_ bv8 32)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {13657#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:37:18,668 INFO L290 TraceCheckUtils]: 11: Hoare triple {13657#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {13657#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} is VALID [2022-02-20 23:37:18,669 INFO L290 TraceCheckUtils]: 12: Hoare triple {13657#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv8 32) (select |#length| |ULTIMATE.start_main_~data~0#1.base|)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {13664#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,669 INFO L290 TraceCheckUtils]: 13: Hoare triple {13664#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv8 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {13664#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,670 INFO L290 TraceCheckUtils]: 14: Hoare triple {13664#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv8 32)))} goto; {13664#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv8 32)))} is VALID [2022-02-20 23:37:18,670 INFO L290 TraceCheckUtils]: 15: Hoare triple {13664#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select |#length| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv8 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, inspect_before_~shape#1.offset)), #length[inspect_before_~shape#1.base]) && ~bvule32(~bvadd32(4bv32, inspect_before_~shape#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, inspect_before_~shape#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, inspect_before_~shape#1.offset))); {13622#false} is VALID [2022-02-20 23:37:18,670 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:18,670 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:18,670 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:18,671 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [833324052] [2022-02-20 23:37:18,671 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [833324052] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:18,671 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:18,671 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:18,671 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984091449] [2022-02-20 23:37:18,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:18,671 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:18,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:18,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:18,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:18,686 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:18,686 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:18,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:18,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:18,686 INFO L87 Difference]: Start difference. First operand 252 states and 278 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,965 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:20,966 INFO L93 Difference]: Finished difference Result 629 states and 691 transitions. [2022-02-20 23:37:20,966 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:37:20,966 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:20,966 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:20,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2022-02-20 23:37:20,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:20,974 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 705 transitions. [2022-02-20 23:37:20,975 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 705 transitions. [2022-02-20 23:37:21,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 705 edges. 705 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:21,643 INFO L225 Difference]: With dead ends: 629 [2022-02-20 23:37:21,643 INFO L226 Difference]: Without dead ends: 629 [2022-02-20 23:37:21,643 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:37:21,644 INFO L933 BasicCegarLoop]: 199 mSDtfsCounter, 947 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 947 SdHoareTripleChecker+Valid, 558 SdHoareTripleChecker+Invalid, 423 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:21,645 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [947 Valid, 558 Invalid, 423 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2022-02-20 23:37:21,645 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 629 states. [2022-02-20 23:37:21,649 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 629 to 297. [2022-02-20 23:37:21,649 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:21,649 INFO L82 GeneralOperation]: Start isEquivalent. First operand 629 states. Second operand has 297 states, 185 states have (on average 1.837837837837838) internal successors, (340), 294 states have internal predecessors, (340), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:21,650 INFO L74 IsIncluded]: Start isIncluded. First operand 629 states. Second operand has 297 states, 185 states have (on average 1.837837837837838) internal successors, (340), 294 states have internal predecessors, (340), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:21,650 INFO L87 Difference]: Start difference. First operand 629 states. Second operand has 297 states, 185 states have (on average 1.837837837837838) internal successors, (340), 294 states have internal predecessors, (340), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:21,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,663 INFO L93 Difference]: Finished difference Result 629 states and 691 transitions. [2022-02-20 23:37:21,663 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 691 transitions. [2022-02-20 23:37:21,664 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,664 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,665 INFO L74 IsIncluded]: Start isIncluded. First operand has 297 states, 185 states have (on average 1.837837837837838) internal successors, (340), 294 states have internal predecessors, (340), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 629 states. [2022-02-20 23:37:21,665 INFO L87 Difference]: Start difference. First operand has 297 states, 185 states have (on average 1.837837837837838) internal successors, (340), 294 states have internal predecessors, (340), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 629 states. [2022-02-20 23:37:21,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:21,679 INFO L93 Difference]: Finished difference Result 629 states and 691 transitions. [2022-02-20 23:37:21,679 INFO L276 IsEmpty]: Start isEmpty. Operand 629 states and 691 transitions. [2022-02-20 23:37:21,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:21,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:21,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:21,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:21,680 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 297 states, 185 states have (on average 1.837837837837838) internal successors, (340), 294 states have internal predecessors, (340), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:21,684 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 297 states to 297 states and 356 transitions. [2022-02-20 23:37:21,685 INFO L78 Accepts]: Start accepts. Automaton has 297 states and 356 transitions. Word has length 16 [2022-02-20 23:37:21,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:21,686 INFO L470 AbstractCegarLoop]: Abstraction has 297 states and 356 transitions. [2022-02-20 23:37:21,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:21,686 INFO L276 IsEmpty]: Start isEmpty. Operand 297 states and 356 transitions. [2022-02-20 23:37:21,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2022-02-20 23:37:21,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:21,687 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:37:21,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:21,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:21,894 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:21,894 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:21,894 INFO L85 PathProgramCache]: Analyzing trace with hash 1891152072, now seen corresponding path program 1 times [2022-02-20 23:37:21,894 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:21,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [594414053] [2022-02-20 23:37:21,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:21,895 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:21,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:21,895 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:21,896 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2022-02-20 23:37:21,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:21,956 INFO L263 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2022-02-20 23:37:21,965 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:21,966 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:21,982 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2022-02-20 23:37:22,024 INFO L290 TraceCheckUtils]: 0: Hoare triple {15864#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {15864#true} is VALID [2022-02-20 23:37:22,024 INFO L290 TraceCheckUtils]: 1: Hoare triple {15864#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {15864#true} is VALID [2022-02-20 23:37:22,024 INFO L290 TraceCheckUtils]: 2: Hoare triple {15864#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {15864#true} is VALID [2022-02-20 23:37:22,024 INFO L290 TraceCheckUtils]: 3: Hoare triple {15864#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {15864#true} is VALID [2022-02-20 23:37:22,024 INFO L290 TraceCheckUtils]: 4: Hoare triple {15864#true} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {15864#true} is VALID [2022-02-20 23:37:22,025 INFO L290 TraceCheckUtils]: 5: Hoare triple {15864#true} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {15864#true} is VALID [2022-02-20 23:37:22,025 INFO L290 TraceCheckUtils]: 6: Hoare triple {15864#true} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,026 INFO L290 TraceCheckUtils]: 7: Hoare triple {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,026 INFO L290 TraceCheckUtils]: 8: Hoare triple {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L646-2 {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,026 INFO L290 TraceCheckUtils]: 9: Hoare triple {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L648 {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,027 INFO L290 TraceCheckUtils]: 10: Hoare triple {15887#(= (select |#valid| |ULTIMATE.start_main_~item~0#1.base|) (_ bv1 1))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {15900#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,027 INFO L290 TraceCheckUtils]: 11: Hoare triple {15900#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {15900#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {15900#(= (select |#valid| |ULTIMATE.start_main_~data~0#1.base|) (_ bv1 1))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {15907#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {15907#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv1 1))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {15907#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,029 INFO L290 TraceCheckUtils]: 14: Hoare triple {15907#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv1 1))} goto; {15907#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:37:22,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {15907#(= (select |#valid| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[inspect_before_~shape#1.base]); {15865#false} is VALID [2022-02-20 23:37:22,029 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:22,029 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:37:22,029 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:22,030 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [594414053] [2022-02-20 23:37:22,030 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [594414053] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:37:22,030 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:37:22,030 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:37:22,030 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1831958988] [2022-02-20 23:37:22,030 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:37:22,030 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:22,031 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:22,031 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:22,044 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 16 edges. 16 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:22,044 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:37:22,044 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:22,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:37:22,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:37:22,045 INFO L87 Difference]: Start difference. First operand 297 states and 356 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:23,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:23,937 INFO L93 Difference]: Finished difference Result 480 states and 553 transitions. [2022-02-20 23:37:23,937 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:37:23,937 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2022-02-20 23:37:23,937 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:23,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:23,940 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 493 transitions. [2022-02-20 23:37:23,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:23,942 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 493 transitions. [2022-02-20 23:37:23,942 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 493 transitions. [2022-02-20 23:37:24,331 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:24,339 INFO L225 Difference]: With dead ends: 480 [2022-02-20 23:37:24,339 INFO L226 Difference]: Without dead ends: 480 [2022-02-20 23:37:24,340 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 19 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:37:24,340 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 636 mSDsluCounter, 356 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 638 SdHoareTripleChecker+Valid, 537 SdHoareTripleChecker+Invalid, 499 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:37:24,340 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [638 Valid, 537 Invalid, 499 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:37:24,341 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 480 states. [2022-02-20 23:37:24,344 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 480 to 288. [2022-02-20 23:37:24,344 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:37:24,351 INFO L82 GeneralOperation]: Start isEquivalent. First operand 480 states. Second operand has 288 states, 185 states have (on average 1.7351351351351352) internal successors, (321), 285 states have internal predecessors, (321), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:24,352 INFO L74 IsIncluded]: Start isIncluded. First operand 480 states. Second operand has 288 states, 185 states have (on average 1.7351351351351352) internal successors, (321), 285 states have internal predecessors, (321), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:24,352 INFO L87 Difference]: Start difference. First operand 480 states. Second operand has 288 states, 185 states have (on average 1.7351351351351352) internal successors, (321), 285 states have internal predecessors, (321), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:24,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:24,361 INFO L93 Difference]: Finished difference Result 480 states and 553 transitions. [2022-02-20 23:37:24,361 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 553 transitions. [2022-02-20 23:37:24,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:24,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:24,362 INFO L74 IsIncluded]: Start isIncluded. First operand has 288 states, 185 states have (on average 1.7351351351351352) internal successors, (321), 285 states have internal predecessors, (321), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 480 states. [2022-02-20 23:37:24,363 INFO L87 Difference]: Start difference. First operand has 288 states, 185 states have (on average 1.7351351351351352) internal successors, (321), 285 states have internal predecessors, (321), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 480 states. [2022-02-20 23:37:24,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:24,373 INFO L93 Difference]: Finished difference Result 480 states and 553 transitions. [2022-02-20 23:37:24,373 INFO L276 IsEmpty]: Start isEmpty. Operand 480 states and 553 transitions. [2022-02-20 23:37:24,374 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:37:24,374 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:37:24,374 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:37:24,374 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:37:24,375 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 288 states, 185 states have (on average 1.7351351351351352) internal successors, (321), 285 states have internal predecessors, (321), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:37:24,378 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 288 states to 288 states and 337 transitions. [2022-02-20 23:37:24,379 INFO L78 Accepts]: Start accepts. Automaton has 288 states and 337 transitions. Word has length 16 [2022-02-20 23:37:24,379 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:37:24,379 INFO L470 AbstractCegarLoop]: Abstraction has 288 states and 337 transitions. [2022-02-20 23:37:24,379 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:24,379 INFO L276 IsEmpty]: Start isEmpty. Operand 288 states and 337 transitions. [2022-02-20 23:37:24,379 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:37:24,380 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:37:24,380 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-20 23:37:24,390 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (12)] Forceful destruction successful, exit code 0 [2022-02-20 23:37:24,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:37:24,586 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting failErr0ASSERT_VIOLATIONMEMORY_LEAK === [failErr0ASSERT_VIOLATIONMEMORY_LEAK, merge_single_nodeErr0REQUIRES_VIOLATION, merge_single_nodeErr1REQUIRES_VIOLATION, merge_single_nodeErr2REQUIRES_VIOLATION (and 101 more)] === [2022-02-20 23:37:24,586 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:37:24,587 INFO L85 PathProgramCache]: Analyzing trace with hash 683905399, now seen corresponding path program 1 times [2022-02-20 23:37:24,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:37:24,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2092430424] [2022-02-20 23:37:24,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:37:24,587 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:37:24,587 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:37:24,588 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:37:24,588 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2022-02-20 23:37:24,665 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:24,670 INFO L263 TraceCheckSpWp]: Trace formula consists of 118 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:37:24,684 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:37:24,685 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:37:24,767 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:37:24,772 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2022-02-20 23:37:24,924 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:37:24,928 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 23:37:24,948 INFO L290 TraceCheckUtils]: 0: Hoare triple {17651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {17651#true} is VALID [2022-02-20 23:37:24,948 INFO L290 TraceCheckUtils]: 1: Hoare triple {17651#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,949 INFO L290 TraceCheckUtils]: 2: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,949 INFO L290 TraceCheckUtils]: 3: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,949 INFO L290 TraceCheckUtils]: 4: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,950 INFO L290 TraceCheckUtils]: 5: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,950 INFO L290 TraceCheckUtils]: 6: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {17675#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,951 INFO L290 TraceCheckUtils]: 7: Hoare triple {17675#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {17675#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,951 INFO L290 TraceCheckUtils]: 8: Hoare triple {17675#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L646-2 {17675#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:24,953 INFO L290 TraceCheckUtils]: 9: Hoare triple {17675#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L648 {17685#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,953 INFO L290 TraceCheckUtils]: 10: Hoare triple {17685#(and (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {17689#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,954 INFO L290 TraceCheckUtils]: 11: Hoare triple {17689#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {17689#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {17689#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,955 INFO L290 TraceCheckUtils]: 13: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} goto; {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,957 INFO L290 TraceCheckUtils]: 15: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); srcloc: L616-4 {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,972 INFO L290 TraceCheckUtils]: 17: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,973 INFO L290 TraceCheckUtils]: 18: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} goto; {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 23:37:24,974 INFO L290 TraceCheckUtils]: 19: Hoare triple {17696#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} SUMMARY for call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); srcloc: L623-4 {17718#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:24,974 INFO L290 TraceCheckUtils]: 20: Hoare triple {17718#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} assume !(inspect_before_#t~mem27#1.base == 0bv32 && inspect_before_#t~mem27#1.offset == 0bv32);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {17652#false} is VALID [2022-02-20 23:37:24,975 INFO L272 TraceCheckUtils]: 21: Hoare triple {17652#false} call fail(); {17652#false} is VALID [2022-02-20 23:37:24,975 INFO L290 TraceCheckUtils]: 22: Hoare triple {17652#false} assume !false; {17652#false} is VALID [2022-02-20 23:37:24,975 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:24,975 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:37:25,185 INFO L290 TraceCheckUtils]: 22: Hoare triple {17652#false} assume !false; {17652#false} is VALID [2022-02-20 23:37:25,185 INFO L272 TraceCheckUtils]: 21: Hoare triple {17652#false} call fail(); {17652#false} is VALID [2022-02-20 23:37:25,186 INFO L290 TraceCheckUtils]: 20: Hoare triple {17718#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} assume !(inspect_before_#t~mem27#1.base == 0bv32 && inspect_before_#t~mem27#1.offset == 0bv32);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {17652#false} is VALID [2022-02-20 23:37:25,186 INFO L290 TraceCheckUtils]: 19: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} SUMMARY for call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); srcloc: L623-4 {17718#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:37:25,187 INFO L290 TraceCheckUtils]: 18: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} goto; {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,187 INFO L290 TraceCheckUtils]: 17: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,188 INFO L290 TraceCheckUtils]: 15: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} SUMMARY for call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); srcloc: L616-4 {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,189 INFO L290 TraceCheckUtils]: 14: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} goto; {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,189 INFO L290 TraceCheckUtils]: 13: Hoare triple {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,190 INFO L290 TraceCheckUtils]: 12: Hoare triple {17759#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {17737#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,190 INFO L290 TraceCheckUtils]: 11: Hoare triple {17759#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {17759#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,191 INFO L290 TraceCheckUtils]: 10: Hoare triple {17766#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)))} main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {17759#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,193 INFO L290 TraceCheckUtils]: 9: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32); srcloc: L648 {17766#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~item~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~item~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 23:37:25,193 INFO L290 TraceCheckUtils]: 8: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32); srcloc: L646-2 {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,194 INFO L290 TraceCheckUtils]: 7: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,194 INFO L290 TraceCheckUtils]: 6: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,195 INFO L290 TraceCheckUtils]: 5: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32); srcloc: L643 {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,195 INFO L290 TraceCheckUtils]: 4: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} SUMMARY for call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32); srcloc: L641-2 {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,196 INFO L290 TraceCheckUtils]: 3: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,196 INFO L290 TraceCheckUtils]: 2: Hoare triple {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,197 INFO L290 TraceCheckUtils]: 1: Hoare triple {17651#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {17659#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 23:37:25,197 INFO L290 TraceCheckUtils]: 0: Hoare triple {17651#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {17651#true} is VALID [2022-02-20 23:37:25,197 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:37:25,197 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:37:25,197 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2092430424] [2022-02-20 23:37:25,197 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2092430424] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:37:25,197 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:37:25,197 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7] total 11 [2022-02-20 23:37:25,198 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [999513060] [2022-02-20 23:37:25,198 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:37:25,198 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:37:25,198 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:37:25,198 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:25,232 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:37:25,232 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:37:25,232 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:37:25,232 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:37:25,232 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:37:25,233 INFO L87 Difference]: Start difference. First operand 288 states and 337 transitions. Second operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:30,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:37:30,229 INFO L93 Difference]: Finished difference Result 714 states and 811 transitions. [2022-02-20 23:37:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:37:30,230 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:37:30,230 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:37:30,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:30,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 737 transitions. [2022-02-20 23:37:30,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 11 states have (on average 3.272727272727273) internal successors, (36), 11 states have internal predecessors, (36), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:37:30,237 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 737 transitions. [2022-02-20 23:37:30,238 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 737 transitions.