./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0232-3.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0232-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:21,472 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:21,474 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:21,495 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:21,497 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:21,499 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:21,501 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:21,505 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:21,506 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:21,510 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:21,510 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:21,511 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:21,511 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:21,513 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:21,514 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:21,516 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:21,516 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:21,517 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:21,520 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:21,524 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:21,525 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:21,526 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:21,527 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:21,527 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:21,532 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:21,532 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:21,532 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:21,533 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:21,534 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:21,534 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:21,535 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:21,535 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:21,536 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:21,537 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:21,538 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:21,538 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:21,538 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:21,539 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:21,539 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:21,539 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:21,540 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:21,541 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2022-02-20 23:45:21,568 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:21,568 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:21,569 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:21,569 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:21,570 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:21,570 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:21,570 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:21,570 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:21,570 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:21,571 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:21,571 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:21,571 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:21,571 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:21,572 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:21,573 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:21,573 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:21,573 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:21,573 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:21,573 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:21,573 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:21,573 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:21,574 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:45:21,574 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:45:21,574 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2022-02-20 23:45:21,774 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:21,788 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:21,790 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:21,792 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:21,792 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:21,793 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-3.i [2022-02-20 23:45:21,830 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf35fdde/219c46551f614a6e9e02a1cb9e9943cb/FLAGd378f6b1f [2022-02-20 23:45:22,182 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:22,186 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2022-02-20 23:45:22,203 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf35fdde/219c46551f614a6e9e02a1cb9e9943cb/FLAGd378f6b1f [2022-02-20 23:45:22,563 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/eaf35fdde/219c46551f614a6e9e02a1cb9e9943cb [2022-02-20 23:45:22,565 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:22,566 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:22,568 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:22,568 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:22,570 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:22,571 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,572 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6cedb52 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22, skipping insertion in model container [2022-02-20 23:45:22,572 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,576 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:22,593 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:22,766 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:22,771 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:22,816 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:22,842 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:22,842 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22 WrapperNode [2022-02-20 23:45:22,842 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:22,843 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:22,843 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:22,843 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:22,870 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:45:22" (1/1) ... [2022-02-20 23:45:22,884 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:45:22" (1/1) ... [2022-02-20 23:45:22,903 INFO L137 Inliner]: procedures = 126, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-02-20 23:45:22,903 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:22,904 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:22,904 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:22,904 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:22,909 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,910 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,912 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,912 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,918 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,921 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,922 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,924 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:22,925 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:22,925 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:22,925 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:22,925 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (1/1) ... [2022-02-20 23:45:22,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:22,948 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:22,961 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:45:22,963 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:45:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:23,005 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:45:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:23,007 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:23,008 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:23,008 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:23,124 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:23,125 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:23,546 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:23,554 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:23,554 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:45:23,555 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:23 BoogieIcfgContainer [2022-02-20 23:45:23,555 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:23,556 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:23,556 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:23,560 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:23,560 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:22" (1/3) ... [2022-02-20 23:45:23,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a86035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:23, skipping insertion in model container [2022-02-20 23:45:23,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:22" (2/3) ... [2022-02-20 23:45:23,561 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@74a86035 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:23, skipping insertion in model container [2022-02-20 23:45:23,561 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:23" (3/3) ... [2022-02-20 23:45:23,563 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2022-02-20 23:45:23,566 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:23,567 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-02-20 23:45:23,604 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:23,608 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:45:23,609 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-02-20 23:45:23,628 INFO L276 IsEmpty]: Start isEmpty. Operand has 107 states, 51 states have (on average 2.215686274509804) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 states 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:45:23,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:23,631 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:23,632 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:23,632 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:23,635 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:23,635 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-02-20 23:45:23,641 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:23,642 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177727469] [2022-02-20 23:45:23,642 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:23,643 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:23,723 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,800 INFO L290 TraceCheckUtils]: 0: Hoare triple {110#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(14, 2); {110#true} is VALID [2022-02-20 23:45:23,802 INFO L290 TraceCheckUtils]: 1: Hoare triple {110#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {112#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:23,804 INFO L290 TraceCheckUtils]: 2: Hoare triple {112#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {113#(= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) 1)} is VALID [2022-02-20 23:45:23,805 INFO L290 TraceCheckUtils]: 3: Hoare triple {113#(= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) 1)} assume !(1 == #valid[append_~plist#1.base]); {111#false} is VALID [2022-02-20 23:45:23,806 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:45:23,807 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:23,807 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177727469] [2022-02-20 23:45:23,807 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177727469] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:23,808 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:23,808 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:23,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [935638887] [2022-02-20 23:45:23,811 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:23,814 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:23,815 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:23,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:23,825 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,825 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:23,826 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:23,842 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:23,842 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:23,844 INFO L87 Difference]: Start difference. First operand has 107 states, 51 states have (on average 2.215686274509804) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,207 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,208 INFO L93 Difference]: Finished difference Result 132 states and 138 transitions. [2022-02-20 23:45:24,208 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:24,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:24,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:24,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-02-20 23:45:24,221 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,224 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 155 transitions. [2022-02-20 23:45:24,225 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 155 transitions. [2022-02-20 23:45:24,339 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 155 edges. 155 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,354 INFO L225 Difference]: With dead ends: 132 [2022-02-20 23:45:24,354 INFO L226 Difference]: Without dead ends: 130 [2022-02-20 23:45:24,355 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:45:24,358 INFO L933 BasicCegarLoop]: 56 mSDtfsCounter, 185 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:24,358 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [185 Valid, 81 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:24,369 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 130 states. [2022-02-20 23:45:24,377 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 130 to 98. [2022-02-20 23:45:24,378 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:24,378 INFO L82 GeneralOperation]: Start isEquivalent. First operand 130 states. Second operand has 98 states, 51 states have (on average 2.019607843137255) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,379 INFO L74 IsIncluded]: Start isIncluded. First operand 130 states. Second operand has 98 states, 51 states have (on average 2.019607843137255) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,380 INFO L87 Difference]: Start difference. First operand 130 states. Second operand has 98 states, 51 states have (on average 2.019607843137255) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,384 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-02-20 23:45:24,384 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-02-20 23:45:24,385 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,385 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,386 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 51 states have (on average 2.019607843137255) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 130 states. [2022-02-20 23:45:24,386 INFO L87 Difference]: Start difference. First operand has 98 states, 51 states have (on average 2.019607843137255) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 130 states. [2022-02-20 23:45:24,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,390 INFO L93 Difference]: Finished difference Result 130 states and 136 transitions. [2022-02-20 23:45:24,390 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 136 transitions. [2022-02-20 23:45:24,391 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,391 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,391 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:24,391 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:24,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 51 states have (on average 2.019607843137255) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:24,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-02-20 23:45:24,395 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 4 [2022-02-20 23:45:24,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:24,395 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-02-20 23:45:24,395 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,396 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-02-20 23:45:24,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:24,396 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:24,396 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:24,396 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:24,396 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:24,397 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,397 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-02-20 23:45:24,397 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:24,397 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649863624] [2022-02-20 23:45:24,398 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,398 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:24,411 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,452 INFO L290 TraceCheckUtils]: 0: Hoare triple {608#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(14, 2); {608#true} is VALID [2022-02-20 23:45:24,453 INFO L290 TraceCheckUtils]: 1: Hoare triple {608#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {610#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1))} is VALID [2022-02-20 23:45:24,454 INFO L290 TraceCheckUtils]: 2: Hoare triple {610#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)) (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {611#(and (= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:24,455 INFO L290 TraceCheckUtils]: 3: Hoare triple {611#(and (= |ULTIMATE.start_append_~plist#1.offset| 0) (<= 4 (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} assume !(4 + append_~plist#1.offset <= #length[append_~plist#1.base] && 0 <= append_~plist#1.offset); {609#false} is VALID [2022-02-20 23:45:24,455 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:45:24,455 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:24,456 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649863624] [2022-02-20 23:45:24,456 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649863624] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:24,456 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:24,456 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:24,456 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [305247404] [2022-02-20 23:45:24,456 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:24,457 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:24,457 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:24,458 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:24,462 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:24,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:24,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:24,462 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,745 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-20 23:45:24,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:24,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:24,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:24,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-02-20 23:45:24,749 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 134 transitions. [2022-02-20 23:45:24,751 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 134 transitions. [2022-02-20 23:45:24,855 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 134 edges. 134 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,857 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:45:24,857 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:45:24,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:45:24,858 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 183 mSDsluCounter, 17 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 107 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:24,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 58 Invalid, 107 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:24,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:45:24,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 101. [2022-02-20 23:45:24,862 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:24,863 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 101 states, 59 states have (on average 1.8644067796610169) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:24,863 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 101 states, 59 states have (on average 1.8644067796610169) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:24,865 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 101 states, 59 states have (on average 1.8644067796610169) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:24,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,868 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-20 23:45:24,868 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-02-20 23:45:24,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,872 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 59 states have (on average 1.8644067796610169) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-20 23:45:24,873 INFO L87 Difference]: Start difference. First operand has 101 states, 59 states have (on average 1.8644067796610169) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-20 23:45:24,876 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,876 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-20 23:45:24,876 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-02-20 23:45:24,877 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,877 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,877 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:24,877 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:24,878 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 59 states have (on average 1.8644067796610169) internal successors, (110), 100 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:24,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 110 transitions. [2022-02-20 23:45:24,879 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 110 transitions. Word has length 4 [2022-02-20 23:45:24,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:24,880 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 110 transitions. [2022-02-20 23:45:24,880 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:24,880 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 110 transitions. [2022-02-20 23:45:24,880 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:45:24,880 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:24,881 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:45:24,881 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:45:24,881 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:24,881 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,881 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-02-20 23:45:24,882 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:24,882 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049450571] [2022-02-20 23:45:24,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,882 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:24,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,905 INFO L290 TraceCheckUtils]: 0: Hoare triple {1077#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(14, 2); {1077#true} is VALID [2022-02-20 23:45:24,906 INFO L290 TraceCheckUtils]: 1: Hoare triple {1077#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {1077#true} is VALID [2022-02-20 23:45:24,906 INFO L290 TraceCheckUtils]: 2: Hoare triple {1077#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1079#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:24,907 INFO L290 TraceCheckUtils]: 3: Hoare triple {1079#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1079#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} is VALID [2022-02-20 23:45:24,907 INFO L290 TraceCheckUtils]: 4: Hoare triple {1079#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1)} assume !(1 == #valid[append_~item~0#1.base]); {1078#false} is VALID [2022-02-20 23:45:24,907 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:45:24,907 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:24,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049450571] [2022-02-20 23:45:24,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049450571] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:24,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:24,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:24,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1982798237] [2022-02-20 23:45:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:24,909 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:45:24,909 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:24,909 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:45:24,912 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:45:24,913 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:24,913 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:24,913 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:24,913 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:24,914 INFO L87 Difference]: Start difference. First operand 101 states and 110 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:45:25,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,032 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:45:25,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:25,032 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:45:25,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:25,032 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:45:25,034 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 23:45:25,034 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:45:25,035 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 23:45:25,035 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2022-02-20 23:45:25,125 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:25,126 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:45:25,126 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:45:25,126 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:45:25,127 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:25,128 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 83 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:25,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:45:25,131 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 97. [2022-02-20 23:45:25,131 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:25,132 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 97 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:25,132 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 97 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:25,132 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 97 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:25,135 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,135 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:45:25,135 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:45:25,136 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,136 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,136 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:45:25,136 INFO L87 Difference]: Start difference. First operand has 97 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:45:25,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,139 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:45:25,139 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:45:25,140 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,140 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,140 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:25,140 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:25,140 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 59 states have (on average 1.7966101694915255) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:25,143 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:45:25,143 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 5 [2022-02-20 23:45:25,143 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:25,143 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:45:25,143 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:45:25,143 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:45:25,144 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:45:25,144 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:25,144 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:45:25,144 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:45:25,144 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:25,145 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:25,145 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-02-20 23:45:25,145 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:25,145 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1144509816] [2022-02-20 23:45:25,145 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:25,145 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:25,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:25,180 INFO L290 TraceCheckUtils]: 0: Hoare triple {1527#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(14, 2); {1527#true} is VALID [2022-02-20 23:45:25,181 INFO L290 TraceCheckUtils]: 1: Hoare triple {1527#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {1527#true} is VALID [2022-02-20 23:45:25,182 INFO L290 TraceCheckUtils]: 2: Hoare triple {1527#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1529#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:25,182 INFO L290 TraceCheckUtils]: 3: Hoare triple {1529#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1529#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:25,183 INFO L290 TraceCheckUtils]: 4: Hoare triple {1529#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (+ (select |#length| |ULTIMATE.start_append_~item~0#1.base|) (- 8)) 0))} assume !(4 + append_~item~0#1.offset <= #length[append_~item~0#1.base] && 0 <= append_~item~0#1.offset); {1528#false} is VALID [2022-02-20 23:45:25,183 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:45:25,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:25,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1144509816] [2022-02-20 23:45:25,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1144509816] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:25,184 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:25,184 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:25,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2041037636] [2022-02-20 23:45:25,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:25,184 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:45:25,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:25,185 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:45:25,188 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:45:25,188 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:25,189 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:25,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:25,190 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:25,191 INFO L87 Difference]: Start difference. First operand 97 states and 106 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:45:25,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,282 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:45:25,282 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:25,282 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:45:25,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:25,282 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:45:25,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 23:45:25,284 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:45:25,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 23:45:25,285 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-02-20 23:45:25,350 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:25,351 INFO L225 Difference]: With dead ends: 94 [2022-02-20 23:45:25,351 INFO L226 Difference]: Without dead ends: 94 [2022-02-20 23:45:25,351 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:45:25,352 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 54 SdHoareTripleChecker+Invalid, 41 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:25,353 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 54 Invalid, 41 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:25,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2022-02-20 23:45:25,355 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 93. [2022-02-20 23:45:25,355 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:25,356 INFO L82 GeneralOperation]: Start isEquivalent. First operand 94 states. Second operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:25,356 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:25,356 INFO L87 Difference]: Start difference. First operand 94 states. Second operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:25,358 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,358 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:45:25,358 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:45:25,358 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,358 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,359 INFO L74 IsIncluded]: Start isIncluded. First operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 94 states. [2022-02-20 23:45:25,359 INFO L87 Difference]: Start difference. First operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 94 states. [2022-02-20 23:45:25,360 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,360 INFO L93 Difference]: Finished difference Result 94 states and 103 transitions. [2022-02-20 23:45:25,360 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 103 transitions. [2022-02-20 23:45:25,361 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,361 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,361 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:25,361 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:25,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 59 states have (on average 1.728813559322034) internal successors, (102), 92 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:25,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 102 transitions. [2022-02-20 23:45:25,363 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 102 transitions. Word has length 5 [2022-02-20 23:45:25,363 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:25,363 INFO L470 AbstractCegarLoop]: Abstraction has 93 states and 102 transitions. [2022-02-20 23:45:25,363 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:45:25,363 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 102 transitions. [2022-02-20 23:45:25,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:25,364 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:25,364 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:25,364 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:45:25,364 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:25,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:25,365 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-02-20 23:45:25,365 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:25,365 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [315355390] [2022-02-20 23:45:25,365 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:25,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:25,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:25,470 INFO L290 TraceCheckUtils]: 0: Hoare triple {1907#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(14, 2); {1907#true} is VALID [2022-02-20 23:45:25,471 INFO L290 TraceCheckUtils]: 1: Hoare triple {1907#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {1909#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:25,471 INFO L290 TraceCheckUtils]: 2: Hoare triple {1909#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0))} is VALID [2022-02-20 23:45:25,472 INFO L290 TraceCheckUtils]: 3: Hoare triple {1910#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {1911#(and (= |ULTIMATE.start_append_#t~mem4#1.offset| 0) (= 0 |ULTIMATE.start_append_#t~mem4#1.base|))} is VALID [2022-02-20 23:45:25,473 INFO L290 TraceCheckUtils]: 4: Hoare triple {1911#(and (= |ULTIMATE.start_append_#t~mem4#1.offset| 0) (= 0 |ULTIMATE.start_append_#t~mem4#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {1912#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:45:25,473 INFO L290 TraceCheckUtils]: 5: Hoare triple {1912#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {1912#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:45:25,474 INFO L290 TraceCheckUtils]: 6: Hoare triple {1912#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {1913#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.base| 0))} is VALID [2022-02-20 23:45:25,474 INFO L290 TraceCheckUtils]: 7: Hoare triple {1913#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| 0) (= |ULTIMATE.start_append_#t~mem5#1.base| 0))} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {1908#false} is VALID [2022-02-20 23:45:25,474 INFO L290 TraceCheckUtils]: 8: Hoare triple {1908#false} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {1908#false} is VALID [2022-02-20 23:45:25,474 INFO L290 TraceCheckUtils]: 9: Hoare triple {1908#false} assume !(1 == #valid[append_#t~mem6#1.base]); {1908#false} is VALID [2022-02-20 23:45:25,474 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:45:25,474 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:25,475 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [315355390] [2022-02-20 23:45:25,475 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [315355390] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:25,475 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:25,475 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:25,475 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563583246] [2022-02-20 23:45:25,475 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:25,475 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:45:25,475 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:25,476 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:25,482 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:25,482 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:25,482 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:25,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:25,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:25,483 INFO L87 Difference]: Start difference. First operand 93 states and 102 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:25,848 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,848 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-02-20 23:45:25,848 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:45:25,849 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:45:25,849 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:25,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:25,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-02-20 23:45:25,850 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:25,850 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 100 transitions. [2022-02-20 23:45:25,850 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 100 transitions. [2022-02-20 23:45:25,914 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 100 edges. 100 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:25,915 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:45:25,915 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:45:25,915 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=107, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:25,916 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 14 mSDsluCounter, 343 mSDsCounter, 0 mSdLazyCounter, 102 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 424 SdHoareTripleChecker+Invalid, 108 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 102 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:25,916 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 424 Invalid, 108 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 102 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:25,917 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:45:25,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 99. [2022-02-20 23:45:25,919 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:25,919 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 99 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:25,919 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 99 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:25,919 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 99 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:25,921 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,921 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-02-20 23:45:25,921 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-02-20 23:45:25,921 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,921 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,921 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 23:45:25,921 INFO L87 Difference]: Start difference. First operand has 99 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 23:45:25,923 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,923 INFO L93 Difference]: Finished difference Result 104 states and 113 transitions. [2022-02-20 23:45:25,923 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 113 transitions. [2022-02-20 23:45:25,923 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,923 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,923 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:25,923 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:25,923 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 65 states have (on average 1.6615384615384616) internal successors, (108), 98 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:25,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 108 transitions. [2022-02-20 23:45:25,925 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 108 transitions. Word has length 10 [2022-02-20 23:45:25,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:25,925 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 108 transitions. [2022-02-20 23:45:25,925 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:25,925 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 108 transitions. [2022-02-20 23:45:25,925 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:45:25,925 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:25,925 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:25,925 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:45:25,926 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:25,926 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:25,926 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015976, now seen corresponding path program 1 times [2022-02-20 23:45:25,926 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:25,926 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1180157019] [2022-02-20 23:45:25,926 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:25,926 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:25,952 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:26,013 INFO L290 TraceCheckUtils]: 0: Hoare triple {2339#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(14, 2); {2339#true} is VALID [2022-02-20 23:45:26,014 INFO L290 TraceCheckUtils]: 1: Hoare triple {2339#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {2339#true} is VALID [2022-02-20 23:45:26,015 INFO L290 TraceCheckUtils]: 2: Hoare triple {2339#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,015 INFO L290 TraceCheckUtils]: 3: Hoare triple {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,016 INFO L290 TraceCheckUtils]: 4: Hoare triple {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,016 INFO L290 TraceCheckUtils]: 5: Hoare triple {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,017 INFO L290 TraceCheckUtils]: 6: Hoare triple {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,017 INFO L290 TraceCheckUtils]: 7: Hoare triple {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,018 INFO L290 TraceCheckUtils]: 8: Hoare triple {2341#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {2342#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,018 INFO L290 TraceCheckUtils]: 9: Hoare triple {2342#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2342#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,019 INFO L290 TraceCheckUtils]: 10: Hoare triple {2342#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:26,020 INFO L290 TraceCheckUtils]: 11: Hoare triple {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume { :end_inline_append } true; {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:26,020 INFO L290 TraceCheckUtils]: 12: Hoare triple {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:26,020 INFO L290 TraceCheckUtils]: 13: Hoare triple {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:26,021 INFO L290 TraceCheckUtils]: 14: Hoare triple {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:26,021 INFO L290 TraceCheckUtils]: 15: Hoare triple {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:26,022 INFO L290 TraceCheckUtils]: 16: Hoare triple {2343#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {2344#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} is VALID [2022-02-20 23:45:26,022 INFO L290 TraceCheckUtils]: 17: Hoare triple {2344#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) 1)} assume !(1 == #valid[main_#t~mem12#1.base]); {2340#false} is VALID [2022-02-20 23:45:26,022 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:45:26,022 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:26,023 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1180157019] [2022-02-20 23:45:26,023 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1180157019] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:26,023 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:26,023 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:26,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [223083337] [2022-02-20 23:45:26,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:26,024 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:45:26,024 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:26,024 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:26,037 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:26,037 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:26,037 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:26,038 INFO L87 Difference]: Start difference. First operand 99 states and 108 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,367 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,368 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:45:26,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:26,368 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:45:26,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:26,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-02-20 23:45:26,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 119 transitions. [2022-02-20 23:45:26,370 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 119 transitions. [2022-02-20 23:45:26,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 119 edges. 119 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,462 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:45:26,462 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:45:26,462 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:45:26,463 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 148 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 148 SdHoareTripleChecker+Valid, 122 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:26,463 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [148 Valid, 122 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:26,464 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:45:26,469 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-02-20 23:45:26,469 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:26,470 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 98 states, 65 states have (on average 1.646153846153846) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:26,470 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 98 states, 65 states have (on average 1.646153846153846) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:26,470 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 98 states, 65 states have (on average 1.646153846153846) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:26,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,472 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:45:26,472 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:45:26,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:26,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:26,473 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 65 states have (on average 1.646153846153846) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:45:26,473 INFO L87 Difference]: Start difference. First operand has 98 states, 65 states have (on average 1.646153846153846) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:45:26,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,475 INFO L93 Difference]: Finished difference Result 116 states and 123 transitions. [2022-02-20 23:45:26,475 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 123 transitions. [2022-02-20 23:45:26,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:26,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:26,475 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:26,475 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:26,475 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 65 states have (on average 1.646153846153846) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:26,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-02-20 23:45:26,477 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 18 [2022-02-20 23:45:26,477 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:26,477 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-02-20 23:45:26,477 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,477 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-20 23:45:26,478 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:45:26,478 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:26,478 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:26,478 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:45:26,478 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:26,478 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:26,478 INFO L85 PathProgramCache]: Analyzing trace with hash 2075015977, now seen corresponding path program 1 times [2022-02-20 23:45:26,479 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:26,479 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1610289792] [2022-02-20 23:45:26,479 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:26,479 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:26,508 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:26,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {2797#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(14, 2); {2797#true} is VALID [2022-02-20 23:45:26,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {2797#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {2797#true} is VALID [2022-02-20 23:45:26,583 INFO L290 TraceCheckUtils]: 2: Hoare triple {2797#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,584 INFO L290 TraceCheckUtils]: 3: Hoare triple {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,588 INFO L290 TraceCheckUtils]: 4: Hoare triple {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,588 INFO L290 TraceCheckUtils]: 5: Hoare triple {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,589 INFO L290 TraceCheckUtils]: 6: Hoare triple {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,589 INFO L290 TraceCheckUtils]: 7: Hoare triple {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,590 INFO L290 TraceCheckUtils]: 8: Hoare triple {2799#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {2800#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,590 INFO L290 TraceCheckUtils]: 9: Hoare triple {2800#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2800#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:26,591 INFO L290 TraceCheckUtils]: 10: Hoare triple {2800#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:26,592 INFO L290 TraceCheckUtils]: 11: Hoare triple {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:26,594 INFO L290 TraceCheckUtils]: 12: Hoare triple {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:26,595 INFO L290 TraceCheckUtils]: 13: Hoare triple {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:26,595 INFO L290 TraceCheckUtils]: 14: Hoare triple {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:26,596 INFO L290 TraceCheckUtils]: 15: Hoare triple {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:26,596 INFO L290 TraceCheckUtils]: 16: Hoare triple {2801#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {2802#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|)) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} is VALID [2022-02-20 23:45:26,597 INFO L290 TraceCheckUtils]: 17: Hoare triple {2802#(and (<= 8 (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|)) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0))} assume !(4 + main_#t~mem12#1.offset <= #length[main_#t~mem12#1.base] && 0 <= main_#t~mem12#1.offset); {2798#false} is VALID [2022-02-20 23:45:26,597 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:45:26,597 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:26,597 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1610289792] [2022-02-20 23:45:26,597 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1610289792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:26,597 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:26,598 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:26,598 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [848677513] [2022-02-20 23:45:26,598 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:26,598 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:45:26,598 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:26,598 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,610 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,610 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:26,610 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:26,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:26,612 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:26,612 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,984 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,984 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-02-20 23:45:26,984 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:26,984 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 18 [2022-02-20 23:45:26,985 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:26,985 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,986 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-02-20 23:45:26,986 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:26,987 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 123 transitions. [2022-02-20 23:45:26,987 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 123 transitions. [2022-02-20 23:45:27,092 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 123 edges. 123 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,093 INFO L225 Difference]: With dead ends: 121 [2022-02-20 23:45:27,093 INFO L226 Difference]: Without dead ends: 121 [2022-02-20 23:45:27,093 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 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:45:27,094 INFO L933 BasicCegarLoop]: 48 mSDtfsCounter, 273 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 119 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:27,094 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 119 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:27,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2022-02-20 23:45:27,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 97. [2022-02-20 23:45:27,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:27,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 121 states. Second operand has 97 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:27,097 INFO L74 IsIncluded]: Start isIncluded. First operand 121 states. Second operand has 97 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:27,097 INFO L87 Difference]: Start difference. First operand 121 states. Second operand has 97 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:27,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,099 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-02-20 23:45:27,099 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2022-02-20 23:45:27,099 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,099 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,099 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 121 states. [2022-02-20 23:45:27,100 INFO L87 Difference]: Start difference. First operand has 97 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 121 states. [2022-02-20 23:45:27,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,101 INFO L93 Difference]: Finished difference Result 121 states and 128 transitions. [2022-02-20 23:45:27,102 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 128 transitions. [2022-02-20 23:45:27,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,102 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,102 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:27,102 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:27,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 65 states have (on average 1.6307692307692307) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:27,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:45:27,104 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 18 [2022-02-20 23:45:27,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:27,104 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:45:27,104 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.6) internal successors, (18), 6 states have internal predecessors, (18), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,104 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:45:27,104 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:45:27,104 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:27,105 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:27,105 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:45:27,105 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:27,105 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:27,105 INFO L85 PathProgramCache]: Analyzing trace with hash 1257147052, now seen corresponding path program 1 times [2022-02-20 23:45:27,106 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:27,106 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1627006818] [2022-02-20 23:45:27,106 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:27,106 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:27,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:27,150 INFO L290 TraceCheckUtils]: 0: Hoare triple {3269#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(14, 2); {3269#true} is VALID [2022-02-20 23:45:27,150 INFO L290 TraceCheckUtils]: 1: Hoare triple {3269#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {3269#true} is VALID [2022-02-20 23:45:27,151 INFO L290 TraceCheckUtils]: 2: Hoare triple {3269#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,152 INFO L290 TraceCheckUtils]: 3: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,152 INFO L290 TraceCheckUtils]: 4: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,153 INFO L290 TraceCheckUtils]: 5: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,153 INFO L290 TraceCheckUtils]: 6: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,154 INFO L290 TraceCheckUtils]: 7: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,154 INFO L290 TraceCheckUtils]: 8: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,155 INFO L290 TraceCheckUtils]: 10: Hoare triple {3271#(and (not (= |ULTIMATE.start_append_~item~0#1.base| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,156 INFO L290 TraceCheckUtils]: 11: Hoare triple {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,157 INFO L290 TraceCheckUtils]: 14: Hoare triple {3272#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {3273#(not (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} is VALID [2022-02-20 23:45:27,158 INFO L290 TraceCheckUtils]: 15: Hoare triple {3273#(not (= |ULTIMATE.start_main_#t~mem11#1.base| 0))} assume !(main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {3270#false} is VALID [2022-02-20 23:45:27,158 INFO L290 TraceCheckUtils]: 16: Hoare triple {3270#false} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L554-1 {3270#false} is VALID [2022-02-20 23:45:27,158 INFO L290 TraceCheckUtils]: 17: Hoare triple {3270#false} assume !(main_#t~mem22#1.base != 0 || main_#t~mem22#1.offset != 0);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {3270#false} is VALID [2022-02-20 23:45:27,158 INFO L290 TraceCheckUtils]: 18: Hoare triple {3270#false} main_#res#1 := 0;call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; {3270#false} is VALID [2022-02-20 23:45:27,158 INFO L290 TraceCheckUtils]: 19: Hoare triple {3270#false} assume !(#valid == main_old_#valid#1); {3270#false} is VALID [2022-02-20 23:45:27,158 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:27,158 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:27,158 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1627006818] [2022-02-20 23:45:27,158 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1627006818] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:27,158 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:27,158 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:27,158 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [349435298] [2022-02-20 23:45:27,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:27,159 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:45:27,159 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:27,159 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,171 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,172 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:27,172 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:27,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:27,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:27,172 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,393 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:45:27,393 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:27,393 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:45:27,393 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:27,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-02-20 23:45:27,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 89 transitions. [2022-02-20 23:45:27,395 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 89 transitions. [2022-02-20 23:45:27,452 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 89 edges. 89 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,453 INFO L225 Difference]: With dead ends: 89 [2022-02-20 23:45:27,453 INFO L226 Difference]: Without dead ends: 89 [2022-02-20 23:45:27,453 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:27,454 INFO L933 BasicCegarLoop]: 54 mSDtfsCounter, 98 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 139 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:27,454 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [98 Valid, 139 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:27,454 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2022-02-20 23:45:27,456 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2022-02-20 23:45:27,456 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:27,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 89 states. Second operand has 89 states, 57 states have (on average 1.631578947368421) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:45:27,456 INFO L74 IsIncluded]: Start isIncluded. First operand 89 states. Second operand has 89 states, 57 states have (on average 1.631578947368421) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:45:27,456 INFO L87 Difference]: Start difference. First operand 89 states. Second operand has 89 states, 57 states have (on average 1.631578947368421) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:45:27,457 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,457 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:45:27,457 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:45:27,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 57 states have (on average 1.631578947368421) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 89 states. [2022-02-20 23:45:27,458 INFO L87 Difference]: Start difference. First operand has 89 states, 57 states have (on average 1.631578947368421) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 89 states. [2022-02-20 23:45:27,459 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,459 INFO L93 Difference]: Finished difference Result 89 states and 93 transitions. [2022-02-20 23:45:27,468 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:45:27,468 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,468 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,468 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:27,468 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:27,469 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 57 states have (on average 1.631578947368421) internal successors, (93), 88 states have internal predecessors, (93), 0 states have call successors, (0), 0 states 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:45:27,470 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 93 transitions. [2022-02-20 23:45:27,470 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 93 transitions. Word has length 20 [2022-02-20 23:45:27,470 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:27,470 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 93 transitions. [2022-02-20 23:45:27,470 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,470 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 93 transitions. [2022-02-20 23:45:27,470 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:27,470 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:27,470 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:27,470 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:45:27,472 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:27,472 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:27,472 INFO L85 PathProgramCache]: Analyzing trace with hash -663319494, now seen corresponding path program 1 times [2022-02-20 23:45:27,472 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:27,473 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1149522478] [2022-02-20 23:45:27,473 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:27,473 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:27,506 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:27,525 INFO L290 TraceCheckUtils]: 0: Hoare triple {3636#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(14, 2); {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {3636#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {3636#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 3: Hoare triple {3636#true} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {3636#true} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 5: Hoare triple {3636#true} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 6: Hoare triple {3636#true} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 7: Hoare triple {3636#true} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 8: Hoare triple {3636#true} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 9: Hoare triple {3636#true} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 10: Hoare triple {3636#true} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 11: Hoare triple {3636#true} assume { :end_inline_append } true; {3636#true} is VALID [2022-02-20 23:45:27,526 INFO L290 TraceCheckUtils]: 12: Hoare triple {3636#true} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {3636#true} is VALID [2022-02-20 23:45:27,527 INFO L290 TraceCheckUtils]: 13: Hoare triple {3636#true} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {3636#true} is VALID [2022-02-20 23:45:27,527 INFO L290 TraceCheckUtils]: 14: Hoare triple {3636#true} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {3636#true} is VALID [2022-02-20 23:45:27,527 INFO L290 TraceCheckUtils]: 15: Hoare triple {3636#true} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {3636#true} is VALID [2022-02-20 23:45:27,527 INFO L290 TraceCheckUtils]: 16: Hoare triple {3636#true} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {3638#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|)} is VALID [2022-02-20 23:45:27,527 INFO L290 TraceCheckUtils]: 17: Hoare triple {3638#(= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|)} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {3639#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:27,528 INFO L290 TraceCheckUtils]: 18: Hoare triple {3639#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {3639#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:27,528 INFO L290 TraceCheckUtils]: 19: Hoare triple {3639#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {3640#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} is VALID [2022-02-20 23:45:27,528 INFO L290 TraceCheckUtils]: 20: Hoare triple {3640#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) 1)} assume !(1 == #valid[main_#t~mem14#1.base]); {3637#false} is VALID [2022-02-20 23:45:27,529 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:45:27,529 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:27,529 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1149522478] [2022-02-20 23:45:27,529 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1149522478] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:27,529 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:27,529 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:27,529 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [513708290] [2022-02-20 23:45:27,529 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:27,529 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:45:27,529 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:27,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,541 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,541 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:27,541 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:27,541 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:27,541 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:27,541 INFO L87 Difference]: Start difference. First operand 89 states and 93 transitions. Second operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,757 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:45:27,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:27,758 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:45:27,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:27,758 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,758 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-02-20 23:45:27,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 85 transitions. [2022-02-20 23:45:27,759 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 85 transitions. [2022-02-20 23:45:27,813 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 85 edges. 85 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,814 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:45:27,814 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:45:27,814 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:27,815 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 111 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 189 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:27,815 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [16 Valid, 189 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:27,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:45:27,817 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-20 23:45:27,817 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:27,817 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,817 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,817 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,818 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:45:27,818 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-02-20 23:45:27,818 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,818 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,819 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 23:45:27,819 INFO L87 Difference]: Start difference. First operand has 88 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 23:45:27,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,820 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:45:27,820 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-02-20 23:45:27,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,820 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:27,820 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:27,820 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 57 states have (on average 1.6140350877192982) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-02-20 23:45:27,821 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 21 [2022-02-20 23:45:27,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:27,821 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-02-20 23:45:27,821 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.25) internal successors, (21), 5 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,821 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-02-20 23:45:27,821 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:27,821 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:27,821 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:27,821 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:45:27,821 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:27,824 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:27,824 INFO L85 PathProgramCache]: Analyzing trace with hash -663319493, now seen corresponding path program 1 times [2022-02-20 23:45:27,824 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:27,824 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [836785003] [2022-02-20 23:45:27,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:27,824 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:27,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:27,926 INFO L290 TraceCheckUtils]: 0: Hoare triple {3999#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(14, 2); {3999#true} is VALID [2022-02-20 23:45:27,926 INFO L290 TraceCheckUtils]: 1: Hoare triple {3999#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {3999#true} is VALID [2022-02-20 23:45:27,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {3999#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,933 INFO L290 TraceCheckUtils]: 4: Hoare triple {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,933 INFO L290 TraceCheckUtils]: 5: Hoare triple {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,933 INFO L290 TraceCheckUtils]: 6: Hoare triple {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,934 INFO L290 TraceCheckUtils]: 7: Hoare triple {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,935 INFO L290 TraceCheckUtils]: 8: Hoare triple {4001#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {4002#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,935 INFO L290 TraceCheckUtils]: 9: Hoare triple {4002#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4002#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:27,936 INFO L290 TraceCheckUtils]: 10: Hoare triple {4002#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,936 INFO L290 TraceCheckUtils]: 11: Hoare triple {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,937 INFO L290 TraceCheckUtils]: 12: Hoare triple {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,938 INFO L290 TraceCheckUtils]: 13: Hoare triple {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,938 INFO L290 TraceCheckUtils]: 14: Hoare triple {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,940 INFO L290 TraceCheckUtils]: 15: Hoare triple {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:27,940 INFO L290 TraceCheckUtils]: 16: Hoare triple {4003#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {4004#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:27,947 INFO L290 TraceCheckUtils]: 17: Hoare triple {4004#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_#t~mem12#1.offset| 0) (= |ULTIMATE.start_main_#t~mem12#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {4005#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:27,949 INFO L290 TraceCheckUtils]: 18: Hoare triple {4005#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {4005#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:27,950 INFO L290 TraceCheckUtils]: 19: Hoare triple {4005#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (<= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {4006#(and (<= (+ 8 |ULTIMATE.start_main_#t~mem14#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (<= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} is VALID [2022-02-20 23:45:27,951 INFO L290 TraceCheckUtils]: 20: Hoare triple {4006#(and (<= (+ 8 |ULTIMATE.start_main_#t~mem14#1.offset|) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (<= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} assume !(4 + (4 + main_#t~mem14#1.offset) <= #length[main_#t~mem14#1.base] && 0 <= 4 + main_#t~mem14#1.offset); {4000#false} is VALID [2022-02-20 23:45:27,951 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:45:27,951 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:27,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [836785003] [2022-02-20 23:45:27,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [836785003] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:27,951 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:27,951 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:27,952 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1103022375] [2022-02-20 23:45:27,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:27,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:45:27,953 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:27,953 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:27,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,968 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:27,968 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:27,968 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:27,968 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:27,968 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,381 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:45:28,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:28,382 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:45:28,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-02-20 23:45:28,382 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-02-20 23:45:28,383 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-02-20 23:45:28,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:28,449 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:45:28,449 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:45:28,449 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:28,450 INFO L933 BasicCegarLoop]: 46 mSDtfsCounter, 203 mSDsluCounter, 106 mSDsCounter, 0 mSdLazyCounter, 156 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 203 SdHoareTripleChecker+Valid, 152 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 156 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:28,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [203 Valid, 152 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 156 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:28,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:45:28,451 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-20 23:45:28,451 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:28,451 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:45:28,451 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:45:28,452 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:45:28,452 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,452 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:45:28,452 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:45:28,453 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,453 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,453 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:45:28,453 INFO L87 Difference]: Start difference. First operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:45:28,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,454 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:45:28,454 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:45:28,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,455 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,455 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:28,455 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:28,455 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 57 states have (on average 1.5964912280701755) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:45:28,456 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-02-20 23:45:28,456 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 21 [2022-02-20 23:45:28,456 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:28,456 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-02-20 23:45:28,456 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.0) internal successors, (21), 8 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,456 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:45:28,456 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:28,457 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:28,457 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:28,457 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:45:28,457 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:28,457 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:28,457 INFO L85 PathProgramCache]: Analyzing trace with hash 911932203, now seen corresponding path program 1 times [2022-02-20 23:45:28,457 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:28,458 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [474519759] [2022-02-20 23:45:28,458 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:28,458 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:28,500 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,656 INFO L290 TraceCheckUtils]: 0: Hoare triple {4363#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(14, 2); {4363#true} is VALID [2022-02-20 23:45:28,658 INFO L290 TraceCheckUtils]: 1: Hoare triple {4363#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {4365#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:28,659 INFO L290 TraceCheckUtils]: 2: Hoare triple {4365#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,660 INFO L290 TraceCheckUtils]: 3: Hoare triple {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,660 INFO L290 TraceCheckUtils]: 4: Hoare triple {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,661 INFO L290 TraceCheckUtils]: 5: Hoare triple {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,661 INFO L290 TraceCheckUtils]: 6: Hoare triple {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,662 INFO L290 TraceCheckUtils]: 7: Hoare triple {4366#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4367#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_append_#t~ite9#1.offset| 0))} is VALID [2022-02-20 23:45:28,662 INFO L290 TraceCheckUtils]: 8: Hoare triple {4367#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_append_#t~ite9#1.offset| 0))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {4368#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,663 INFO L290 TraceCheckUtils]: 9: Hoare triple {4368#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4368#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:28,664 INFO L290 TraceCheckUtils]: 10: Hoare triple {4368#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,664 INFO L290 TraceCheckUtils]: 11: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,665 INFO L290 TraceCheckUtils]: 12: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,665 INFO L290 TraceCheckUtils]: 13: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,666 INFO L290 TraceCheckUtils]: 14: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,666 INFO L290 TraceCheckUtils]: 15: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,667 INFO L290 TraceCheckUtils]: 16: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {4370#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem12#1.base|) 4) 0))} is VALID [2022-02-20 23:45:28,667 INFO L290 TraceCheckUtils]: 17: Hoare triple {4370#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem12#1.base|) 4) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,668 INFO L290 TraceCheckUtils]: 18: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:28,668 INFO L290 TraceCheckUtils]: 19: Hoare triple {4369#(and (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {4371#(and (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0))} is VALID [2022-02-20 23:45:28,669 INFO L290 TraceCheckUtils]: 20: Hoare triple {4371#(and (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) 0))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {4372#(= |ULTIMATE.start_main_#t~mem15#1.offset| 0)} is VALID [2022-02-20 23:45:28,669 INFO L290 TraceCheckUtils]: 21: Hoare triple {4372#(= |ULTIMATE.start_main_#t~mem15#1.offset| 0)} assume !(0 == main_#t~mem15#1.offset); {4364#false} is VALID [2022-02-20 23:45:28,669 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:28,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:28,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [474519759] [2022-02-20 23:45:28,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [474519759] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:28,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:28,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:28,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194959502] [2022-02-20 23:45:28,670 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:28,671 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:45:28,671 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:28,671 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:28,689 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:28,690 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:28,690 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:28,690 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:28,690 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:28,690 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:29,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,714 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2022-02-20 23:45:29,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:45:29,714 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:45:29,714 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:29,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:29,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2022-02-20 23:45:29,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:29,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 172 transitions. [2022-02-20 23:45:29,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 172 transitions. [2022-02-20 23:45:29,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 172 edges. 172 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:29,858 INFO L225 Difference]: With dead ends: 169 [2022-02-20 23:45:29,858 INFO L226 Difference]: Without dead ends: 169 [2022-02-20 23:45:29,858 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:45:29,859 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 359 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 387 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 251 SdHoareTripleChecker+Invalid, 426 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 387 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:29,859 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 251 Invalid, 426 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 387 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:29,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 169 states. [2022-02-20 23:45:29,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 169 to 101. [2022-02-20 23:45:29,861 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:29,861 INFO L82 GeneralOperation]: Start isEquivalent. First operand 169 states. Second operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:29,861 INFO L74 IsIncluded]: Start isIncluded. First operand 169 states. Second operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:29,861 INFO L87 Difference]: Start difference. First operand 169 states. Second operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:29,863 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,863 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2022-02-20 23:45:29,863 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2022-02-20 23:45:29,863 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:29,863 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:29,863 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:45:29,863 INFO L87 Difference]: Start difference. First operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 169 states. [2022-02-20 23:45:29,865 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,865 INFO L93 Difference]: Finished difference Result 169 states and 176 transitions. [2022-02-20 23:45:29,865 INFO L276 IsEmpty]: Start isEmpty. Operand 169 states and 176 transitions. [2022-02-20 23:45:29,865 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:29,865 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:29,865 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:29,865 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:29,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 71 states have (on average 1.4929577464788732) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-02-20 23:45:29,872 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 22 [2022-02-20 23:45:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:29,872 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-02-20 23:45:29,872 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.4444444444444446) internal successors, (22), 10 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-02-20 23:45:29,872 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:29,872 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:29,873 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:29,873 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:45:29,873 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:29,873 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:29,873 INFO L85 PathProgramCache]: Analyzing trace with hash -428723026, now seen corresponding path program 1 times [2022-02-20 23:45:29,873 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:29,873 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1035769] [2022-02-20 23:45:29,873 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:29,873 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:29,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,968 INFO L290 TraceCheckUtils]: 0: Hoare triple {5009#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(14, 2); {5009#true} is VALID [2022-02-20 23:45:29,968 INFO L290 TraceCheckUtils]: 1: Hoare triple {5009#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {5009#true} is VALID [2022-02-20 23:45:29,969 INFO L290 TraceCheckUtils]: 2: Hoare triple {5009#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,969 INFO L290 TraceCheckUtils]: 3: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,970 INFO L290 TraceCheckUtils]: 4: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,970 INFO L290 TraceCheckUtils]: 5: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,971 INFO L290 TraceCheckUtils]: 6: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,971 INFO L290 TraceCheckUtils]: 7: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,972 INFO L290 TraceCheckUtils]: 8: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {5012#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,972 INFO L290 TraceCheckUtils]: 9: Hoare triple {5012#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5012#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:29,973 INFO L290 TraceCheckUtils]: 10: Hoare triple {5012#(and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,973 INFO L290 TraceCheckUtils]: 11: Hoare triple {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume { :end_inline_append } true; {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,973 INFO L290 TraceCheckUtils]: 12: Hoare triple {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,974 INFO L290 TraceCheckUtils]: 13: Hoare triple {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume !!(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,974 INFO L290 TraceCheckUtils]: 14: Hoare triple {5013#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5014#(or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) 1))} is VALID [2022-02-20 23:45:29,975 INFO L290 TraceCheckUtils]: 15: Hoare triple {5014#(or (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) 1))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {5015#(or (= (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_append_#t~mem4#1.base|))} is VALID [2022-02-20 23:45:29,975 INFO L290 TraceCheckUtils]: 16: Hoare triple {5015#(or (= (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_append_#t~mem4#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,975 INFO L290 TraceCheckUtils]: 17: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,976 INFO L290 TraceCheckUtils]: 18: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,976 INFO L290 TraceCheckUtils]: 19: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:29,976 INFO L290 TraceCheckUtils]: 20: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {5017#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:45:29,977 INFO L290 TraceCheckUtils]: 21: Hoare triple {5017#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} assume !(1 == #valid[append_#t~mem6#1.base]); {5010#false} is VALID [2022-02-20 23:45:29,977 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:29,977 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:29,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1035769] [2022-02-20 23:45:29,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1035769] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:29,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2127097646] [2022-02-20 23:45:29,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:29,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:29,978 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:29,979 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:29,987 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:45:30,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:30,058 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 23:45:30,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:30,086 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:30,299 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 11 treesize of output 7 [2022-02-20 23:45:30,375 INFO L356 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2022-02-20 23:45:30,375 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 21 treesize of output 29 [2022-02-20 23:45:30,482 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:30,483 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-02-20 23:45:30,682 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:45:30,683 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-02-20 23:45:30,697 INFO L290 TraceCheckUtils]: 0: Hoare triple {5009#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(14, 2); {5009#true} is VALID [2022-02-20 23:45:30,698 INFO L290 TraceCheckUtils]: 1: Hoare triple {5009#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {5024#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:30,698 INFO L290 TraceCheckUtils]: 2: Hoare triple {5024#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,699 INFO L290 TraceCheckUtils]: 3: Hoare triple {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,699 INFO L290 TraceCheckUtils]: 4: Hoare triple {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,700 INFO L290 TraceCheckUtils]: 5: Hoare triple {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,700 INFO L290 TraceCheckUtils]: 6: Hoare triple {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,715 INFO L290 TraceCheckUtils]: 7: Hoare triple {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,716 INFO L290 TraceCheckUtils]: 8: Hoare triple {5028#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {5047#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,716 INFO L290 TraceCheckUtils]: 9: Hoare triple {5047#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5047#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:30,717 INFO L290 TraceCheckUtils]: 10: Hoare triple {5047#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:30,718 INFO L290 TraceCheckUtils]: 11: Hoare triple {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :end_inline_append } true; {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:30,718 INFO L290 TraceCheckUtils]: 12: Hoare triple {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:30,719 INFO L290 TraceCheckUtils]: 13: Hoare triple {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume !!(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:30,720 INFO L290 TraceCheckUtils]: 14: Hoare triple {5054#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5067#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| 0))} is VALID [2022-02-20 23:45:30,721 INFO L290 TraceCheckUtils]: 15: Hoare triple {5067#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| 0))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {5071#(exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_#t~mem4#1.base|)))} is VALID [2022-02-20 23:45:30,722 INFO L290 TraceCheckUtils]: 16: Hoare triple {5071#(exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0)) 1) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_#t~mem4#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,723 INFO L290 TraceCheckUtils]: 17: Hoare triple {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,724 INFO L290 TraceCheckUtils]: 18: Hoare triple {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,724 INFO L290 TraceCheckUtils]: 19: Hoare triple {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,725 INFO L290 TraceCheckUtils]: 20: Hoare triple {5075#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {5017#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:45:30,725 INFO L290 TraceCheckUtils]: 21: Hoare triple {5017#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} assume !(1 == #valid[append_#t~mem6#1.base]); {5010#false} is VALID [2022-02-20 23:45:30,726 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:30,726 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:30,980 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 38 treesize of output 34 [2022-02-20 23:45:31,666 INFO L356 Elim1Store]: treesize reduction 10, result has 60.0 percent of original size [2022-02-20 23:45:31,666 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 66 treesize of output 72 [2022-02-20 23:45:31,824 INFO L290 TraceCheckUtils]: 21: Hoare triple {5017#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} assume !(1 == #valid[append_#t~mem6#1.base]); {5010#false} is VALID [2022-02-20 23:45:31,825 INFO L290 TraceCheckUtils]: 20: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {5017#(= (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|) 1)} is VALID [2022-02-20 23:45:31,826 INFO L290 TraceCheckUtils]: 19: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:31,826 INFO L290 TraceCheckUtils]: 18: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:31,826 INFO L290 TraceCheckUtils]: 17: Hoare triple {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:31,827 INFO L290 TraceCheckUtils]: 16: Hoare triple {5106#(= (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|) 1)} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {5016#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) 1)} is VALID [2022-02-20 23:45:31,827 INFO L290 TraceCheckUtils]: 15: Hoare triple {5110#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) 1)} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {5106#(= (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|) 1)} is VALID [2022-02-20 23:45:31,829 INFO L290 TraceCheckUtils]: 14: Hoare triple {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5110#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) 1)} is VALID [2022-02-20 23:45:31,829 INFO L290 TraceCheckUtils]: 13: Hoare triple {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} assume !!(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} is VALID [2022-02-20 23:45:31,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} is VALID [2022-02-20 23:45:31,831 INFO L290 TraceCheckUtils]: 11: Hoare triple {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} assume { :end_inline_append } true; {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} is VALID [2022-02-20 23:45:31,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {5127#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (and (or (not (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))) (forall ((v_arrayElimCell_6 Int)) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) v_arrayElimCell_6) 1))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0)) (and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {5114#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0))))} is VALID [2022-02-20 23:45:31,833 INFO L290 TraceCheckUtils]: 9: Hoare triple {5127#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (and (or (not (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))) (forall ((v_arrayElimCell_6 Int)) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) v_arrayElimCell_6) 1))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0)) (and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5127#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (and (or (not (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))) (forall ((v_arrayElimCell_6 Int)) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) v_arrayElimCell_6) 1))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0)) (and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))))} is VALID [2022-02-20 23:45:31,837 INFO L290 TraceCheckUtils]: 8: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {5127#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_16| Int) (v_ArrVal_238 Int)) (or (and (or (not (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))) (forall ((v_arrayElimCell_6 Int)) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) v_arrayElimCell_6) 1))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16|) 0)) (and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= (select (store |#valid| |v_ULTIMATE.start_append_~item~0#1.base_16| v_ArrVal_238) |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))))} is VALID [2022-02-20 23:45:31,837 INFO L290 TraceCheckUtils]: 7: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:31,838 INFO L290 TraceCheckUtils]: 6: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:31,838 INFO L290 TraceCheckUtils]: 5: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:31,839 INFO L290 TraceCheckUtils]: 4: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:31,839 INFO L290 TraceCheckUtils]: 3: Hoare triple {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:31,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {5009#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5011#(and (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:31,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {5009#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {5009#true} is VALID [2022-02-20 23:45:31,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {5009#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(14, 2); {5009#true} is VALID [2022-02-20 23:45:31,840 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:31,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2127097646] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:31,841 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:45:31,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 19 [2022-02-20 23:45:31,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1738574338] [2022-02-20 23:45:31,841 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:31,842 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:45:31,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:31,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:45:31,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 51 edges. 51 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:31,885 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2022-02-20 23:45:31,885 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:31,885 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2022-02-20 23:45:31,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=323, Unknown=0, NotChecked=0, Total=380 [2022-02-20 23:45:31,885 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:45:32,997 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:32,998 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2022-02-20 23:45:32,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:45:32,998 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:45:32,998 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:32,998 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:45:33,005 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 262 transitions. [2022-02-20 23:45:33,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:45:33,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 262 transitions. [2022-02-20 23:45:33,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 262 transitions. [2022-02-20 23:45:33,182 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 262 edges. 262 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:33,184 INFO L225 Difference]: With dead ends: 252 [2022-02-20 23:45:33,185 INFO L226 Difference]: Without dead ends: 252 [2022-02-20 23:45:33,185 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 148 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=158, Invalid=598, Unknown=0, NotChecked=0, Total=756 [2022-02-20 23:45:33,185 INFO L933 BasicCegarLoop]: 61 mSDtfsCounter, 349 mSDsluCounter, 533 mSDsCounter, 0 mSdLazyCounter, 470 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 349 SdHoareTripleChecker+Valid, 594 SdHoareTripleChecker+Invalid, 770 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 470 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 281 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:33,185 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [349 Valid, 594 Invalid, 770 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 470 Invalid, 0 Unknown, 281 Unchecked, 0.3s Time] [2022-02-20 23:45:33,186 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 252 states. [2022-02-20 23:45:33,187 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 252 to 109. [2022-02-20 23:45:33,187 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:33,187 INFO L82 GeneralOperation]: Start isEquivalent. First operand 252 states. Second operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:33,187 INFO L74 IsIncluded]: Start isIncluded. First operand 252 states. Second operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:33,187 INFO L87 Difference]: Start difference. First operand 252 states. Second operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:33,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,191 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2022-02-20 23:45:33,191 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2022-02-20 23:45:33,191 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:33,191 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:33,191 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 252 states. [2022-02-20 23:45:33,191 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 252 states. [2022-02-20 23:45:33,198 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,198 INFO L93 Difference]: Finished difference Result 252 states and 267 transitions. [2022-02-20 23:45:33,198 INFO L276 IsEmpty]: Start isEmpty. Operand 252 states and 267 transitions. [2022-02-20 23:45:33,199 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:33,199 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:33,199 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:33,199 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:33,199 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4683544303797469) internal successors, (116), 108 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:33,200 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 116 transitions. [2022-02-20 23:45:33,200 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 116 transitions. Word has length 22 [2022-02-20 23:45:33,200 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:33,201 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 116 transitions. [2022-02-20 23:45:33,201 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.6842105263157894) internal successors, (51), 20 states have internal predecessors, (51), 0 states have call successors, (0), 0 states 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:45:33,201 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 116 transitions. [2022-02-20 23:45:33,201 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:33,201 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:33,201 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:33,223 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2022-02-20 23:45:33,418 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2022-02-20 23:45:33,418 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:33,419 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:33,419 INFO L85 PathProgramCache]: Analyzing trace with hash -428723025, now seen corresponding path program 1 times [2022-02-20 23:45:33,419 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:33,419 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1941571615] [2022-02-20 23:45:33,419 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:33,419 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:33,460 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,567 INFO L290 TraceCheckUtils]: 0: Hoare triple {6040#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(14, 2); {6040#true} is VALID [2022-02-20 23:45:33,567 INFO L290 TraceCheckUtils]: 1: Hoare triple {6040#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {6040#true} is VALID [2022-02-20 23:45:33,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {6040#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,568 INFO L290 TraceCheckUtils]: 3: Hoare triple {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,568 INFO L290 TraceCheckUtils]: 4: Hoare triple {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,569 INFO L290 TraceCheckUtils]: 5: Hoare triple {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,569 INFO L290 TraceCheckUtils]: 6: Hoare triple {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,570 INFO L290 TraceCheckUtils]: 7: Hoare triple {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {6042#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {6043#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,571 INFO L290 TraceCheckUtils]: 9: Hoare triple {6043#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6043#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:33,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {6043#(and (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:33,572 INFO L290 TraceCheckUtils]: 11: Hoare triple {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :end_inline_append } true; {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:33,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:33,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume !!(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:33,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {6044#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6045#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))))} is VALID [2022-02-20 23:45:33,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {6045#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 0) (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {6046#(and (= |ULTIMATE.start_append_#t~mem4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_append_#t~mem4#1.base|)))} is VALID [2022-02-20 23:45:33,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {6046#(and (= |ULTIMATE.start_append_#t~mem4#1.offset| 0) (<= 8 (select |#length| |ULTIMATE.start_append_#t~mem4#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:45:33,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:45:33,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:45:33,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} is VALID [2022-02-20 23:45:33,577 INFO L290 TraceCheckUtils]: 20: Hoare triple {6047#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {6048#(and (<= 8 (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:45:33,577 INFO L290 TraceCheckUtils]: 21: Hoare triple {6048#(and (<= 8 (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} assume !(4 + (4 + append_#t~mem6#1.offset) <= #length[append_#t~mem6#1.base] && 0 <= 4 + append_#t~mem6#1.offset); {6041#false} is VALID [2022-02-20 23:45:33,577 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:33,578 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:33,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1941571615] [2022-02-20 23:45:33,578 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1941571615] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:33,578 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1560645123] [2022-02-20 23:45:33,578 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:33,578 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:33,578 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:33,579 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:33,579 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:45:33,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,662 INFO L263 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 55 conjunts are in the unsatisfiable core [2022-02-20 23:45:33,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,681 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:33,869 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 11 treesize of output 7 [2022-02-20 23:45:33,878 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 11 treesize of output 7 [2022-02-20 23:45:33,966 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:45:33,967 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 23:45:33,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:45:34,103 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:34,103 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 23:45:34,118 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:34,118 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-02-20 23:45:34,426 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:45:34,426 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-02-20 23:45:34,463 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:45:34,463 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 22 treesize of output 10 [2022-02-20 23:45:34,474 INFO L290 TraceCheckUtils]: 0: Hoare triple {6040#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(14, 2); {6040#true} is VALID [2022-02-20 23:45:34,475 INFO L290 TraceCheckUtils]: 1: Hoare triple {6040#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {6055#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:34,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {6055#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,477 INFO L290 TraceCheckUtils]: 4: Hoare triple {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,477 INFO L290 TraceCheckUtils]: 5: Hoare triple {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,478 INFO L290 TraceCheckUtils]: 6: Hoare triple {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,478 INFO L290 TraceCheckUtils]: 7: Hoare triple {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,487 INFO L290 TraceCheckUtils]: 8: Hoare triple {6059#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {6078#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,488 INFO L290 TraceCheckUtils]: 9: Hoare triple {6078#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6078#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:34,488 INFO L290 TraceCheckUtils]: 10: Hoare triple {6078#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:34,489 INFO L290 TraceCheckUtils]: 11: Hoare triple {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :end_inline_append } true; {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:34,489 INFO L290 TraceCheckUtils]: 12: Hoare triple {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:34,490 INFO L290 TraceCheckUtils]: 13: Hoare triple {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume !!(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:34,491 INFO L290 TraceCheckUtils]: 14: Hoare triple {6085#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6098#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| 0))} is VALID [2022-02-20 23:45:34,494 INFO L290 TraceCheckUtils]: 15: Hoare triple {6098#(and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| 0))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {6102#(exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_#t~mem4#1.base|) (= |ULTIMATE.start_append_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0))))} is VALID [2022-02-20 23:45:34,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {6102#(exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_#t~mem4#1.base|) (= |ULTIMATE.start_append_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0))))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} is VALID [2022-02-20 23:45:34,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} is VALID [2022-02-20 23:45:34,498 INFO L290 TraceCheckUtils]: 18: Hoare triple {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} is VALID [2022-02-20 23:45:34,501 INFO L290 TraceCheckUtils]: 19: Hoare triple {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} is VALID [2022-02-20 23:45:34,502 INFO L290 TraceCheckUtils]: 20: Hoare triple {6106#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 0) (exists ((|ULTIMATE.start_append_~plist#1.base| Int)) (and (<= 8 (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) 0) 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) 0) |ULTIMATE.start_append_~item~0#1.base|)))))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {6048#(and (<= 8 (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} is VALID [2022-02-20 23:45:34,502 INFO L290 TraceCheckUtils]: 21: Hoare triple {6048#(and (<= 8 (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)) (= |ULTIMATE.start_append_#t~mem6#1.offset| 0))} assume !(4 + (4 + append_#t~mem6#1.offset) <= #length[append_#t~mem6#1.base] && 0 <= 4 + append_#t~mem6#1.offset); {6041#false} is VALID [2022-02-20 23:45:34,503 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:34,503 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:34,956 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 84 treesize of output 80 [2022-02-20 23:45:34,970 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 135 treesize of output 123 [2022-02-20 23:45:35,209 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:45:35,212 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 28 treesize of output 24 [2022-02-20 23:45:35,307 INFO L290 TraceCheckUtils]: 21: Hoare triple {6122#(and (<= 0 (+ |ULTIMATE.start_append_#t~mem6#1.offset| 4)) (<= (+ |ULTIMATE.start_append_#t~mem6#1.offset| 8) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)))} assume !(4 + (4 + append_#t~mem6#1.offset) <= #length[append_#t~mem6#1.base] && 0 <= 4 + append_#t~mem6#1.offset); {6041#false} is VALID [2022-02-20 23:45:35,307 INFO L290 TraceCheckUtils]: 20: Hoare triple {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L533 {6122#(and (<= 0 (+ |ULTIMATE.start_append_#t~mem6#1.offset| 4)) (<= (+ |ULTIMATE.start_append_#t~mem6#1.offset| 8) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)))} is VALID [2022-02-20 23:45:35,308 INFO L290 TraceCheckUtils]: 19: Hoare triple {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} assume append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0; {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:45:35,309 INFO L290 TraceCheckUtils]: 18: Hoare triple {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:45:35,309 INFO L290 TraceCheckUtils]: 17: Hoare triple {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:45:35,310 INFO L290 TraceCheckUtils]: 16: Hoare triple {6139#(and (<= (+ |ULTIMATE.start_append_#t~mem4#1.offset| 8) (select |#length| |ULTIMATE.start_append_#t~mem4#1.base|)) (<= 0 (+ |ULTIMATE.start_append_#t~mem4#1.offset| 4)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {6126#(and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) 4)) (<= (+ 8 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:45:35,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {6143#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 4)))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {6139#(and (<= (+ |ULTIMATE.start_append_#t~mem4#1.offset| 8) (select |#length| |ULTIMATE.start_append_#t~mem4#1.base|)) (<= 0 (+ |ULTIMATE.start_append_#t~mem4#1.offset| 4)))} is VALID [2022-02-20 23:45:35,312 INFO L290 TraceCheckUtils]: 14: Hoare triple {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6143#(and (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 8) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) 4)))} is VALID [2022-02-20 23:45:35,313 INFO L290 TraceCheckUtils]: 13: Hoare triple {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} assume !!(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} is VALID [2022-02-20 23:45:35,314 INFO L290 TraceCheckUtils]: 12: Hoare triple {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} is VALID [2022-02-20 23:45:35,315 INFO L290 TraceCheckUtils]: 11: Hoare triple {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} assume { :end_inline_append } true; {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} is VALID [2022-02-20 23:45:35,316 INFO L290 TraceCheckUtils]: 10: Hoare triple {6160#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_309 Int)) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) |ULTIMATE.start_append_~item~0#1.base|))) (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|)) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0))))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {6147#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0)) (and (<= 0 (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 4)) (forall ((v_ArrVal_309 Int)) (<= (+ (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))))))} is VALID [2022-02-20 23:45:35,317 INFO L290 TraceCheckUtils]: 9: Hoare triple {6160#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_309 Int)) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) |ULTIMATE.start_append_~item~0#1.base|))) (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|)) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0))))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6160#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_309 Int)) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) |ULTIMATE.start_append_~item~0#1.base|))) (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|)) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0))))} is VALID [2022-02-20 23:45:35,318 INFO L290 TraceCheckUtils]: 8: Hoare triple {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {6160#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| Int)) (or (and (forall ((v_ArrVal_309 Int)) (<= (+ |ULTIMATE.start_append_~item~0#1.offset| 8) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_309) |ULTIMATE.start_append_~item~0#1.base|))) (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|)) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) 0))))} is VALID [2022-02-20 23:45:35,318 INFO L290 TraceCheckUtils]: 7: Hoare triple {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:35,319 INFO L290 TraceCheckUtils]: 6: Hoare triple {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:35,319 INFO L290 TraceCheckUtils]: 5: Hoare triple {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:35,320 INFO L290 TraceCheckUtils]: 4: Hoare triple {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:35,320 INFO L290 TraceCheckUtils]: 3: Hoare triple {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:35,321 INFO L290 TraceCheckUtils]: 2: Hoare triple {6040#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6167#(and (<= 0 (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:35,321 INFO L290 TraceCheckUtils]: 1: Hoare triple {6040#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {6040#true} is VALID [2022-02-20 23:45:35,321 INFO L290 TraceCheckUtils]: 0: Hoare triple {6040#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(14, 2); {6040#true} is VALID [2022-02-20 23:45:35,321 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:35,322 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1560645123] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:35,322 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:45:35,322 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9, 8] total 22 [2022-02-20 23:45:35,322 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475173975] [2022-02-20 23:45:35,322 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:35,322 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:45:35,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:35,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:45:35,376 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 62 edges. 62 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:35,377 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2022-02-20 23:45:35,377 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:35,377 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2022-02-20 23:45:35,377 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=436, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:45:35,377 INFO L87 Difference]: Start difference. First operand 109 states and 116 transitions. Second operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:45:36,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,854 INFO L93 Difference]: Finished difference Result 236 states and 250 transitions. [2022-02-20 23:45:36,854 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2022-02-20 23:45:36,855 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:45:36,855 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:36,855 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:45:36,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 245 transitions. [2022-02-20 23:45:36,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:45:36,857 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 245 transitions. [2022-02-20 23:45:36,857 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 20 states and 245 transitions. [2022-02-20 23:45:37,037 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 245 edges. 245 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:37,040 INFO L225 Difference]: With dead ends: 236 [2022-02-20 23:45:37,040 INFO L226 Difference]: Without dead ends: 236 [2022-02-20 23:45:37,040 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=222, Invalid=900, Unknown=0, NotChecked=0, Total=1122 [2022-02-20 23:45:37,041 INFO L933 BasicCegarLoop]: 52 mSDtfsCounter, 547 mSDsluCounter, 640 mSDsCounter, 0 mSdLazyCounter, 462 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 547 SdHoareTripleChecker+Valid, 692 SdHoareTripleChecker+Invalid, 836 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 462 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 338 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:37,041 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [547 Valid, 692 Invalid, 836 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 462 Invalid, 0 Unknown, 338 Unchecked, 0.4s Time] [2022-02-20 23:45:37,042 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 236 states. [2022-02-20 23:45:37,043 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 236 to 109. [2022-02-20 23:45:37,043 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:37,043 INFO L82 GeneralOperation]: Start isEquivalent. First operand 236 states. Second operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:37,044 INFO L74 IsIncluded]: Start isIncluded. First operand 236 states. Second operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:37,044 INFO L87 Difference]: Start difference. First operand 236 states. Second operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:37,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,046 INFO L93 Difference]: Finished difference Result 236 states and 250 transitions. [2022-02-20 23:45:37,046 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 250 transitions. [2022-02-20 23:45:37,047 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:37,047 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:37,047 INFO L74 IsIncluded]: Start isIncluded. First operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 236 states. [2022-02-20 23:45:37,047 INFO L87 Difference]: Start difference. First operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 236 states. [2022-02-20 23:45:37,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,050 INFO L93 Difference]: Finished difference Result 236 states and 250 transitions. [2022-02-20 23:45:37,050 INFO L276 IsEmpty]: Start isEmpty. Operand 236 states and 250 transitions. [2022-02-20 23:45:37,050 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:37,050 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:37,050 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:37,050 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:37,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 79 states have (on average 1.4556962025316456) internal successors, (115), 108 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:37,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 115 transitions. [2022-02-20 23:45:37,052 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 115 transitions. Word has length 22 [2022-02-20 23:45:37,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:37,052 INFO L470 AbstractCegarLoop]: Abstraction has 109 states and 115 transitions. [2022-02-20 23:45:37,052 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.8181818181818183) internal successors, (62), 23 states have internal predecessors, (62), 0 states have call successors, (0), 0 states 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:45:37,052 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 115 transitions. [2022-02-20 23:45:37,053 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:45:37,053 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:37,053 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:45:37,083 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:37,268 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable12 [2022-02-20 23:45:37,268 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:37,269 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:37,269 INFO L85 PathProgramCache]: Analyzing trace with hash -1794872678, now seen corresponding path program 1 times [2022-02-20 23:45:37,269 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:37,269 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678828927] [2022-02-20 23:45:37,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:37,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:37,296 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:37,433 INFO L290 TraceCheckUtils]: 0: Hoare triple {7030#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(14, 2); {7030#true} is VALID [2022-02-20 23:45:37,434 INFO L290 TraceCheckUtils]: 1: Hoare triple {7030#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {7032#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:37,435 INFO L290 TraceCheckUtils]: 2: Hoare triple {7032#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,435 INFO L290 TraceCheckUtils]: 3: Hoare triple {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,436 INFO L290 TraceCheckUtils]: 4: Hoare triple {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,437 INFO L290 TraceCheckUtils]: 5: Hoare triple {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,438 INFO L290 TraceCheckUtils]: 7: Hoare triple {7033#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {7034#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (<= (+ |ULTIMATE.start_append_#t~ite9#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,439 INFO L290 TraceCheckUtils]: 8: Hoare triple {7034#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (<= (+ |ULTIMATE.start_append_#t~ite9#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {7035#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,439 INFO L290 TraceCheckUtils]: 9: Hoare triple {7035#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {7035#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:37,440 INFO L290 TraceCheckUtils]: 10: Hoare triple {7035#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,440 INFO L290 TraceCheckUtils]: 11: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,441 INFO L290 TraceCheckUtils]: 12: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,441 INFO L290 TraceCheckUtils]: 13: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,442 INFO L290 TraceCheckUtils]: 14: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,442 INFO L290 TraceCheckUtils]: 15: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,443 INFO L290 TraceCheckUtils]: 16: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {7037#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem12#1.base|) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,443 INFO L290 TraceCheckUtils]: 17: Hoare triple {7037#(and (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem12#1.base|) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,443 INFO L290 TraceCheckUtils]: 18: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:37,444 INFO L290 TraceCheckUtils]: 19: Hoare triple {7036#(and (<= (+ (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4) 1) |#StackHeapBarrier|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {7038#(and (= (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|) 4) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) 1) |#StackHeapBarrier|))} is VALID [2022-02-20 23:45:37,444 INFO L290 TraceCheckUtils]: 20: Hoare triple {7038#(and (= (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|) 4) (<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|)) 1) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {7039#(<= (+ |ULTIMATE.start_main_#t~mem15#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:37,445 INFO L290 TraceCheckUtils]: 21: Hoare triple {7039#(<= (+ |ULTIMATE.start_main_#t~mem15#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem15#1.offset; {7039#(<= (+ |ULTIMATE.start_main_#t~mem15#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:37,450 INFO L290 TraceCheckUtils]: 22: Hoare triple {7039#(<= (+ |ULTIMATE.start_main_#t~mem15#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem15#1.base < #StackHeapBarrier); {7031#false} is VALID [2022-02-20 23:45:37,450 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:45:37,450 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:37,450 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678828927] [2022-02-20 23:45:37,450 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678828927] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:37,450 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:37,450 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:37,450 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [742689164] [2022-02-20 23:45:37,451 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:37,451 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:45:37,451 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:37,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:37,469 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:37,469 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:37,469 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:37,469 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:37,469 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:37,470 INFO L87 Difference]: Start difference. First operand 109 states and 115 transitions. Second operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,550 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 23:45:38,550 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2022-02-20 23:45:38,550 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 23 [2022-02-20 23:45:38,550 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:38,550 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 169 transitions. [2022-02-20 23:45:38,551 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 169 transitions. [2022-02-20 23:45:38,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 18 states and 169 transitions. [2022-02-20 23:45:38,685 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 169 edges. 169 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:38,694 INFO L225 Difference]: With dead ends: 166 [2022-02-20 23:45:38,694 INFO L226 Difference]: Without dead ends: 166 [2022-02-20 23:45:38,694 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 22 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 21 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 71 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=135, Invalid=371, Unknown=0, NotChecked=0, Total=506 [2022-02-20 23:45:38,695 INFO L933 BasicCegarLoop]: 32 mSDtfsCounter, 344 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 441 mSolverCounterSat, 39 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 344 SdHoareTripleChecker+Valid, 199 SdHoareTripleChecker+Invalid, 480 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 39 IncrementalHoareTripleChecker+Valid, 441 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:38,695 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [344 Valid, 199 Invalid, 480 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [39 Valid, 441 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:38,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2022-02-20 23:45:38,696 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 110. [2022-02-20 23:45:38,696 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:38,697 INFO L82 GeneralOperation]: Start isEquivalent. First operand 166 states. Second operand has 110 states, 80 states have (on average 1.45) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:38,697 INFO L74 IsIncluded]: Start isIncluded. First operand 166 states. Second operand has 110 states, 80 states have (on average 1.45) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:38,697 INFO L87 Difference]: Start difference. First operand 166 states. Second operand has 110 states, 80 states have (on average 1.45) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:38,698 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,698 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 23:45:38,699 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 23:45:38,699 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:38,699 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:38,699 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 80 states have (on average 1.45) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 166 states. [2022-02-20 23:45:38,699 INFO L87 Difference]: Start difference. First operand has 110 states, 80 states have (on average 1.45) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 166 states. [2022-02-20 23:45:38,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,701 INFO L93 Difference]: Finished difference Result 166 states and 173 transitions. [2022-02-20 23:45:38,701 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 173 transitions. [2022-02-20 23:45:38,701 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:38,701 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:38,701 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:38,701 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:38,701 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 80 states have (on average 1.45) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:38,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-02-20 23:45:38,702 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 23 [2022-02-20 23:45:38,702 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:38,702 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-02-20 23:45:38,702 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.5555555555555554) internal successors, (23), 10 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,702 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-02-20 23:45:38,703 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:45:38,703 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:38,703 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:38,703 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:45:38,703 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr26ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:38,703 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:38,703 INFO L85 PathProgramCache]: Analyzing trace with hash 193521933, now seen corresponding path program 1 times [2022-02-20 23:45:38,703 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:38,703 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949217876] [2022-02-20 23:45:38,703 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,703 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:38,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,825 INFO L290 TraceCheckUtils]: 0: Hoare triple {7676#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(14, 2); {7676#true} is VALID [2022-02-20 23:45:38,826 INFO L290 TraceCheckUtils]: 1: Hoare triple {7676#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {7678#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:38,827 INFO L290 TraceCheckUtils]: 2: Hoare triple {7678#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,828 INFO L290 TraceCheckUtils]: 3: Hoare triple {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,829 INFO L290 TraceCheckUtils]: 4: Hoare triple {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,829 INFO L290 TraceCheckUtils]: 5: Hoare triple {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,829 INFO L290 TraceCheckUtils]: 6: Hoare triple {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,830 INFO L290 TraceCheckUtils]: 7: Hoare triple {7679#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {7680#(and (= (select |#valid| |ULTIMATE.start_append_#t~ite9#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {7680#(and (= (select |#valid| |ULTIMATE.start_append_#t~ite9#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {7681#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4))) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {7681#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4))) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {7681#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4))) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:38,832 INFO L290 TraceCheckUtils]: 10: Hoare triple {7681#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4))) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (not (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,832 INFO L290 TraceCheckUtils]: 11: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume { :end_inline_append } true; {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,833 INFO L290 TraceCheckUtils]: 12: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,833 INFO L290 TraceCheckUtils]: 13: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,834 INFO L290 TraceCheckUtils]: 14: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {7683#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem12#1.base|) 4)) 1))} is VALID [2022-02-20 23:45:38,836 INFO L290 TraceCheckUtils]: 17: Hoare triple {7683#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem12#1.base|) 4)) 1))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} is VALID [2022-02-20 23:45:38,837 INFO L290 TraceCheckUtils]: 19: Hoare triple {7682#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)) 1) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {7684#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|))) 1) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} is VALID [2022-02-20 23:45:38,837 INFO L290 TraceCheckUtils]: 20: Hoare triple {7684#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|))) 1) (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {7685#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:45:38,837 INFO L290 TraceCheckUtils]: 21: Hoare triple {7685#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume 0 == main_#t~mem15#1.offset; {7685#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:45:38,838 INFO L290 TraceCheckUtils]: 22: Hoare triple {7685#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume main_#t~mem15#1.base < #StackHeapBarrier; {7685#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} is VALID [2022-02-20 23:45:38,838 INFO L290 TraceCheckUtils]: 23: Hoare triple {7685#(= (select |#valid| |ULTIMATE.start_main_#t~mem15#1.base|) 1)} assume !(0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base]); {7677#false} is VALID [2022-02-20 23:45:38,838 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:45:38,838 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:38,838 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949217876] [2022-02-20 23:45:38,838 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949217876] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:38,838 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:38,838 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:38,838 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1122262331] [2022-02-20 23:45:38,838 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:38,839 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:45:38,839 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:38,839 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:38,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:38,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:38,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:38,857 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:38,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=70, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:38,857 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,674 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-02-20 23:45:39,674 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2022-02-20 23:45:39,675 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 23:45:39,675 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:39,675 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,675 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-02-20 23:45:39,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,676 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 118 transitions. [2022-02-20 23:45:39,676 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 15 states and 118 transitions. [2022-02-20 23:45:39,779 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,780 INFO L225 Difference]: With dead ends: 117 [2022-02-20 23:45:39,780 INFO L226 Difference]: Without dead ends: 117 [2022-02-20 23:45:39,780 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 44 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=118, Invalid=302, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:45:39,780 INFO L933 BasicCegarLoop]: 38 mSDtfsCounter, 190 mSDsluCounter, 183 mSDsCounter, 0 mSdLazyCounter, 362 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 190 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 382 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 362 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:39,780 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [190 Valid, 221 Invalid, 382 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 362 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:39,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 117 states. [2022-02-20 23:45:39,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 117 to 111. [2022-02-20 23:45:39,782 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:39,782 INFO L82 GeneralOperation]: Start isEquivalent. First operand 117 states. Second operand has 111 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:45:39,782 INFO L74 IsIncluded]: Start isIncluded. First operand 117 states. Second operand has 111 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:45:39,782 INFO L87 Difference]: Start difference. First operand 117 states. Second operand has 111 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:45:39,783 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,783 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-02-20 23:45:39,783 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-02-20 23:45:39,783 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,783 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,783 INFO L74 IsIncluded]: Start isIncluded. First operand has 111 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states. [2022-02-20 23:45:39,784 INFO L87 Difference]: Start difference. First operand has 111 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 117 states. [2022-02-20 23:45:39,785 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,786 INFO L93 Difference]: Finished difference Result 117 states and 122 transitions. [2022-02-20 23:45:39,786 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 122 transitions. [2022-02-20 23:45:39,786 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,786 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,786 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:39,786 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:39,786 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 81 states have (on average 1.4444444444444444) internal successors, (117), 110 states have internal predecessors, (117), 0 states have call successors, (0), 0 states 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:45:39,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 117 transitions. [2022-02-20 23:45:39,787 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 117 transitions. Word has length 24 [2022-02-20 23:45:39,788 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:39,788 INFO L470 AbstractCegarLoop]: Abstraction has 111 states and 117 transitions. [2022-02-20 23:45:39,788 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 2.6666666666666665) internal successors, (24), 10 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,788 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 117 transitions. [2022-02-20 23:45:39,789 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:39,789 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:39,789 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:39,789 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:45:39,790 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:39,791 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:39,791 INFO L85 PathProgramCache]: Analyzing trace with hash 1704212733, now seen corresponding path program 1 times [2022-02-20 23:45:39,791 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:39,791 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [68186049] [2022-02-20 23:45:39,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,792 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:39,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:39,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {8172#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(14, 2); {8172#true} is VALID [2022-02-20 23:45:39,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {8172#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {8174#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|)} is VALID [2022-02-20 23:45:39,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {8174#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,898 INFO L290 TraceCheckUtils]: 3: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,898 INFO L290 TraceCheckUtils]: 4: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,899 INFO L290 TraceCheckUtils]: 6: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,899 INFO L290 TraceCheckUtils]: 7: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,900 INFO L290 TraceCheckUtils]: 8: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,900 INFO L290 TraceCheckUtils]: 9: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:39,901 INFO L290 TraceCheckUtils]: 10: Hoare triple {8175#(and (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,901 INFO L290 TraceCheckUtils]: 11: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} assume { :end_inline_append } true; {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,902 INFO L290 TraceCheckUtils]: 12: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,907 INFO L290 TraceCheckUtils]: 14: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,908 INFO L290 TraceCheckUtils]: 16: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,908 INFO L290 TraceCheckUtils]: 17: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,908 INFO L290 TraceCheckUtils]: 18: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,909 INFO L290 TraceCheckUtils]: 19: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} is VALID [2022-02-20 23:45:39,910 INFO L290 TraceCheckUtils]: 20: Hoare triple {8176#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {8177#(and (or (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0))))} is VALID [2022-02-20 23:45:39,910 INFO L290 TraceCheckUtils]: 21: Hoare triple {8177#(and (or (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0))))} assume 0 == main_#t~mem15#1.offset; {8177#(and (or (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0))))} is VALID [2022-02-20 23:45:39,911 INFO L290 TraceCheckUtils]: 22: Hoare triple {8177#(and (or (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0)) (or (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#list~0#1.base|) (not (= (+ |ULTIMATE.start_main_~#list~0#1.base| (* (- 1) |ULTIMATE.start_main_#t~mem15#1.base|)) 0))))} assume main_#t~mem15#1.base < #StackHeapBarrier; {8178#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)))} is VALID [2022-02-20 23:45:39,911 INFO L290 TraceCheckUtils]: 23: Hoare triple {8178#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem15#1.base|)))} assume 0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base];call ULTIMATE.dealloc(main_#t~mem15#1.base, main_#t~mem15#1.offset);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {8179#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:39,912 INFO L290 TraceCheckUtils]: 24: Hoare triple {8179#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume !(1 == #valid[main_~#list~0#1.base]); {8173#false} is VALID [2022-02-20 23:45:39,912 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:45:39,912 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:39,912 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [68186049] [2022-02-20 23:45:39,912 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [68186049] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:39,912 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:39,912 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:39,913 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1899378812] [2022-02-20 23:45:39,913 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:39,914 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:45:39,914 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:39,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:39,931 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:45:39,931 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:39,931 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:39,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:39,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:39,932 INFO L87 Difference]: Start difference. First operand 111 states and 117 transitions. Second operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,203 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-02-20 23:45:40,203 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:40,203 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:45:40,203 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:40,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-02-20 23:45:40,204 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,204 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 86 transitions. [2022-02-20 23:45:40,204 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 86 transitions. [2022-02-20 23:45:40,260 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,261 INFO L225 Difference]: With dead ends: 111 [2022-02-20 23:45:40,261 INFO L226 Difference]: Without dead ends: 111 [2022-02-20 23:45:40,261 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=35, Invalid=55, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:40,261 INFO L933 BasicCegarLoop]: 29 mSDtfsCounter, 273 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 273 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:40,262 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [273 Valid, 56 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:40,262 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2022-02-20 23:45:40,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 110. [2022-02-20 23:45:40,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:40,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 111 states. Second operand has 110 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:40,264 INFO L74 IsIncluded]: Start isIncluded. First operand 111 states. Second operand has 110 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:40,264 INFO L87 Difference]: Start difference. First operand 111 states. Second operand has 110 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:40,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,265 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-02-20 23:45:40,265 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-02-20 23:45:40,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states. [2022-02-20 23:45:40,266 INFO L87 Difference]: Start difference. First operand has 110 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 111 states. [2022-02-20 23:45:40,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,267 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2022-02-20 23:45:40,267 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2022-02-20 23:45:40,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:40,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:40,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 81 states have (on average 1.4320987654320987) internal successors, (116), 109 states have internal predecessors, (116), 0 states have call successors, (0), 0 states 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:45:40,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 116 transitions. [2022-02-20 23:45:40,268 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 116 transitions. Word has length 25 [2022-02-20 23:45:40,269 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:40,269 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 116 transitions. [2022-02-20 23:45:40,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 8 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,269 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 116 transitions. [2022-02-20 23:45:40,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:40,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:40,269 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:40,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:45:40,270 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:40,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:40,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1704212734, now seen corresponding path program 1 times [2022-02-20 23:45:40,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:40,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338863574] [2022-02-20 23:45:40,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:40,270 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:40,287 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,306 INFO L290 TraceCheckUtils]: 0: Hoare triple {8629#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(14, 2); {8629#true} is VALID [2022-02-20 23:45:40,307 INFO L290 TraceCheckUtils]: 1: Hoare triple {8629#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,307 INFO L290 TraceCheckUtils]: 2: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,307 INFO L290 TraceCheckUtils]: 3: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,308 INFO L290 TraceCheckUtils]: 4: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,308 INFO L290 TraceCheckUtils]: 5: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,308 INFO L290 TraceCheckUtils]: 6: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,308 INFO L290 TraceCheckUtils]: 7: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,309 INFO L290 TraceCheckUtils]: 8: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,309 INFO L290 TraceCheckUtils]: 9: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,309 INFO L290 TraceCheckUtils]: 10: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,309 INFO L290 TraceCheckUtils]: 11: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume { :end_inline_append } true; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,310 INFO L290 TraceCheckUtils]: 12: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,310 INFO L290 TraceCheckUtils]: 13: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} is VALID [2022-02-20 23:45:40,310 INFO L290 TraceCheckUtils]: 14: Hoare triple {8631#(= |ULTIMATE.start_main_~#list~0#1.offset| 0)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,311 INFO L290 TraceCheckUtils]: 15: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,311 INFO L290 TraceCheckUtils]: 16: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,311 INFO L290 TraceCheckUtils]: 17: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,312 INFO L290 TraceCheckUtils]: 18: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,312 INFO L290 TraceCheckUtils]: 19: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,313 INFO L290 TraceCheckUtils]: 20: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,313 INFO L290 TraceCheckUtils]: 21: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume 0 == main_#t~mem15#1.offset; {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume main_#t~mem15#1.base < #StackHeapBarrier; {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,314 INFO L290 TraceCheckUtils]: 23: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume 0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base];call ULTIMATE.dealloc(main_#t~mem15#1.base, main_#t~mem15#1.offset);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:40,314 INFO L290 TraceCheckUtils]: 24: Hoare triple {8632#(and (= |ULTIMATE.start_main_~#list~0#1.offset| 0) (<= (+ |ULTIMATE.start_main_~#list~0#1.offset| 4) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume !(4 + main_~#list~0#1.offset <= #length[main_~#list~0#1.base] && 0 <= main_~#list~0#1.offset); {8630#false} is VALID [2022-02-20 23:45:40,314 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:45:40,314 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:40,315 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338863574] [2022-02-20 23:45:40,315 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338863574] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:40,315 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:40,315 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:40,315 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1050332956] [2022-02-20 23:45:40,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:40,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:45:40,316 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:40,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,330 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:45:40,330 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:40,330 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:40,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:40,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:40,331 INFO L87 Difference]: Start difference. First operand 110 states and 116 transitions. Second operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,416 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-02-20 23:45:40,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:40,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2022-02-20 23:45:40,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:40,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 23:45:40,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 82 transitions. [2022-02-20 23:45:40,418 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 82 transitions. [2022-02-20 23:45:40,480 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 82 edges. 82 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,481 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:45:40,481 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:45:40,481 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:40,482 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 118 mSDsluCounter, 2 mSDsCounter, 0 mSdLazyCounter, 31 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 47 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 31 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:40,482 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [118 Valid, 47 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:40,482 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:45:40,483 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2022-02-20 23:45:40,483 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:40,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 103 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:40,483 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 103 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:40,483 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 103 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:40,484 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,484 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-02-20 23:45:40,484 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2022-02-20 23:45:40,485 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,485 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,485 INFO L74 IsIncluded]: Start isIncluded. First operand has 103 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states. [2022-02-20 23:45:40,485 INFO L87 Difference]: Start difference. First operand has 103 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states. [2022-02-20 23:45:40,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,486 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2022-02-20 23:45:40,486 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2022-02-20 23:45:40,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,487 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:40,487 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:40,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 81 states have (on average 1.3333333333333333) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states 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:45:40,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2022-02-20 23:45:40,488 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 25 [2022-02-20 23:45:40,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:40,488 INFO L470 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2022-02-20 23:45:40,488 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.333333333333334) internal successors, (25), 4 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,488 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2022-02-20 23:45:40,488 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:40,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:40,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:40,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:45:40,489 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:40,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:40,489 INFO L85 PathProgramCache]: Analyzing trace with hash 1290987217, now seen corresponding path program 1 times [2022-02-20 23:45:40,489 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:40,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [257642590] [2022-02-20 23:45:40,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:40,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:40,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,550 INFO L290 TraceCheckUtils]: 0: Hoare triple {9047#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(14, 2); {9047#true} is VALID [2022-02-20 23:45:40,551 INFO L290 TraceCheckUtils]: 1: Hoare triple {9047#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {9047#true} is VALID [2022-02-20 23:45:40,556 INFO L290 TraceCheckUtils]: 2: Hoare triple {9047#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,557 INFO L290 TraceCheckUtils]: 3: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,557 INFO L290 TraceCheckUtils]: 4: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,558 INFO L290 TraceCheckUtils]: 5: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,558 INFO L290 TraceCheckUtils]: 6: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,559 INFO L290 TraceCheckUtils]: 7: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,559 INFO L290 TraceCheckUtils]: 8: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,560 INFO L290 TraceCheckUtils]: 9: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,560 INFO L290 TraceCheckUtils]: 10: Hoare triple {9049#(and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume { :end_inline_append } true; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,561 INFO L290 TraceCheckUtils]: 12: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,561 INFO L290 TraceCheckUtils]: 13: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,561 INFO L290 TraceCheckUtils]: 14: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,562 INFO L290 TraceCheckUtils]: 15: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,562 INFO L290 TraceCheckUtils]: 16: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,562 INFO L290 TraceCheckUtils]: 17: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,562 INFO L290 TraceCheckUtils]: 18: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,563 INFO L290 TraceCheckUtils]: 19: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,563 INFO L290 TraceCheckUtils]: 20: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,563 INFO L290 TraceCheckUtils]: 21: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume 0 == main_#t~mem15#1.offset; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,563 INFO L290 TraceCheckUtils]: 22: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume main_#t~mem15#1.base < #StackHeapBarrier; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,564 INFO L290 TraceCheckUtils]: 23: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} assume 0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base];call ULTIMATE.dealloc(main_#t~mem15#1.base, main_#t~mem15#1.offset);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} is VALID [2022-02-20 23:45:40,564 INFO L290 TraceCheckUtils]: 24: Hoare triple {9050#(= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L546 {9051#(= |ULTIMATE.start_main_#t~mem16#1.offset| 0)} is VALID [2022-02-20 23:45:40,564 INFO L290 TraceCheckUtils]: 25: Hoare triple {9051#(= |ULTIMATE.start_main_#t~mem16#1.offset| 0)} assume !(0 == main_#t~mem16#1.offset); {9048#false} is VALID [2022-02-20 23:45:40,565 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:45:40,565 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:40,565 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [257642590] [2022-02-20 23:45:40,565 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [257642590] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:40,565 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:40,565 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:40,565 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1897584778] [2022-02-20 23:45:40,565 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:40,566 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:45:40,566 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:40,566 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,583 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,583 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:40,584 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:40,584 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:40,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:40,584 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,751 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,751 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-02-20 23:45:40,751 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:40,751 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2022-02-20 23:45:40,751 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:40,751 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 23:45:40,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,752 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 76 transitions. [2022-02-20 23:45:40,752 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 76 transitions. [2022-02-20 23:45:40,801 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 76 edges. 76 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,802 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:45:40,802 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:45:40,802 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:40,802 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 78 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 68 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 78 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 70 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 68 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:40,802 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [78 Valid, 127 Invalid, 70 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 68 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:40,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:45:40,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 23:45:40,804 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:40,804 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:40,804 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:40,804 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:40,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,805 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-02-20 23:45:40,805 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 23:45:40,806 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,806 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,806 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 102 states. [2022-02-20 23:45:40,806 INFO L87 Difference]: Start difference. First operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 102 states. [2022-02-20 23:45:40,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,807 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2022-02-20 23:45:40,807 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 23:45:40,807 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:40,808 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:40,808 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:40,808 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:40,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 81 states have (on average 1.3209876543209877) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:40,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2022-02-20 23:45:40,809 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 26 [2022-02-20 23:45:40,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:40,809 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2022-02-20 23:45:40,809 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,809 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2022-02-20 23:45:40,809 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:40,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:40,810 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:40,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:45:40,810 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:40,810 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:40,810 INFO L85 PathProgramCache]: Analyzing trace with hash 1365898173, now seen corresponding path program 1 times [2022-02-20 23:45:40,816 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:40,816 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [902211021] [2022-02-20 23:45:40,817 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:40,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:40,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {9466#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(14, 2); {9466#true} is VALID [2022-02-20 23:45:40,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {9466#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {9466#true} is VALID [2022-02-20 23:45:40,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {9466#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,865 INFO L290 TraceCheckUtils]: 4: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,865 INFO L290 TraceCheckUtils]: 5: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,866 INFO L290 TraceCheckUtils]: 6: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,866 INFO L290 TraceCheckUtils]: 7: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,867 INFO L290 TraceCheckUtils]: 8: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,867 INFO L290 TraceCheckUtils]: 9: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:40,868 INFO L290 TraceCheckUtils]: 10: Hoare triple {9468#(and (<= (+ |ULTIMATE.start_append_~item~0#1.base| 1) |#StackHeapBarrier|) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,868 INFO L290 TraceCheckUtils]: 11: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume { :end_inline_append } true; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,868 INFO L290 TraceCheckUtils]: 12: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,868 INFO L290 TraceCheckUtils]: 13: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,869 INFO L290 TraceCheckUtils]: 14: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,869 INFO L290 TraceCheckUtils]: 15: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,869 INFO L290 TraceCheckUtils]: 16: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,869 INFO L290 TraceCheckUtils]: 17: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,870 INFO L290 TraceCheckUtils]: 18: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,870 INFO L290 TraceCheckUtils]: 19: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,870 INFO L290 TraceCheckUtils]: 20: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,870 INFO L290 TraceCheckUtils]: 21: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem15#1.offset; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,871 INFO L290 TraceCheckUtils]: 22: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume main_#t~mem15#1.base < #StackHeapBarrier; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,872 INFO L290 TraceCheckUtils]: 23: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base];call ULTIMATE.dealloc(main_#t~mem15#1.base, main_#t~mem15#1.offset);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,872 INFO L290 TraceCheckUtils]: 24: Hoare triple {9469#(<= (+ (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 1) |#StackHeapBarrier|)} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L546 {9470#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,872 INFO L290 TraceCheckUtils]: 25: Hoare triple {9470#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} assume 0 == main_#t~mem16#1.offset; {9470#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} is VALID [2022-02-20 23:45:40,873 INFO L290 TraceCheckUtils]: 26: Hoare triple {9470#(<= (+ |ULTIMATE.start_main_#t~mem16#1.base| 1) |#StackHeapBarrier|)} assume !(main_#t~mem16#1.base < #StackHeapBarrier); {9467#false} is VALID [2022-02-20 23:45:40,873 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:45:40,873 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:40,873 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [902211021] [2022-02-20 23:45:40,873 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [902211021] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:40,873 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:40,874 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:40,874 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [952705768] [2022-02-20 23:45:40,874 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:40,874 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:45:40,874 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:40,874 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:40,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:40,891 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:40,891 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:40,891 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:40,892 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:40,892 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:41,095 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,095 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-02-20 23:45:41,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:41,095 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 23:45:41,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:41,095 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 23:45:41,096 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:41,096 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 77 transitions. [2022-02-20 23:45:41,096 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 77 transitions. [2022-02-20 23:45:41,152 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 77 edges. 77 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,153 INFO L225 Difference]: With dead ends: 101 [2022-02-20 23:45:41,153 INFO L226 Difference]: Without dead ends: 101 [2022-02-20 23:45:41,153 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:41,154 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 71 mSDsluCounter, 62 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 71 SdHoareTripleChecker+Valid, 103 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:41,154 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [71 Valid, 103 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:41,154 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2022-02-20 23:45:41,155 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2022-02-20 23:45:41,155 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:41,155 INFO L82 GeneralOperation]: Start isEquivalent. First operand 101 states. Second operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:41,155 INFO L74 IsIncluded]: Start isIncluded. First operand 101 states. Second operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:41,156 INFO L87 Difference]: Start difference. First operand 101 states. Second operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:41,156 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,156 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-02-20 23:45:41,156 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-02-20 23:45:41,157 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,157 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,157 INFO L74 IsIncluded]: Start isIncluded. First operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 101 states. [2022-02-20 23:45:41,157 INFO L87 Difference]: Start difference. First operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 101 states. [2022-02-20 23:45:41,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,158 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2022-02-20 23:45:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-02-20 23:45:41,159 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,159 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,159 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:41,159 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:41,159 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 81 states have (on average 1.308641975308642) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:41,160 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2022-02-20 23:45:41,160 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 27 [2022-02-20 23:45:41,160 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:41,160 INFO L470 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2022-02-20 23:45:41,160 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:41,160 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2022-02-20 23:45:41,161 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:41,161 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:41,161 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:41,161 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:45:41,161 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:41,161 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:41,162 INFO L85 PathProgramCache]: Analyzing trace with hash -606829485, now seen corresponding path program 1 times [2022-02-20 23:45:41,162 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:41,162 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [240553321] [2022-02-20 23:45:41,162 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:41,162 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:41,184 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,409 INFO L290 TraceCheckUtils]: 0: Hoare triple {9881#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(14, 2); {9881#true} is VALID [2022-02-20 23:45:41,409 INFO L290 TraceCheckUtils]: 1: Hoare triple {9881#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {9881#true} is VALID [2022-02-20 23:45:41,409 INFO L290 TraceCheckUtils]: 2: Hoare triple {9881#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {9883#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (= |ULTIMATE.start_append_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,410 INFO L290 TraceCheckUtils]: 3: Hoare triple {9883#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (= |ULTIMATE.start_append_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {9883#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (= |ULTIMATE.start_append_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,410 INFO L290 TraceCheckUtils]: 4: Hoare triple {9883#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (= |ULTIMATE.start_append_~item~0#1.offset| 0)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {9884#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,411 INFO L290 TraceCheckUtils]: 5: Hoare triple {9884#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {9884#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,411 INFO L290 TraceCheckUtils]: 6: Hoare triple {9884#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {9884#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,412 INFO L290 TraceCheckUtils]: 7: Hoare triple {9884#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {9885#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (not (= |ULTIMATE.start_append_#t~ite9#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,413 INFO L290 TraceCheckUtils]: 8: Hoare triple {9885#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (not (= |ULTIMATE.start_append_#t~ite9#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| 0))) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {9886#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) |ULTIMATE.start_append_~item~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,413 INFO L290 TraceCheckUtils]: 9: Hoare triple {9886#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) |ULTIMATE.start_append_~item~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {9886#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) |ULTIMATE.start_append_~item~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:41,414 INFO L290 TraceCheckUtils]: 10: Hoare triple {9886#(and (or (= |ULTIMATE.start_append_~plist#1.base| |ULTIMATE.start_append_~item~0#1.base|) (and (= |ULTIMATE.start_append_~item~0#1.offset| 0) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (+ |ULTIMATE.start_append_~item~0#1.offset| 4)) |ULTIMATE.start_append_~item~0#1.base|)))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) 1) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,414 INFO L290 TraceCheckUtils]: 11: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume { :end_inline_append } true; {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,415 INFO L290 TraceCheckUtils]: 12: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,415 INFO L290 TraceCheckUtils]: 13: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,416 INFO L290 TraceCheckUtils]: 14: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,416 INFO L290 TraceCheckUtils]: 15: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,418 INFO L290 TraceCheckUtils]: 16: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {9888#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem12#1.base|) 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|))))} is VALID [2022-02-20 23:45:41,419 INFO L290 TraceCheckUtils]: 17: Hoare triple {9888#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1) (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem12#1.base|) 4))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem12#1.base|))))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,420 INFO L290 TraceCheckUtils]: 18: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,422 INFO L290 TraceCheckUtils]: 19: Hoare triple {9887#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 4)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {9889#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (or (not (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|))))) (or (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,423 INFO L290 TraceCheckUtils]: 20: Hoare triple {9889#(and (or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (or (not (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_#t~mem14#1.base|) (+ 4 |ULTIMATE.start_main_#t~mem14#1.offset|))))) (or (= 0 |ULTIMATE.start_main_#t~mem14#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_#t~mem14#1.offset|)))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {9890#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} is VALID [2022-02-20 23:45:41,423 INFO L290 TraceCheckUtils]: 21: Hoare triple {9890#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} assume 0 == main_#t~mem15#1.offset; {9890#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} is VALID [2022-02-20 23:45:41,424 INFO L290 TraceCheckUtils]: 22: Hoare triple {9890#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} assume main_#t~mem15#1.base < #StackHeapBarrier; {9890#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} is VALID [2022-02-20 23:45:41,424 INFO L290 TraceCheckUtils]: 23: Hoare triple {9890#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (and (not (= |ULTIMATE.start_main_#t~mem15#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)))} assume 0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base];call ULTIMATE.dealloc(main_#t~mem15#1.base, main_#t~mem15#1.offset);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {9891#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} is VALID [2022-02-20 23:45:41,425 INFO L290 TraceCheckUtils]: 24: Hoare triple {9891#(or (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) 0)) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) 1))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L546 {9892#(or (not (= |ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1))} is VALID [2022-02-20 23:45:41,425 INFO L290 TraceCheckUtils]: 25: Hoare triple {9892#(or (not (= |ULTIMATE.start_main_#t~mem16#1.offset| 0)) (= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1))} assume 0 == main_#t~mem16#1.offset; {9893#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} is VALID [2022-02-20 23:45:41,425 INFO L290 TraceCheckUtils]: 26: Hoare triple {9893#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} assume main_#t~mem16#1.base < #StackHeapBarrier; {9893#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} is VALID [2022-02-20 23:45:41,426 INFO L290 TraceCheckUtils]: 27: Hoare triple {9893#(= (select |#valid| |ULTIMATE.start_main_#t~mem16#1.base|) 1)} assume !(0 == main_#t~mem16#1.base || 1 == #valid[main_#t~mem16#1.base]); {9882#false} is VALID [2022-02-20 23:45:41,426 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:45:41,426 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:41,426 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [240553321] [2022-02-20 23:45:41,426 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [240553321] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:41,426 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:41,426 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2022-02-20 23:45:41,427 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1641801662] [2022-02-20 23:45:41,427 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:41,427 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:45:41,427 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:41,427 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:41,461 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,461 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:45:41,461 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:41,462 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:45:41,462 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=123, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:45:41,462 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,405 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,405 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:42,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2022-02-20 23:45:42,406 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2022-02-20 23:45:42,406 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,406 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 101 transitions. [2022-02-20 23:45:42,406 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,407 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 101 transitions. [2022-02-20 23:45:42,407 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 17 states and 101 transitions. [2022-02-20 23:45:42,495 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 101 edges. 101 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:42,496 INFO L225 Difference]: With dead ends: 105 [2022-02-20 23:45:42,496 INFO L226 Difference]: Without dead ends: 105 [2022-02-20 23:45:42,496 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 110 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=466, Unknown=0, NotChecked=0, Total=600 [2022-02-20 23:45:42,497 INFO L933 BasicCegarLoop]: 42 mSDtfsCounter, 184 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 329 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:42,497 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 247 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 329 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:42,497 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2022-02-20 23:45:42,499 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2022-02-20 23:45:42,499 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:42,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 105 states. Second operand has 105 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:42,499 INFO L74 IsIncluded]: Start isIncluded. First operand 105 states. Second operand has 105 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:42,499 INFO L87 Difference]: Start difference. First operand 105 states. Second operand has 105 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:42,500 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,500 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:42,500 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:42,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,500 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,500 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 105 states. [2022-02-20 23:45:42,501 INFO L87 Difference]: Start difference. First operand has 105 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 105 states. [2022-02-20 23:45:42,501 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,501 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2022-02-20 23:45:42,501 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:42,502 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,502 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,502 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:42,502 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:42,502 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 85 states have (on average 1.2941176470588236) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:42,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2022-02-20 23:45:42,503 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 28 [2022-02-20 23:45:42,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:42,503 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2022-02-20 23:45:42,503 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 13 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,503 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2022-02-20 23:45:42,503 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:45:42,503 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:42,503 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:42,503 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:45:42,503 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr32REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:42,503 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:42,504 INFO L85 PathProgramCache]: Analyzing trace with hash -1631844736, now seen corresponding path program 1 times [2022-02-20 23:45:42,504 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:42,504 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1171059944] [2022-02-20 23:45:42,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,504 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:42,522 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {10340#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(14, 2); {10340#true} is VALID [2022-02-20 23:45:42,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {10340#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4);call write~init~$Pointer$(0, 0, main_~#list~0#1.base, main_~#list~0#1.offset, 4); {10342#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:42,563 INFO L290 TraceCheckUtils]: 2: Hoare triple {10342#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,564 INFO L290 TraceCheckUtils]: 3: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L531 {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,564 INFO L290 TraceCheckUtils]: 4: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L531-1 {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,565 INFO L290 TraceCheckUtils]: 5: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,565 INFO L290 TraceCheckUtils]: 6: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4); srcloc: L532 {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,566 INFO L290 TraceCheckUtils]: 7: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} assume !(append_#t~mem5#1.base != 0 || append_#t~mem5#1.offset != 0);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,566 INFO L290 TraceCheckUtils]: 8: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, 4 + append_~item~0#1.offset, 4); srcloc: L532-3 {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} is VALID [2022-02-20 23:45:42,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {10343#(and (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~plist#1.offset| |ULTIMATE.start_main_~#list~0#1.offset|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4); srcloc: L535 {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,568 INFO L290 TraceCheckUtils]: 11: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :end_inline_append } true; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,568 INFO L290 TraceCheckUtils]: 12: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume -2147483648 <= main_#t~nondet10#1 && main_#t~nondet10#1 <= 2147483647; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,568 INFO L290 TraceCheckUtils]: 13: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !(0 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,569 INFO L290 TraceCheckUtils]: 14: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L540-5 {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,569 INFO L290 TraceCheckUtils]: 15: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume main_#t~mem11#1.base != 0 || main_#t~mem11#1.offset != 0;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,570 INFO L290 TraceCheckUtils]: 16: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L544 {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,570 INFO L290 TraceCheckUtils]: 17: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4); srcloc: L544-1 {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,570 INFO L290 TraceCheckUtils]: 18: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,571 INFO L290 TraceCheckUtils]: 19: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L545 {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,571 INFO L290 TraceCheckUtils]: 20: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, 4 + main_#t~mem14#1.offset, 4); srcloc: L545-1 {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,572 INFO L290 TraceCheckUtils]: 21: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume 0 == main_#t~mem15#1.offset; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,572 INFO L290 TraceCheckUtils]: 22: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume main_#t~mem15#1.base < #StackHeapBarrier; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,572 INFO L290 TraceCheckUtils]: 23: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume 0 == main_#t~mem15#1.base || 1 == #valid[main_#t~mem15#1.base];call ULTIMATE.dealloc(main_#t~mem15#1.base, main_#t~mem15#1.offset);havoc main_#t~mem14#1.base, main_#t~mem14#1.offset;havoc main_#t~mem15#1.base, main_#t~mem15#1.offset; {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:42,573 INFO L290 TraceCheckUtils]: 24: Hoare triple {10344#(not (= |ULTIMATE.start_main_~#list~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem16#1.base, main_#t~mem16#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4); srcloc: L546 {10345#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)))} is VALID [2022-02-20 23:45:42,573 INFO L290 TraceCheckUtils]: 25: Hoare triple {10345#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)))} assume 0 == main_#t~mem16#1.offset; {10345#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)))} is VALID [2022-02-20 23:45:42,574 INFO L290 TraceCheckUtils]: 26: Hoare triple {10345#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)))} assume main_#t~mem16#1.base < #StackHeapBarrier; {10345#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)))} is VALID [2022-02-20 23:45:42,574 INFO L290 TraceCheckUtils]: 27: Hoare triple {10345#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1) (not (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_main_#t~mem16#1.base|)))} assume 0 == main_#t~mem16#1.base || 1 == #valid[main_#t~mem16#1.base];call ULTIMATE.dealloc(main_#t~mem16#1.base, main_#t~mem16#1.offset);havoc main_#t~mem16#1.base, main_#t~mem16#1.offset; {10342#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} is VALID [2022-02-20 23:45:42,574 INFO L290 TraceCheckUtils]: 28: Hoare triple {10342#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) 1)} assume !(1 == #valid[main_~#list~0#1.base]); {10341#false} is VALID [2022-02-20 23:45:42,575 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:45:42,575 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:42,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1171059944] [2022-02-20 23:45:42,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1171059944] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:42,575 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:42,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:42,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [404444438] [2022-02-20 23:45:42,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:42,577 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:45:42,577 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:42,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,599 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:45:42,599 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:42,599 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:42,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:42,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:42,600 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,845 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,845 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-02-20 23:45:42,845 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:42,845 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2022-02-20 23:45:42,845 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:42,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-02-20 23:45:42,846 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,847 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 75 transitions. [2022-02-20 23:45:42,847 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 75 transitions. [2022-02-20 23:45:42,902 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:42,903 INFO L225 Difference]: With dead ends: 104 [2022-02-20 23:45:42,903 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 23:45:42,903 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=40, Invalid=70, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:42,904 INFO L933 BasicCegarLoop]: 34 mSDtfsCounter, 127 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 126 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:42,904 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [127 Valid, 83 Invalid, 126 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:42,904 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 23:45:42,905 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-20 23:45:42,905 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:42,905 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:45:42,905 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:45:42,905 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:45:42,907 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,907 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-02-20 23:45:42,907 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-02-20 23:45:42,907 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,907 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,907 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 23:45:42,908 INFO L87 Difference]: Start difference. First operand has 104 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 104 states. [2022-02-20 23:45:42,909 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,909 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2022-02-20 23:45:42,909 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-02-20 23:45:42,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:42,910 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:42,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 85 states have (on average 1.2823529411764707) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states 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:45:42,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2022-02-20 23:45:42,911 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 29 [2022-02-20 23:45:42,911 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:42,911 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2022-02-20 23:45:42,911 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.8) internal successors, (29), 6 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:42,911 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2022-02-20 23:45:42,912 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:45:42,912 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:42,912 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:42,912 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:45:42,912 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:42,912 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:42,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1014103750, now seen corresponding path program 1 times [2022-02-20 23:45:42,913 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:42,913 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1155413905] [2022-02-20 23:45:42,913 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:42,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,945 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:45:42,946 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.closeWeakPath(ArrayInterpolator.java:1402) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateWeakPathInfo(ArrayInterpolator.java:1070) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.buildRecursiveInterpolant(ArrayInterpolator.java:2229) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo.interpolateStorePathInfoExt(ArrayInterpolator.java:1206) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeWeakeqExtInterpolants(ArrayInterpolator.java:306) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator.computeInterpolants(ArrayInterpolator.java:197) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.walkLeafNode(Interpolator.java:326) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator$ProofTreeWalker.walk(Interpolator.java:145) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:115) at de.uni_freiburg.informatik.ultimate.logic.NonRecursive.run(NonRecursive.java:106) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.interpolate(Interpolator.java:250) at de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.Interpolator.getInterpolants(Interpolator.java:227) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:879) at de.uni_freiburg.informatik.ultimate.smtinterpol.smtlib2.SMTInterpol.getInterpolants(SMTInterpol.java:803) at de.uni_freiburg.informatik.ultimate.logic.NoopScript.getInterpolants(NoopScript.java:352) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.logic.WrapperScript.getInterpolants(WrapperScript.java:337) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.ManagedScript.getInterpolants(ManagedScript.java:192) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.computeCraigInterpolants(NestedInterpolantsBuilder.java:284) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.NestedInterpolantsBuilder.(NestedInterpolantsBuilder.java:165) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolantsRecursive(InterpolatingTraceCheckCraig.java:327) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.computeInterpolants(InterpolatingTraceCheckCraig.java:229) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.InterpolatingTraceCheckCraig.(InterpolatingTraceCheckCraig.java:97) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleCraig.construct(IpTcStrategyModuleCraig.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.isCorrect(IpTcStrategyModuleBase.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.checkFeasibility(AutomatonFreeRefinementEngine.java:216) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:129) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) 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:45:42,949 INFO L158 Benchmark]: Toolchain (without parser) took 20383.55ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 51.4MB in the beginning and 118.9MB in the end (delta: -67.5MB). Peak memory consumption was 13.2MB. Max. memory is 16.1GB. [2022-02-20 23:45:42,950 INFO L158 Benchmark]: CDTParser took 0.09ms. Allocated memory is still 88.1MB. Free memory was 68.8MB in the beginning and 68.7MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:45:42,950 INFO L158 Benchmark]: CACSL2BoogieTranslator took 274.50ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 56.1MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. [2022-02-20 23:45:42,950 INFO L158 Benchmark]: Boogie Procedure Inliner took 60.38ms. Allocated memory is still 88.1MB. Free memory was 56.1MB in the beginning and 53.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 23:45:42,950 INFO L158 Benchmark]: Boogie Preprocessor took 20.13ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 51.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 23:45:42,950 INFO L158 Benchmark]: RCFGBuilder took 630.90ms. Allocated memory is still 88.1MB. Free memory was 51.4MB in the beginning and 59.7MB in the end (delta: -8.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. [2022-02-20 23:45:42,950 INFO L158 Benchmark]: TraceAbstraction took 19392.43ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 59.3MB in the beginning and 118.9MB in the end (delta: -59.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. [2022-02-20 23:45:42,951 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.09ms. Allocated memory is still 88.1MB. Free memory was 68.8MB in the beginning and 68.7MB in the end (delta: 48.6kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 274.50ms. Allocated memory is still 88.1MB. Free memory was 51.2MB in the beginning and 56.1MB in the end (delta: -4.9MB). Peak memory consumption was 8.4MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 60.38ms. Allocated memory is still 88.1MB. Free memory was 56.1MB in the beginning and 53.5MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 20.13ms. Allocated memory is still 88.1MB. Free memory was 53.5MB in the beginning and 51.7MB in the end (delta: 1.8MB). There was no memory consumed. Max. memory is 16.1GB. * RCFGBuilder took 630.90ms. Allocated memory is still 88.1MB. Free memory was 51.4MB in the beginning and 59.7MB in the end (delta: -8.3MB). Peak memory consumption was 23.9MB. Max. memory is 16.1GB. * TraceAbstraction took 19392.43ms. Allocated memory was 88.1MB in the beginning and 167.8MB in the end (delta: 79.7MB). Free memory was 59.3MB in the beginning and 118.9MB in the end (delta: -59.6MB). Peak memory consumption was 21.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: null de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: null: de.uni_freiburg.informatik.ultimate.smtinterpol.interpolate.ArrayInterpolator$WeakPathInfo$WeakPathEnd.addInterpolantClausePathSeg(ArrayInterpolator.java:2041) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 23:45:42,975 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, 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/memsafety/test-0232-3.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:45:44,577 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:45:44,580 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:45:44,612 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:45:44,613 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:45:44,615 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:45:44,616 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:45:44,620 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:45:44,622 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:45:44,625 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:45:44,625 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:45:44,628 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:45:44,628 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:45:44,630 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:45:44,631 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:45:44,633 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:45:44,634 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:45:44,634 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:45:44,636 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:45:44,640 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:45:44,641 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:45:44,641 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:45:44,643 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:45:44,644 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:45:44,648 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:45:44,648 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:45:44,648 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:45:44,649 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:45:44,650 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:45:44,650 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:45:44,650 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:45:44,651 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:45:44,652 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:45:44,652 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:45:44,653 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:45:44,653 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:45:44,654 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:45:44,654 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:45:44,654 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:45:44,655 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:45:44,655 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:45:44,658 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2022-02-20 23:45:44,684 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:45:44,685 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:45:44,685 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:45:44,686 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:45:44,686 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:45:44,686 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:45:44,687 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:45:44,687 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:45:44,687 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:45:44,688 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:45:44,688 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:45:44,688 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:45:44,689 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:45:44,690 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 23:45:44,690 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 23:45:44,690 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:45:44,690 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:45:44,694 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:45:44,695 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:45:44,695 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:45:44,695 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:44,695 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:45:44,695 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:45:44,695 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 23:45:44,696 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 23:45:44,696 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 23:45:44,696 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-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 01db24b1589b54f78ea9acc56548e9023dc94ca9b67a9629bccf00110df292f7 [2022-02-20 23:45:44,947 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:44,964 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:44,966 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:44,966 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:44,967 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:44,968 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0232-3.i [2022-02-20 23:45:45,010 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99825b38/2ca2890a9cc24669af52e73d1e391c4e/FLAG683e2d508 [2022-02-20 23:45:45,431 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:45,432 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0232-3.i [2022-02-20 23:45:45,444 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99825b38/2ca2890a9cc24669af52e73d1e391c4e/FLAG683e2d508 [2022-02-20 23:45:45,456 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/d99825b38/2ca2890a9cc24669af52e73d1e391c4e [2022-02-20 23:45:45,458 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:45,459 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:45,461 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:45,462 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:45,464 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:45,465 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,465 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@32d20552 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45, skipping insertion in model container [2022-02-20 23:45:45,466 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,470 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:45,501 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:45,763 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:45,775 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:45,800 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:45,819 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:45,820 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45 WrapperNode [2022-02-20 23:45:45,820 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:45,821 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:45,821 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:45,821 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:45,825 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:45:45" (1/1) ... [2022-02-20 23:45:45,836 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:45:45" (1/1) ... [2022-02-20 23:45:45,853 INFO L137 Inliner]: procedures = 127, calls = 38, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 98 [2022-02-20 23:45:45,854 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:45,854 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:45,854 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:45,854 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:45,860 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,860 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,864 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,864 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,872 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,875 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,879 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,882 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:45,882 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:45,882 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:45,882 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:45,883 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (1/1) ... [2022-02-20 23:45:45,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:45,895 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:45,904 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:45:45,914 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:45:45,939 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 23:45:45,940 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:45,940 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:46,009 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:46,010 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:46,332 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:46,337 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:46,338 INFO L299 CfgBuilder]: Removed 2 assume(true) statements. [2022-02-20 23:45:46,339 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:46 BoogieIcfgContainer [2022-02-20 23:45:46,339 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:46,340 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:46,340 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:46,342 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:46,342 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:45" (1/3) ... [2022-02-20 23:45:46,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194d45ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:46, skipping insertion in model container [2022-02-20 23:45:46,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:45" (2/3) ... [2022-02-20 23:45:46,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@194d45ef and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:46, skipping insertion in model container [2022-02-20 23:45:46,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:46" (3/3) ... [2022-02-20 23:45:46,351 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0232-3.i [2022-02-20 23:45:46,355 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:46,355 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 55 error locations. [2022-02-20 23:45:46,380 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:46,384 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:45:46,384 INFO L340 AbstractCegarLoop]: Starting to check reachability of 55 error locations. [2022-02-20 23:45:46,396 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 50 states have (on average 2.24) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:45:46,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:46,399 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:46,399 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:46,400 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:46,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:46,403 INFO L85 PathProgramCache]: Analyzing trace with hash 925637, now seen corresponding path program 1 times [2022-02-20 23:45:46,411 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:46,411 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1892879655] [2022-02-20 23:45:46,411 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:46,412 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:46,412 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:46,414 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:45:46,415 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:45:46,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:46,468 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 23:45:46,476 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:46,478 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:46,524 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:45:46,569 INFO L356 Elim1Store]: treesize reduction 12, result has 40.0 percent of original size [2022-02-20 23:45:46,570 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 17 [2022-02-20 23:45:46,607 INFO L290 TraceCheckUtils]: 0: Hoare triple {109#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(14bv32, 2bv32); {109#true} is VALID [2022-02-20 23:45:46,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {109#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {117#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:45:46,611 INFO L290 TraceCheckUtils]: 2: Hoare triple {117#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {121#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~plist#1.base|)) (_ bv1 1)))} is VALID [2022-02-20 23:45:46,611 INFO L290 TraceCheckUtils]: 3: Hoare triple {121#(= (_ bv0 1) (bvadd (bvneg (select |#valid| |ULTIMATE.start_append_~plist#1.base|)) (_ bv1 1)))} assume !(1bv1 == #valid[append_~plist#1.base]); {110#false} is VALID [2022-02-20 23:45:46,612 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:45:46,613 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:46,613 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:46,613 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1892879655] [2022-02-20 23:45:46,615 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1892879655] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:46,615 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:46,615 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:46,616 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645033659] [2022-02-20 23:45:46,617 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:46,621 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:46,621 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:46,623 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:46,631 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:46,631 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:46,631 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:46,648 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:46,649 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:46,652 INFO L87 Difference]: Start difference. First operand has 106 states, 50 states have (on average 2.24) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:47,208 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:47,208 INFO L93 Difference]: Finished difference Result 131 states and 137 transitions. [2022-02-20 23:45:47,209 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:47,209 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:47,209 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:47,210 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:47,220 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-02-20 23:45:47,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:47,225 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 154 transitions. [2022-02-20 23:45:47,226 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 154 transitions. [2022-02-20 23:45:47,373 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 154 edges. 154 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:47,384 INFO L225 Difference]: With dead ends: 131 [2022-02-20 23:45:47,385 INFO L226 Difference]: Without dead ends: 129 [2022-02-20 23:45:47,385 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:45:47,388 INFO L933 BasicCegarLoop]: 55 mSDtfsCounter, 183 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 80 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:47,389 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 80 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:47,400 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2022-02-20 23:45:47,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 97. [2022-02-20 23:45:47,414 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:47,416 INFO L82 GeneralOperation]: Start isEquivalent. First operand 129 states. Second operand has 97 states, 50 states have (on average 2.04) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:47,417 INFO L74 IsIncluded]: Start isIncluded. First operand 129 states. Second operand has 97 states, 50 states have (on average 2.04) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:47,419 INFO L87 Difference]: Start difference. First operand 129 states. Second operand has 97 states, 50 states have (on average 2.04) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:47,431 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:47,431 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-02-20 23:45:47,431 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-02-20 23:45:47,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:47,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:47,433 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 50 states have (on average 2.04) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 129 states. [2022-02-20 23:45:47,433 INFO L87 Difference]: Start difference. First operand has 97 states, 50 states have (on average 2.04) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 129 states. [2022-02-20 23:45:47,442 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:47,443 INFO L93 Difference]: Finished difference Result 129 states and 135 transitions. [2022-02-20 23:45:47,443 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 135 transitions. [2022-02-20 23:45:47,445 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:47,445 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:47,446 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:47,446 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:47,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 50 states have (on average 2.04) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states 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:45:47,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2022-02-20 23:45:47,449 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 4 [2022-02-20 23:45:47,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:47,450 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2022-02-20 23:45:47,450 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:47,450 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2022-02-20 23:45:47,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2022-02-20 23:45:47,451 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:47,451 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1] [2022-02-20 23:45:47,460 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:45:47,657 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:45:47,658 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:47,658 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:47,658 INFO L85 PathProgramCache]: Analyzing trace with hash 925638, now seen corresponding path program 1 times [2022-02-20 23:45:47,659 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:47,659 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [686926916] [2022-02-20 23:45:47,659 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:47,659 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:47,659 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:47,660 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:45:47,661 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:45:47,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:47,700 INFO L263 TraceCheckSpWp]: Trace formula consists of 37 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 23:45:47,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:47,710 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:47,738 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:45:47,746 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:45:47,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:47,824 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 14 [2022-02-20 23:45:47,837 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:47,837 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:47,855 INFO L290 TraceCheckUtils]: 0: Hoare triple {612#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(14bv32, 2bv32); {612#true} is VALID [2022-02-20 23:45:47,857 INFO L290 TraceCheckUtils]: 1: Hoare triple {612#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {620#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} is VALID [2022-02-20 23:45:47,859 INFO L290 TraceCheckUtils]: 2: Hoare triple {620#(and (= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1)) (= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_main_~#list~0#1.base|)))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {624#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:47,860 INFO L290 TraceCheckUtils]: 3: Hoare triple {624#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (_ bv4 32) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, append_~plist#1.offset), #length[append_~plist#1.base]) && ~bvule32(append_~plist#1.offset, ~bvadd32(4bv32, append_~plist#1.offset))) && ~bvule32(0bv32, append_~plist#1.offset)); {613#false} is VALID [2022-02-20 23:45:47,860 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:45:47,860 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:47,861 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:47,861 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [686926916] [2022-02-20 23:45:47,861 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [686926916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:47,861 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:47,861 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:47,861 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1337408241] [2022-02-20 23:45:47,862 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:47,863 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:47,863 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:47,863 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:47,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 4 edges. 4 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:47,871 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:47,872 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:47,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:47,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:47,873 INFO L87 Difference]: Start difference. First operand 97 states and 102 transitions. Second operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:48,794 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,795 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2022-02-20 23:45:48,795 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:48,795 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2022-02-20 23:45:48,795 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:48,796 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:48,798 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2022-02-20 23:45:48,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:48,800 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 244 transitions. [2022-02-20 23:45:48,800 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 244 transitions. [2022-02-20 23:45:49,087 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 244 edges. 244 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,091 INFO L225 Difference]: With dead ends: 219 [2022-02-20 23:45:49,091 INFO L226 Difference]: Without dead ends: 219 [2022-02-20 23:45:49,091 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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:45:49,092 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 182 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 182 SdHoareTripleChecker+Valid, 154 SdHoareTripleChecker+Invalid, 212 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:49,092 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [182 Valid, 154 Invalid, 212 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:49,093 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 219 states. [2022-02-20 23:45:49,096 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 219 to 104. [2022-02-20 23:45:49,096 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:49,096 INFO L82 GeneralOperation]: Start isEquivalent. First operand 219 states. Second operand has 104 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:49,097 INFO L74 IsIncluded]: Start isIncluded. First operand 219 states. Second operand has 104 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:49,097 INFO L87 Difference]: Start difference. First operand 219 states. Second operand has 104 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:49,101 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,102 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2022-02-20 23:45:49,102 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 232 transitions. [2022-02-20 23:45:49,102 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,103 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,103 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 219 states. [2022-02-20 23:45:49,103 INFO L87 Difference]: Start difference. First operand has 104 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 219 states. [2022-02-20 23:45:49,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,108 INFO L93 Difference]: Finished difference Result 219 states and 232 transitions. [2022-02-20 23:45:49,108 INFO L276 IsEmpty]: Start isEmpty. Operand 219 states and 232 transitions. [2022-02-20 23:45:49,109 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,109 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,109 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:49,109 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:49,109 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 61 states have (on average 1.8852459016393444) internal successors, (115), 103 states have internal predecessors, (115), 0 states have call successors, (0), 0 states 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:45:49,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2022-02-20 23:45:49,112 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 4 [2022-02-20 23:45:49,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:49,112 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2022-02-20 23:45:49,112 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 1.3333333333333333) internal successors, (4), 4 states have internal predecessors, (4), 0 states have call successors, (0), 0 states 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:45:49,112 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2022-02-20 23:45:49,113 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:45:49,113 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:49,113 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:45:49,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Ended with exit code 0 [2022-02-20 23:45:49,323 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:45:49,323 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:49,324 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:49,324 INFO L85 PathProgramCache]: Analyzing trace with hash 28694727, now seen corresponding path program 1 times [2022-02-20 23:45:49,324 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:49,324 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1712131990] [2022-02-20 23:45:49,324 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,325 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:49,325 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:49,326 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:45:49,327 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:45:49,367 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,368 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 23:45:49,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,374 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:49,393 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:45:49,400 INFO L290 TraceCheckUtils]: 0: Hoare triple {1390#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(14bv32, 2bv32); {1390#true} is VALID [2022-02-20 23:45:49,400 INFO L290 TraceCheckUtils]: 1: Hoare triple {1390#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {1390#true} is VALID [2022-02-20 23:45:49,401 INFO L290 TraceCheckUtils]: 2: Hoare triple {1390#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1401#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:45:49,402 INFO L290 TraceCheckUtils]: 3: Hoare triple {1401#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {1401#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:45:49,402 INFO L290 TraceCheckUtils]: 4: Hoare triple {1401#(= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[append_~item~0#1.base]); {1391#false} is VALID [2022-02-20 23:45:49,403 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:45:49,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:49,403 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:49,405 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1712131990] [2022-02-20 23:45:49,405 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1712131990] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:49,405 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:49,406 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:49,406 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1480278365] [2022-02-20 23:45:49,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:49,406 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:45:49,406 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:49,406 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:45:49,411 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:45:49,411 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:49,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:49,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:49,414 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:49,415 INFO L87 Difference]: Start difference. First operand 104 states and 115 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:45:49,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,724 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-02-20 23:45:49,724 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:49,724 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:45:49,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:49,724 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:45:49,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 23:45:49,726 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:45:49,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 125 transitions. [2022-02-20 23:45:49,727 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 125 transitions. [2022-02-20 23:45:49,831 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 125 edges. 125 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,833 INFO L225 Difference]: With dead ends: 119 [2022-02-20 23:45:49,833 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 23:45:49,833 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:45:49,834 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 62 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 83 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:49,834 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [62 Valid, 83 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:49,834 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 23:45:49,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 100. [2022-02-20 23:45:49,838 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:49,838 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 100 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:49,839 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 100 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:49,839 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 100 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:49,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,841 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-02-20 23:45:49,841 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-02-20 23:45:49,841 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,841 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,841 INFO L74 IsIncluded]: Start isIncluded. First operand has 100 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-20 23:45:49,842 INFO L87 Difference]: Start difference. First operand has 100 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-20 23:45:49,843 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,844 INFO L93 Difference]: Finished difference Result 119 states and 127 transitions. [2022-02-20 23:45:49,844 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 127 transitions. [2022-02-20 23:45:49,844 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,844 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,844 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:49,844 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:49,845 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.8032786885245902) internal successors, (110), 99 states have internal predecessors, (110), 0 states have call successors, (0), 0 states 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:45:49,846 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 110 transitions. [2022-02-20 23:45:49,846 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 110 transitions. Word has length 5 [2022-02-20 23:45:49,846 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:49,846 INFO L470 AbstractCegarLoop]: Abstraction has 100 states and 110 transitions. [2022-02-20 23:45:49,847 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:45:49,847 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 110 transitions. [2022-02-20 23:45:49,847 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 6 [2022-02-20 23:45:49,847 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:49,847 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1] [2022-02-20 23:45:49,857 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:45:50,057 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:45:50,057 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:50,058 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:50,058 INFO L85 PathProgramCache]: Analyzing trace with hash 28694728, now seen corresponding path program 1 times [2022-02-20 23:45:50,058 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:50,058 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1294347615] [2022-02-20 23:45:50,058 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:50,058 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:50,058 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:50,059 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:45:50,060 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:45:50,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:50,096 INFO L263 TraceCheckSpWp]: Trace formula consists of 43 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:45:50,102 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:50,103 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:50,124 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:45:50,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {1864#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(14bv32, 2bv32); {1864#true} is VALID [2022-02-20 23:45:50,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {1864#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {1864#true} is VALID [2022-02-20 23:45:50,139 INFO L290 TraceCheckUtils]: 2: Hoare triple {1864#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {1875#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:50,140 INFO L290 TraceCheckUtils]: 3: Hoare triple {1875#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {1875#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:50,140 INFO L290 TraceCheckUtils]: 4: Hoare triple {1875#(and (= (_ bv8 32) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, append_~item~0#1.offset), #length[append_~item~0#1.base]) && ~bvule32(append_~item~0#1.offset, ~bvadd32(4bv32, append_~item~0#1.offset))) && ~bvule32(0bv32, append_~item~0#1.offset)); {1865#false} is VALID [2022-02-20 23:45:50,140 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:50,141 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:50,141 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:50,141 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1294347615] [2022-02-20 23:45:50,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1294347615] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:50,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:50,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:50,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [592843128] [2022-02-20 23:45:50,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:50,142 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:45:50,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:50,142 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:45:50,148 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:45:50,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:50,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:50,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:50,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:50,149 INFO L87 Difference]: Start difference. First operand 100 states and 110 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:45:50,380 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,380 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-02-20 23:45:50,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:50,381 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:45:50,381 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:50,381 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:45:50,382 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 23:45:50,382 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:45:50,386 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 93 transitions. [2022-02-20 23:45:50,386 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 93 transitions. [2022-02-20 23:45:50,468 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 93 edges. 93 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:50,469 INFO L225 Difference]: With dead ends: 97 [2022-02-20 23:45:50,469 INFO L226 Difference]: Without dead ends: 97 [2022-02-20 23:45:50,469 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:45:50,470 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 83 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 38 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 83 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 42 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 38 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:50,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [83 Valid, 53 Invalid, 42 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 38 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:50,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2022-02-20 23:45:50,473 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2022-02-20 23:45:50,473 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:50,473 INFO L82 GeneralOperation]: Start isEquivalent. First operand 97 states. Second operand has 96 states, 61 states have (on average 1.721311475409836) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:50,473 INFO L74 IsIncluded]: Start isIncluded. First operand 97 states. Second operand has 96 states, 61 states have (on average 1.721311475409836) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:50,474 INFO L87 Difference]: Start difference. First operand 97 states. Second operand has 96 states, 61 states have (on average 1.721311475409836) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:50,476 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,476 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-02-20 23:45:50,477 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:45:50,477 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:50,477 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:50,477 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 61 states have (on average 1.721311475409836) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 97 states. [2022-02-20 23:45:50,477 INFO L87 Difference]: Start difference. First operand has 96 states, 61 states have (on average 1.721311475409836) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 97 states. [2022-02-20 23:45:50,479 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:50,479 INFO L93 Difference]: Finished difference Result 97 states and 106 transitions. [2022-02-20 23:45:50,479 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:45:50,479 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:50,479 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:50,479 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:50,479 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:50,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 61 states have (on average 1.721311475409836) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:50,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-02-20 23:45:50,481 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 5 [2022-02-20 23:45:50,481 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:50,481 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-02-20 23:45:50,481 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:45:50,482 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-02-20 23:45:50,482 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:50,482 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:50,482 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:50,491 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:45:50,689 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:45:50,689 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:50,690 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:50,690 INFO L85 PathProgramCache]: Analyzing trace with hash -1328641136, now seen corresponding path program 1 times [2022-02-20 23:45:50,690 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:50,690 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1457951678] [2022-02-20 23:45:50,690 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:50,690 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:50,691 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:50,691 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:45:50,692 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:45:50,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:50,746 INFO L263 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 17 conjunts are in the unsatisfiable core [2022-02-20 23:45:50,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:50,755 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:50,874 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:50,874 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 23:45:50,894 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:45:50,894 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 23:45:50,973 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:45:50,973 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-02-20 23:45:50,978 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:45:50,979 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-02-20 23:45:50,996 INFO L290 TraceCheckUtils]: 0: Hoare triple {2268#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(14bv32, 2bv32); {2268#true} is VALID [2022-02-20 23:45:50,997 INFO L290 TraceCheckUtils]: 1: Hoare triple {2268#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {2276#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:45:50,997 INFO L290 TraceCheckUtils]: 2: Hoare triple {2276#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2280#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:45:50,998 INFO L290 TraceCheckUtils]: 3: Hoare triple {2280#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {2284#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_append_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_#t~mem4#1.base|)))} is VALID [2022-02-20 23:45:51,000 INFO L290 TraceCheckUtils]: 4: Hoare triple {2284#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_append_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_#t~mem4#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {2288#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv0 32)) (exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))))} is VALID [2022-02-20 23:45:51,001 INFO L290 TraceCheckUtils]: 5: Hoare triple {2288#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv0 32)) (exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {2288#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv0 32)) (exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))))} is VALID [2022-02-20 23:45:51,002 INFO L290 TraceCheckUtils]: 6: Hoare triple {2288#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv0 32)) (exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {2295#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_append_#t~mem5#1.base|))} is VALID [2022-02-20 23:45:51,003 INFO L290 TraceCheckUtils]: 7: Hoare triple {2295#(and (= |ULTIMATE.start_append_#t~mem5#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_append_#t~mem5#1.base|))} assume append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32; {2269#false} is VALID [2022-02-20 23:45:51,003 INFO L290 TraceCheckUtils]: 8: Hoare triple {2269#false} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L533 {2269#false} is VALID [2022-02-20 23:45:51,004 INFO L290 TraceCheckUtils]: 9: Hoare triple {2269#false} assume !(1bv1 == #valid[append_#t~mem6#1.base]); {2269#false} is VALID [2022-02-20 23:45:51,004 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:45:51,004 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:51,004 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:51,004 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1457951678] [2022-02-20 23:45:51,004 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1457951678] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:51,004 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:51,004 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:51,005 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1322914349] [2022-02-20 23:45:51,005 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:51,005 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:45:51,005 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:51,005 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:51,017 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:51,017 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:51,017 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:51,018 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:51,018 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:51,018 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:53,884 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,884 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:45:53,885 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:45:53,885 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 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 10 [2022-02-20 23:45:53,885 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:53,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:53,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-02-20 23:45:53,886 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:53,887 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 97 transitions. [2022-02-20 23:45:53,887 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 97 transitions. [2022-02-20 23:45:53,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 97 edges. 97 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:53,970 INFO L225 Difference]: With dead ends: 102 [2022-02-20 23:45:53,970 INFO L226 Difference]: Without dead ends: 102 [2022-02-20 23:45:53,970 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:53,970 INFO L933 BasicCegarLoop]: 83 mSDtfsCounter, 5 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 406 SdHoareTripleChecker+Invalid, 114 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:53,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 406 Invalid, 114 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 63 Invalid, 0 Unknown, 50 Unchecked, 0.1s Time] [2022-02-20 23:45:53,971 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2022-02-20 23:45:53,973 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 102. [2022-02-20 23:45:53,973 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:53,973 INFO L82 GeneralOperation]: Start isEquivalent. First operand 102 states. Second operand has 102 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:45:53,973 INFO L74 IsIncluded]: Start isIncluded. First operand 102 states. Second operand has 102 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:45:53,974 INFO L87 Difference]: Start difference. First operand 102 states. Second operand has 102 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:45:53,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,975 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:45:53,975 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:45:53,975 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,975 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,975 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 102 states. [2022-02-20 23:45:53,976 INFO L87 Difference]: Start difference. First operand has 102 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 102 states. [2022-02-20 23:45:53,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,978 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2022-02-20 23:45:53,978 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:45:53,978 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,978 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,978 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:53,978 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:53,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 67 states have (on average 1.6567164179104477) internal successors, (111), 101 states have internal predecessors, (111), 0 states have call successors, (0), 0 states 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:45:53,980 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 111 transitions. [2022-02-20 23:45:53,980 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 111 transitions. Word has length 10 [2022-02-20 23:45:53,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:53,980 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 111 transitions. [2022-02-20 23:45:53,981 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 1.4285714285714286) internal successors, (10), 7 states have internal predecessors, (10), 0 states have call successors, (0), 0 states 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:45:53,981 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 111 transitions. [2022-02-20 23:45:53,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:45:53,981 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:53,981 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:53,989 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:54,187 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:45:54,188 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:54,188 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:54,188 INFO L85 PathProgramCache]: Analyzing trace with hash 1762075788, now seen corresponding path program 1 times [2022-02-20 23:45:54,188 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:54,188 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1631648980] [2022-02-20 23:45:54,188 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,188 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:54,188 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:54,190 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:45:54,191 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:45:54,241 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,244 INFO L263 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 8 conjunts are in the unsatisfiable core [2022-02-20 23:45:54,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,258 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:54,354 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 23:45:54,355 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 16 [2022-02-20 23:45:54,363 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:54,364 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:54,397 INFO L290 TraceCheckUtils]: 0: Hoare triple {2716#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(14bv32, 2bv32); {2716#true} is VALID [2022-02-20 23:45:54,397 INFO L290 TraceCheckUtils]: 1: Hoare triple {2716#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {2724#(= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:54,398 INFO L290 TraceCheckUtils]: 2: Hoare triple {2724#(= |ULTIMATE.start_main_~#list~0#1.offset| (_ bv0 32))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {2728#(= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32))} is VALID [2022-02-20 23:45:54,398 INFO L290 TraceCheckUtils]: 3: Hoare triple {2728#(= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,399 INFO L290 TraceCheckUtils]: 4: Hoare triple {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,399 INFO L290 TraceCheckUtils]: 5: Hoare triple {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,400 INFO L290 TraceCheckUtils]: 6: Hoare triple {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,401 INFO L290 TraceCheckUtils]: 7: Hoare triple {2732#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (= (select |#valid| |ULTIMATE.start_append_~plist#1.base|) (_ bv1 1)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2745#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,402 INFO L290 TraceCheckUtils]: 8: Hoare triple {2745#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {2745#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,402 INFO L290 TraceCheckUtils]: 9: Hoare triple {2745#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {2745#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} is VALID [2022-02-20 23:45:54,403 INFO L290 TraceCheckUtils]: 10: Hoare triple {2745#(and (= |ULTIMATE.start_append_~plist#1.offset| (_ bv0 32)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_~plist#1.offset|) (select |#length| |ULTIMATE.start_append_~plist#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, append_~plist#1.offset), #length[append_~plist#1.base]) && ~bvule32(append_~plist#1.offset, ~bvadd32(4bv32, append_~plist#1.offset))) && ~bvule32(0bv32, append_~plist#1.offset)); {2717#false} is VALID [2022-02-20 23:45:54,403 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:45:54,403 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:54,403 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:54,403 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1631648980] [2022-02-20 23:45:54,403 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1631648980] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:54,403 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:54,404 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:54,404 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487311210] [2022-02-20 23:45:54,404 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:54,404 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,404 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:54,404 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,417 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:45:54,417 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:54,417 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:54,417 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:54,417 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:54,417 INFO L87 Difference]: Start difference. First operand 102 states and 111 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,857 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-02-20 23:45:54,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:45:54,858 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:54,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,859 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-02-20 23:45:54,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 117 transitions. [2022-02-20 23:45:54,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 117 transitions. [2022-02-20 23:45:54,980 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 117 edges. 117 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:54,981 INFO L225 Difference]: With dead ends: 119 [2022-02-20 23:45:54,981 INFO L226 Difference]: Without dead ends: 119 [2022-02-20 23:45:54,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=30, Invalid=42, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:54,982 INFO L933 BasicCegarLoop]: 40 mSDtfsCounter, 371 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 84 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 371 SdHoareTripleChecker+Valid, 61 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 84 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:54,982 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [371 Valid, 61 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 84 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:54,983 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2022-02-20 23:45:54,984 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 98. [2022-02-20 23:45:54,984 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:54,985 INFO L82 GeneralOperation]: Start isEquivalent. First operand 119 states. Second operand has 98 states, 64 states have (on average 1.671875) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:54,985 INFO L74 IsIncluded]: Start isIncluded. First operand 119 states. Second operand has 98 states, 64 states have (on average 1.671875) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:54,985 INFO L87 Difference]: Start difference. First operand 119 states. Second operand has 98 states, 64 states have (on average 1.671875) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:54,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,987 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-02-20 23:45:54,987 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2022-02-20 23:45:54,987 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,987 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,987 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 64 states have (on average 1.671875) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-20 23:45:54,988 INFO L87 Difference]: Start difference. First operand has 98 states, 64 states have (on average 1.671875) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 119 states. [2022-02-20 23:45:54,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,989 INFO L93 Difference]: Finished difference Result 119 states and 126 transitions. [2022-02-20 23:45:54,989 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 126 transitions. [2022-02-20 23:45:54,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,990 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:54,990 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:54,990 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 64 states have (on average 1.671875) internal successors, (107), 97 states have internal predecessors, (107), 0 states have call successors, (0), 0 states 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:45:54,991 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 107 transitions. [2022-02-20 23:45:54,991 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 107 transitions. Word has length 11 [2022-02-20 23:45:54,991 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:54,992 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 107 transitions. [2022-02-20 23:45:54,992 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 6 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:45:54,992 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 107 transitions. [2022-02-20 23:45:54,992 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:54,992 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:54,992 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:55,004 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:55,199 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:45:55,199 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:55,199 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:55,199 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051159, now seen corresponding path program 1 times [2022-02-20 23:45:55,200 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:55,200 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1148827685] [2022-02-20 23:45:55,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:55,200 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:55,200 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:55,201 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:45:55,203 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:45:55,263 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:55,266 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:55,274 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:55,274 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:55,412 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 11 treesize of output 7 [2022-02-20 23:45:55,447 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 17 treesize of output 9 [2022-02-20 23:45:55,454 INFO L290 TraceCheckUtils]: 0: Hoare triple {3215#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(14bv32, 2bv32); {3215#true} is VALID [2022-02-20 23:45:55,455 INFO L290 TraceCheckUtils]: 1: Hoare triple {3215#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {3215#true} is VALID [2022-02-20 23:45:55,455 INFO L290 TraceCheckUtils]: 2: Hoare triple {3215#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:55,456 INFO L290 TraceCheckUtils]: 3: Hoare triple {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:55,456 INFO L290 TraceCheckUtils]: 4: Hoare triple {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:55,457 INFO L290 TraceCheckUtils]: 5: Hoare triple {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:55,458 INFO L290 TraceCheckUtils]: 6: Hoare triple {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:55,458 INFO L290 TraceCheckUtils]: 7: Hoare triple {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:55,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {3226#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {3245#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:45:55,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {3245#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3245#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:45:55,461 INFO L290 TraceCheckUtils]: 10: Hoare triple {3245#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:55,461 INFO L290 TraceCheckUtils]: 11: Hoare triple {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :end_inline_append } true; {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:55,461 INFO L290 TraceCheckUtils]: 12: Hoare triple {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:55,462 INFO L290 TraceCheckUtils]: 13: Hoare triple {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:55,462 INFO L290 TraceCheckUtils]: 14: Hoare triple {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:55,462 INFO L290 TraceCheckUtils]: 15: Hoare triple {3252#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L544 {3268#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:45:55,463 INFO L290 TraceCheckUtils]: 16: Hoare triple {3268#(= (select |#valid| |ULTIMATE.start_main_#t~mem12#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem12#1.base]); {3216#false} is VALID [2022-02-20 23:45:55,463 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:55,463 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:55,463 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:55,463 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1148827685] [2022-02-20 23:45:55,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1148827685] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:55,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:55,464 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:55,464 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [307938725] [2022-02-20 23:45:55,464 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:55,464 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:55,464 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:55,464 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:55,491 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:45:55,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:55,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:55,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:55,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:55,492 INFO L87 Difference]: Start difference. First operand 98 states and 107 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:56,327 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:45:56,327 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:56,327 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,328 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:56,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,329 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-02-20 23:45:56,329 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,330 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 118 transitions. [2022-02-20 23:45:56,330 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 118 transitions. [2022-02-20 23:45:56,442 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 118 edges. 118 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:56,443 INFO L225 Difference]: With dead ends: 115 [2022-02-20 23:45:56,443 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 23:45:56,443 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 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:45:56,444 INFO L933 BasicCegarLoop]: 41 mSDtfsCounter, 147 mSDsluCounter, 79 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:56,444 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 120 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:56,444 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 23:45:56,446 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 97. [2022-02-20 23:45:56,446 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:56,446 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 97 states, 64 states have (on average 1.65625) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:56,446 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 97 states, 64 states have (on average 1.65625) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:56,447 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 97 states, 64 states have (on average 1.65625) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:56,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:56,448 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:45:56,448 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:45:56,449 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:56,449 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:56,449 INFO L74 IsIncluded]: Start isIncluded. First operand has 97 states, 64 states have (on average 1.65625) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2022-02-20 23:45:56,449 INFO L87 Difference]: Start difference. First operand has 97 states, 64 states have (on average 1.65625) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 115 states. [2022-02-20 23:45:56,451 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:56,451 INFO L93 Difference]: Finished difference Result 115 states and 122 transitions. [2022-02-20 23:45:56,451 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 122 transitions. [2022-02-20 23:45:56,451 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:56,451 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:56,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:56,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:56,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 64 states have (on average 1.65625) internal successors, (106), 96 states have internal predecessors, (106), 0 states have call successors, (0), 0 states 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:45:56,453 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 106 transitions. [2022-02-20 23:45:56,453 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 106 transitions. Word has length 17 [2022-02-20 23:45:56,453 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:56,453 INFO L470 AbstractCegarLoop]: Abstraction has 97 states and 106 transitions. [2022-02-20 23:45:56,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,453 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 106 transitions. [2022-02-20 23:45:56,454 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:56,454 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:56,454 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:56,461 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:45:56,660 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:45:56,660 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:56,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:56,661 INFO L85 PathProgramCache]: Analyzing trace with hash 1870051160, now seen corresponding path program 1 times [2022-02-20 23:45:56,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:56,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [126844189] [2022-02-20 23:45:56,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:56,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:56,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:56,662 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:45:56,665 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:45:56,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,722 INFO L263 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:45:56,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,733 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:56,870 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 11 treesize of output 7 [2022-02-20 23:45:56,875 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 11 treesize of output 7 [2022-02-20 23:45:56,932 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 17 treesize of output 9 [2022-02-20 23:45:56,936 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:45:56,949 INFO L290 TraceCheckUtils]: 0: Hoare triple {3717#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(14bv32, 2bv32); {3717#true} is VALID [2022-02-20 23:45:56,950 INFO L290 TraceCheckUtils]: 1: Hoare triple {3717#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {3717#true} is VALID [2022-02-20 23:45:56,950 INFO L290 TraceCheckUtils]: 2: Hoare triple {3717#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,951 INFO L290 TraceCheckUtils]: 3: Hoare triple {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,951 INFO L290 TraceCheckUtils]: 4: Hoare triple {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,952 INFO L290 TraceCheckUtils]: 5: Hoare triple {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,952 INFO L290 TraceCheckUtils]: 6: Hoare triple {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,953 INFO L290 TraceCheckUtils]: 7: Hoare triple {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,953 INFO L290 TraceCheckUtils]: 8: Hoare triple {3728#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {3747#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {3747#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {3747#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:56,956 INFO L290 TraceCheckUtils]: 10: Hoare triple {3747#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:56,956 INFO L290 TraceCheckUtils]: 11: Hoare triple {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :end_inline_append } true; {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:56,957 INFO L290 TraceCheckUtils]: 12: Hoare triple {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:56,957 INFO L290 TraceCheckUtils]: 13: Hoare triple {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:56,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:45:56,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {3754#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L544 {3770#(and (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|)) (= |ULTIMATE.start_main_#t~mem12#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:45:56,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {3770#(and (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem12#1.base|)) (= |ULTIMATE.start_main_#t~mem12#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, main_#t~mem12#1.offset), #length[main_#t~mem12#1.base]) && ~bvule32(main_#t~mem12#1.offset, ~bvadd32(4bv32, main_#t~mem12#1.offset))) && ~bvule32(0bv32, main_#t~mem12#1.offset)); {3718#false} is VALID [2022-02-20 23:45:56,959 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:45:56,959 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:56,959 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:56,959 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [126844189] [2022-02-20 23:45:56,959 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [126844189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:56,960 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:56,960 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:56,960 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1046345700] [2022-02-20 23:45:56,960 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:56,960 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,960 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:56,961 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:56,980 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:45:56,980 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:56,981 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:56,981 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:56,981 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:56,981 INFO L87 Difference]: Start difference. First operand 97 states and 106 transitions. Second operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:57,817 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:57,817 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-20 23:45:57,817 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:57,817 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:57,818 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:57,818 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:57,819 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-02-20 23:45:57,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:57,820 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 122 transitions. [2022-02-20 23:45:57,820 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 122 transitions. [2022-02-20 23:45:57,967 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 122 edges. 122 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:57,969 INFO L225 Difference]: With dead ends: 120 [2022-02-20 23:45:57,969 INFO L226 Difference]: Without dead ends: 120 [2022-02-20 23:45:57,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:57,969 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 168 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 119 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 118 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 119 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:57,969 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 118 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:57,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2022-02-20 23:45:57,971 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 96. [2022-02-20 23:45:57,971 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:57,971 INFO L82 GeneralOperation]: Start isEquivalent. First operand 120 states. Second operand has 96 states, 64 states have (on average 1.640625) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:57,972 INFO L74 IsIncluded]: Start isIncluded. First operand 120 states. Second operand has 96 states, 64 states have (on average 1.640625) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:57,972 INFO L87 Difference]: Start difference. First operand 120 states. Second operand has 96 states, 64 states have (on average 1.640625) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:57,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:57,974 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-20 23:45:57,974 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-02-20 23:45:57,974 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:57,974 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:57,974 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 64 states have (on average 1.640625) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-20 23:45:57,974 INFO L87 Difference]: Start difference. First operand has 96 states, 64 states have (on average 1.640625) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 120 states. [2022-02-20 23:45:57,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:57,976 INFO L93 Difference]: Finished difference Result 120 states and 127 transitions. [2022-02-20 23:45:57,976 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 127 transitions. [2022-02-20 23:45:57,976 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:57,976 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:57,977 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:57,977 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:57,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 64 states have (on average 1.640625) internal successors, (105), 95 states have internal predecessors, (105), 0 states have call successors, (0), 0 states 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:45:57,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 105 transitions. [2022-02-20 23:45:57,978 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 105 transitions. Word has length 17 [2022-02-20 23:45:57,978 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:57,978 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 105 transitions. [2022-02-20 23:45:57,978 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.4) internal successors, (17), 6 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:45:57,979 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 105 transitions. [2022-02-20 23:45:57,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 23:45:57,979 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:57,979 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:57,988 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:58,185 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:45:58,186 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:58,186 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:58,186 INFO L85 PathProgramCache]: Analyzing trace with hash 1854453499, now seen corresponding path program 1 times [2022-02-20 23:45:58,186 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:58,186 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [897464887] [2022-02-20 23:45:58,187 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:58,187 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:58,187 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:58,187 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:45:58,189 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:45:58,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,253 INFO L263 TraceCheckSpWp]: Trace formula consists of 123 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:58,261 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,262 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:58,387 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:45:58,409 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 16 treesize of output 8 [2022-02-20 23:45:58,423 INFO L290 TraceCheckUtils]: 0: Hoare triple {4233#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(14bv32, 2bv32); {4233#true} is VALID [2022-02-20 23:45:58,423 INFO L290 TraceCheckUtils]: 1: Hoare triple {4233#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {4233#true} is VALID [2022-02-20 23:45:58,424 INFO L290 TraceCheckUtils]: 2: Hoare triple {4233#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,425 INFO L290 TraceCheckUtils]: 3: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,425 INFO L290 TraceCheckUtils]: 4: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,426 INFO L290 TraceCheckUtils]: 5: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,426 INFO L290 TraceCheckUtils]: 6: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,427 INFO L290 TraceCheckUtils]: 7: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,427 INFO L290 TraceCheckUtils]: 8: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,428 INFO L290 TraceCheckUtils]: 9: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 23:45:58,429 INFO L290 TraceCheckUtils]: 10: Hoare triple {4244#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (not (= |ULTIMATE.start_append_~item~0#1.base| (_ bv0 32))))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {4269#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:45:58,437 INFO L290 TraceCheckUtils]: 11: Hoare triple {4269#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume { :end_inline_append } true; {4269#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:45:58,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {4269#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4269#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:45:58,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {4269#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) (_ bv0 32)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {4279#(not (= |ULTIMATE.start_main_#t~mem11#1.base| (_ bv0 32)))} is VALID [2022-02-20 23:45:58,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {4279#(not (= |ULTIMATE.start_main_#t~mem11#1.base| (_ bv0 32)))} assume !(main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32);havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {4234#false} is VALID [2022-02-20 23:45:58,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {4234#false} SUMMARY for call main_#t~mem22#1.base, main_#t~mem22#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L554-1 {4234#false} is VALID [2022-02-20 23:45:58,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {4234#false} assume !(main_#t~mem22#1.base != 0bv32 || main_#t~mem22#1.offset != 0bv32);havoc main_#t~mem22#1.base, main_#t~mem22#1.offset; {4234#false} is VALID [2022-02-20 23:45:58,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {4234#false} main_#res#1 := 0bv32;call ULTIMATE.dealloc(main_~#list~0#1.base, main_~#list~0#1.offset);havoc main_~#list~0#1.base, main_~#list~0#1.offset; {4234#false} is VALID [2022-02-20 23:45:58,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {4234#false} assume !(#valid == main_old_#valid#1); {4234#false} is VALID [2022-02-20 23:45:58,439 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:45:58,439 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:58,439 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:58,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [897464887] [2022-02-20 23:45:58,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [897464887] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:58,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:58,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:58,440 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1302021684] [2022-02-20 23:45:58,440 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:58,440 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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:45:58,440 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:58,441 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) 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:45:58,459 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:45:58,459 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:58,459 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:58,459 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:58,459 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:58,459 INFO L87 Difference]: Start difference. First operand 96 states and 105 transitions. Second operand has 5 states, 5 states have (on average 3.8) 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:45:59,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:59,040 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:45:59,040 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:59,041 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) 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:45:59,041 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:59,041 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) 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:45:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-02-20 23:45:59,042 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) 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:45:59,042 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 88 transitions. [2022-02-20 23:45:59,043 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 88 transitions. [2022-02-20 23:45:59,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 88 edges. 88 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:59,132 INFO L225 Difference]: With dead ends: 88 [2022-02-20 23:45:59,132 INFO L226 Difference]: Without dead ends: 88 [2022-02-20 23:45:59,132 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:59,133 INFO L933 BasicCegarLoop]: 53 mSDtfsCounter, 97 mSDsluCounter, 84 mSDsCounter, 0 mSdLazyCounter, 95 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 99 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 95 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:59,133 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [97 Valid, 137 Invalid, 99 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 95 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:59,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2022-02-20 23:45:59,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2022-02-20 23:45:59,134 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:59,135 INFO L82 GeneralOperation]: Start isEquivalent. First operand 88 states. Second operand has 88 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:59,135 INFO L74 IsIncluded]: Start isIncluded. First operand 88 states. Second operand has 88 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:59,136 INFO L87 Difference]: Start difference. First operand 88 states. Second operand has 88 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:59,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:59,137 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:45:59,137 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-02-20 23:45:59,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:59,137 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:59,137 INFO L74 IsIncluded]: Start isIncluded. First operand has 88 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 23:45:59,138 INFO L87 Difference]: Start difference. First operand has 88 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 88 states. [2022-02-20 23:45:59,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:59,139 INFO L93 Difference]: Finished difference Result 88 states and 92 transitions. [2022-02-20 23:45:59,139 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-02-20 23:45:59,139 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:59,139 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:59,139 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:59,139 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:59,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 56 states have (on average 1.6428571428571428) internal successors, (92), 87 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:59,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 92 transitions. [2022-02-20 23:45:59,141 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 92 transitions. Word has length 19 [2022-02-20 23:45:59,141 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:59,141 INFO L470 AbstractCegarLoop]: Abstraction has 88 states and 92 transitions. [2022-02-20 23:45:59,141 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) 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:45:59,141 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 92 transitions. [2022-02-20 23:45:59,141 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:45:59,141 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:59,142 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:59,148 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:45:59,348 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:45:59,348 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:45:59,349 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:59,349 INFO L85 PathProgramCache]: Analyzing trace with hash 673311178, now seen corresponding path program 1 times [2022-02-20 23:45:59,349 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:45:59,349 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1587733608] [2022-02-20 23:45:59,349 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:59,349 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:45:59,349 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:45:59,350 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:45:59,353 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:45:59,426 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:59,430 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 10 conjunts are in the unsatisfiable core [2022-02-20 23:45:59,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:59,440 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:59,526 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 11 treesize of output 7 [2022-02-20 23:45:59,575 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 17 treesize of output 9 [2022-02-20 23:45:59,585 INFO L290 TraceCheckUtils]: 0: Hoare triple {4650#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(14bv32, 2bv32); {4650#true} is VALID [2022-02-20 23:45:59,585 INFO L290 TraceCheckUtils]: 1: Hoare triple {4650#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {4650#true} is VALID [2022-02-20 23:45:59,585 INFO L290 TraceCheckUtils]: 2: Hoare triple {4650#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:59,586 INFO L290 TraceCheckUtils]: 3: Hoare triple {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:59,587 INFO L290 TraceCheckUtils]: 4: Hoare triple {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:59,587 INFO L290 TraceCheckUtils]: 5: Hoare triple {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:59,587 INFO L290 TraceCheckUtils]: 6: Hoare triple {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:59,588 INFO L290 TraceCheckUtils]: 7: Hoare triple {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:45:59,588 INFO L290 TraceCheckUtils]: 8: Hoare triple {4661#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {4680#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:45:59,589 INFO L290 TraceCheckUtils]: 9: Hoare triple {4680#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {4680#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:45:59,590 INFO L290 TraceCheckUtils]: 10: Hoare triple {4680#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,590 INFO L290 TraceCheckUtils]: 11: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :end_inline_append } true; {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,591 INFO L290 TraceCheckUtils]: 12: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,591 INFO L290 TraceCheckUtils]: 13: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,591 INFO L290 TraceCheckUtils]: 14: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,593 INFO L290 TraceCheckUtils]: 15: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L544 {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,594 INFO L290 TraceCheckUtils]: 16: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4bv32); srcloc: L544-1 {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,594 INFO L290 TraceCheckUtils]: 17: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:45:59,594 INFO L290 TraceCheckUtils]: 18: Hoare triple {4687#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L545 {4712#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:45:59,595 INFO L290 TraceCheckUtils]: 19: Hoare triple {4712#(= (select |#valid| |ULTIMATE.start_main_#t~mem14#1.base|) (_ bv1 1))} assume !(1bv1 == #valid[main_#t~mem14#1.base]); {4651#false} is VALID [2022-02-20 23:45:59,595 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:45:59,595 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:59,595 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:45:59,595 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1587733608] [2022-02-20 23:45:59,595 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1587733608] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:59,595 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:59,595 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:59,595 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1519250126] [2022-02-20 23:45:59,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:45:59,596 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:59,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:59,616 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:59,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:59,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:45:59,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:59,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:59,616 INFO L87 Difference]: Start difference. First operand 88 states and 92 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:00,394 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:00,395 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:46:00,395 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:46:00,395 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:00,395 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:00,395 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:00,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-02-20 23:46:00,396 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:00,397 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 87 transitions. [2022-02-20 23:46:00,397 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 87 transitions. [2022-02-20 23:46:00,475 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:00,476 INFO L225 Difference]: With dead ends: 87 [2022-02-20 23:46:00,476 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 23:46:00,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 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:46:00,477 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 116 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 162 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 116 SdHoareTripleChecker+Valid, 121 SdHoareTripleChecker+Invalid, 166 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 162 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:00,477 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [116 Valid, 121 Invalid, 166 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 162 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:00,478 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 23:46:00,478 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-20 23:46:00,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:00,479 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:46:00,479 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:46:00,479 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:46:00,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:00,481 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:46:00,481 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:46:00,481 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:00,481 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:00,481 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:46:00,481 INFO L87 Difference]: Start difference. First operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 87 states. [2022-02-20 23:46:00,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:00,483 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2022-02-20 23:46:00,483 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:46:00,483 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:00,483 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:00,483 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:00,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:00,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 56 states have (on average 1.625) internal successors, (91), 86 states have internal predecessors, (91), 0 states have call successors, (0), 0 states 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:46:00,484 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 91 transitions. [2022-02-20 23:46:00,484 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 91 transitions. Word has length 20 [2022-02-20 23:46:00,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:00,485 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 91 transitions. [2022-02-20 23:46:00,485 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:00,485 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 91 transitions. [2022-02-20 23:46:00,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2022-02-20 23:46:00,485 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:00,485 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:00,494 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (11)] Ended with exit code 0 [2022-02-20 23:46:00,692 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:46:00,692 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:46:00,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:00,692 INFO L85 PathProgramCache]: Analyzing trace with hash 673311179, now seen corresponding path program 1 times [2022-02-20 23:46:00,692 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:00,692 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [689845126] [2022-02-20 23:46:00,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:00,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:00,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:00,693 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:46:00,694 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:46:00,770 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:00,774 INFO L263 TraceCheckSpWp]: Trace formula consists of 131 conjuncts, 15 conjunts are in the unsatisfiable core [2022-02-20 23:46:00,788 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:00,789 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:00,919 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 11 treesize of output 7 [2022-02-20 23:46:00,924 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 11 treesize of output 7 [2022-02-20 23:46:00,997 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 17 treesize of output 9 [2022-02-20 23:46:01,000 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:46:01,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {5067#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(14bv32, 2bv32); {5067#true} is VALID [2022-02-20 23:46:01,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {5067#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {5067#true} is VALID [2022-02-20 23:46:01,012 INFO L290 TraceCheckUtils]: 2: Hoare triple {5067#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,013 INFO L290 TraceCheckUtils]: 3: Hoare triple {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,013 INFO L290 TraceCheckUtils]: 4: Hoare triple {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,015 INFO L290 TraceCheckUtils]: 7: Hoare triple {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,015 INFO L290 TraceCheckUtils]: 8: Hoare triple {5078#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {5097#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,016 INFO L290 TraceCheckUtils]: 9: Hoare triple {5097#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5097#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:01,018 INFO L290 TraceCheckUtils]: 10: Hoare triple {5097#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,018 INFO L290 TraceCheckUtils]: 11: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :end_inline_append } true; {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,019 INFO L290 TraceCheckUtils]: 12: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,019 INFO L290 TraceCheckUtils]: 13: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,020 INFO L290 TraceCheckUtils]: 14: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,020 INFO L290 TraceCheckUtils]: 15: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L544 {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,021 INFO L290 TraceCheckUtils]: 16: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4bv32); srcloc: L544-1 {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,021 INFO L290 TraceCheckUtils]: 17: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:01,021 INFO L290 TraceCheckUtils]: 18: Hoare triple {5104#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L545 {5129#(and (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= |ULTIMATE.start_main_#t~mem14#1.offset| (_ bv0 32)))} is VALID [2022-02-20 23:46:01,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {5129#(and (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_main_#t~mem14#1.base|)) (= |ULTIMATE.start_main_#t~mem14#1.offset| (_ bv0 32)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem14#1.offset)), #length[main_#t~mem14#1.base]) && ~bvule32(~bvadd32(4bv32, main_#t~mem14#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, main_#t~mem14#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, main_#t~mem14#1.offset))); {5068#false} is VALID [2022-02-20 23:46:01,022 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:46:01,022 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:01,022 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:01,022 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [689845126] [2022-02-20 23:46:01,022 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [689845126] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:01,022 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:01,022 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:46:01,023 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069559701] [2022-02-20 23:46:01,023 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:01,023 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:01,023 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:01,023 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:01,046 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:01,046 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:46:01,046 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:01,047 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:46:01,047 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:46:01,047 INFO L87 Difference]: Start difference. First operand 87 states and 91 transitions. Second operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:01,787 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:01,787 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-02-20 23:46:01,787 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:46:01,787 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2022-02-20 23:46:01,787 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:01,788 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-02-20 23:46:01,788 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:01,789 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 86 transitions. [2022-02-20 23:46:01,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 86 transitions. [2022-02-20 23:46:01,884 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 86 edges. 86 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:01,885 INFO L225 Difference]: With dead ends: 86 [2022-02-20 23:46:01,885 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 23:46:01,885 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 15 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:46:01,886 INFO L933 BasicCegarLoop]: 45 mSDtfsCounter, 171 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 108 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:01,886 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [171 Valid, 108 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:46:01,886 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 23:46:01,887 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-20 23:46:01,887 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:01,887 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:46:01,888 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:46:01,888 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:46:01,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:01,889 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-02-20 23:46:01,889 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-02-20 23:46:01,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:01,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:01,889 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-20 23:46:01,889 INFO L87 Difference]: Start difference. First operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 86 states. [2022-02-20 23:46:01,890 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:01,890 INFO L93 Difference]: Finished difference Result 86 states and 90 transitions. [2022-02-20 23:46:01,890 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-02-20 23:46:01,891 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:01,891 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:01,891 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:01,891 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:01,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 56 states have (on average 1.6071428571428572) internal successors, (90), 85 states have internal predecessors, (90), 0 states have call successors, (0), 0 states 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:46:01,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 90 transitions. [2022-02-20 23:46:01,892 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 90 transitions. Word has length 20 [2022-02-20 23:46:01,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:01,892 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 90 transitions. [2022-02-20 23:46:01,892 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.0) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:01,892 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 90 transitions. [2022-02-20 23:46:01,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:46:01,893 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:01,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:01,900 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:46:02,100 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:46:02,101 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:46:02,101 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:02,101 INFO L85 PathProgramCache]: Analyzing trace with hash -602189926, now seen corresponding path program 1 times [2022-02-20 23:46:02,101 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:02,101 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1842489798] [2022-02-20 23:46:02,101 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:02,101 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:02,101 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:02,102 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:46:02,103 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:46:02,179 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:02,182 INFO L263 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:46:02,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:02,204 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:02,212 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:46:02,237 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:02,238 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:46:02,344 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:46:02,412 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2022-02-20 23:46:02,418 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 24 [2022-02-20 23:46:02,510 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 33 treesize of output 21 [2022-02-20 23:46:02,607 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 12 [2022-02-20 23:46:02,636 INFO L290 TraceCheckUtils]: 0: Hoare triple {5480#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(14bv32, 2bv32); {5480#true} is VALID [2022-02-20 23:46:02,637 INFO L290 TraceCheckUtils]: 1: Hoare triple {5480#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {5488#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:02,638 INFO L290 TraceCheckUtils]: 2: Hoare triple {5488#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:02,638 INFO L290 TraceCheckUtils]: 3: Hoare triple {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:02,639 INFO L290 TraceCheckUtils]: 4: Hoare triple {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:02,639 INFO L290 TraceCheckUtils]: 5: Hoare triple {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:02,640 INFO L290 TraceCheckUtils]: 6: Hoare triple {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:02,640 INFO L290 TraceCheckUtils]: 7: Hoare triple {5492#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5508#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_#t~ite9#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:02,642 INFO L290 TraceCheckUtils]: 8: Hoare triple {5508#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_append_#t~ite9#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {5512#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:46:02,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {5512#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) (_ bv0 32)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5512#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {5512#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) (_ bv0 32)))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} assume { :end_inline_append } true; {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,015 INFO L290 TraceCheckUtils]: 12: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} assume main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,016 INFO L290 TraceCheckUtils]: 15: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L544 {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4bv32); srcloc: L544-1 {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,017 INFO L290 TraceCheckUtils]: 17: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} is VALID [2022-02-20 23:46:03,322 INFO L290 TraceCheckUtils]: 18: Hoare triple {5519#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32)))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L545 {5544#(exists ((|ULTIMATE.start_main_~#list~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#list~0#1.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_main_#t~mem14#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem14#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem14#1.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32))))} is VALID [2022-02-20 23:46:05,326 WARN L290 TraceCheckUtils]: 19: Hoare triple {5544#(exists ((|ULTIMATE.start_main_~#list~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#list~0#1.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_main_#t~mem14#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= |ULTIMATE.start_main_#t~mem14#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_#t~mem14#1.base|) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (_ bv0 32))))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, ~bvadd32(4bv32, main_#t~mem14#1.offset), 4bv32); srcloc: L545-1 {5548#(= |ULTIMATE.start_main_#t~mem15#1.offset| (_ bv0 32))} is UNKNOWN [2022-02-20 23:46:05,326 INFO L290 TraceCheckUtils]: 20: Hoare triple {5548#(= |ULTIMATE.start_main_#t~mem15#1.offset| (_ bv0 32))} assume !(0bv32 == main_#t~mem15#1.offset); {5481#false} is VALID [2022-02-20 23:46:05,326 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:46:05,326 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:05,327 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:05,327 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1842489798] [2022-02-20 23:46:05,327 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1842489798] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:05,327 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:05,327 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:05,327 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1055170363] [2022-02-20 23:46:05,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:05,327 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:46:05,327 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:05,328 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:07,420 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:07,420 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:46:07,420 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:07,421 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:46:07,421 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:07,421 INFO L87 Difference]: Start difference. First operand 86 states and 90 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:08,766 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:46:08,767 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:08,767 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:46:08,767 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:08,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2022-02-20 23:46:08,768 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:08,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 103 transitions. [2022-02-20 23:46:08,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 103 transitions. [2022-02-20 23:46:11,448 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 103 edges. 103 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:11,450 INFO L225 Difference]: With dead ends: 103 [2022-02-20 23:46:11,450 INFO L226 Difference]: Without dead ends: 103 [2022-02-20 23:46:11,450 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 17 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=68, Invalid=172, Unknown=0, NotChecked=0, Total=240 [2022-02-20 23:46:11,451 INFO L933 BasicCegarLoop]: 47 mSDtfsCounter, 113 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 206 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 214 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 206 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 43 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:11,451 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [113 Valid, 214 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 206 Invalid, 0 Unknown, 43 Unchecked, 0.4s Time] [2022-02-20 23:46:11,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2022-02-20 23:46:11,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 99. [2022-02-20 23:46:11,452 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:11,452 INFO L82 GeneralOperation]: Start isEquivalent. First operand 103 states. Second operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:46:11,453 INFO L74 IsIncluded]: Start isIncluded. First operand 103 states. Second operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:46:11,453 INFO L87 Difference]: Start difference. First operand 103 states. Second operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:46:11,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,454 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:46:11,454 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:46:11,454 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:11,454 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:11,455 INFO L74 IsIncluded]: Start isIncluded. First operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states. [2022-02-20 23:46:11,455 INFO L87 Difference]: Start difference. First operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 103 states. [2022-02-20 23:46:11,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:11,456 INFO L93 Difference]: Finished difference Result 103 states and 107 transitions. [2022-02-20 23:46:11,456 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 107 transitions. [2022-02-20 23:46:11,456 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:11,456 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:11,456 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:11,456 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:11,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states 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:46:11,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2022-02-20 23:46:11,458 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 21 [2022-02-20 23:46:11,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:11,458 INFO L470 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2022-02-20 23:46:11,458 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 9 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:11,458 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2022-02-20 23:46:11,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:46:11,458 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:11,458 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:11,465 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:11,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:46:11,660 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr8REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:46:11,660 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:11,661 INFO L85 PathProgramCache]: Analyzing trace with hash 717052317, now seen corresponding path program 1 times [2022-02-20 23:46:11,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:11,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1629929950] [2022-02-20 23:46:11,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:11,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:11,661 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:11,662 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:46:11,663 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2022-02-20 23:46:11,747 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:11,751 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 20 conjunts are in the unsatisfiable core [2022-02-20 23:46:11,760 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:11,761 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:11,853 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 11 treesize of output 7 [2022-02-20 23:46:11,889 INFO L356 Elim1Store]: treesize reduction 24, result has 33.3 percent of original size [2022-02-20 23:46:11,890 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 21 [2022-02-20 23:46:11,955 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:46:11,955 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 22 [2022-02-20 23:46:12,010 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 19 treesize of output 11 [2022-02-20 23:46:12,028 INFO L290 TraceCheckUtils]: 0: Hoare triple {5973#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(14bv32, 2bv32); {5973#true} is VALID [2022-02-20 23:46:12,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {5973#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {5973#true} is VALID [2022-02-20 23:46:12,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {5973#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,030 INFO L290 TraceCheckUtils]: 3: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,030 INFO L290 TraceCheckUtils]: 4: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,030 INFO L290 TraceCheckUtils]: 5: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,031 INFO L290 TraceCheckUtils]: 6: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,031 INFO L290 TraceCheckUtils]: 7: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,032 INFO L290 TraceCheckUtils]: 8: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {6003#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,032 INFO L290 TraceCheckUtils]: 9: Hoare triple {6003#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6003#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,034 INFO L290 TraceCheckUtils]: 10: Hoare triple {6003#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:46:12,034 INFO L290 TraceCheckUtils]: 11: Hoare triple {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :end_inline_append } true; {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:46:12,035 INFO L290 TraceCheckUtils]: 12: Hoare triple {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:46:12,036 INFO L290 TraceCheckUtils]: 13: Hoare triple {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6020#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,037 INFO L290 TraceCheckUtils]: 14: Hoare triple {6020#(and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {6024#(and (exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_#t~mem4#1.base|))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,038 INFO L290 TraceCheckUtils]: 15: Hoare triple {6024#(and (exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (_ bv1 1)) (_ bv0 1)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_#t~mem4#1.base|))) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:46:12,039 INFO L290 TraceCheckUtils]: 16: Hoare triple {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:46:12,039 INFO L290 TraceCheckUtils]: 17: Hoare triple {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:46:12,040 INFO L290 TraceCheckUtils]: 18: Hoare triple {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} assume append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32; {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} is VALID [2022-02-20 23:46:12,040 INFO L290 TraceCheckUtils]: 19: Hoare triple {6028#(and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1))))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L533 {6041#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|)))} is VALID [2022-02-20 23:46:12,041 INFO L290 TraceCheckUtils]: 20: Hoare triple {6041#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|)))} assume !(1bv1 == #valid[append_#t~mem6#1.base]); {5974#false} is VALID [2022-02-20 23:46:12,041 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:12,041 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:12,175 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 32 treesize of output 28 [2022-02-20 23:46:12,273 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:12,273 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 27 [2022-02-20 23:46:12,328 INFO L290 TraceCheckUtils]: 20: Hoare triple {6041#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|)))} assume !(1bv1 == #valid[append_#t~mem6#1.base]); {5974#false} is VALID [2022-02-20 23:46:12,329 INFO L290 TraceCheckUtils]: 19: Hoare triple {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L533 {6041#(= (_ bv0 1) (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_append_#t~mem6#1.base|)))} is VALID [2022-02-20 23:46:12,329 INFO L290 TraceCheckUtils]: 18: Hoare triple {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} assume append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32; {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,329 INFO L290 TraceCheckUtils]: 17: Hoare triple {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,330 INFO L290 TraceCheckUtils]: 16: Hoare triple {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,331 INFO L290 TraceCheckUtils]: 15: Hoare triple {6061#(= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|)) (_ bv0 1))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {6048#(= (_ bv0 1) (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (_ bv1 1)))} is VALID [2022-02-20 23:46:12,332 INFO L290 TraceCheckUtils]: 14: Hoare triple {6065#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (_ bv1 1)) (_ bv0 1))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {6061#(= (bvadd (_ bv1 1) (select |#valid| |ULTIMATE.start_append_#t~mem4#1.base|)) (_ bv0 1))} is VALID [2022-02-20 23:46:12,333 INFO L290 TraceCheckUtils]: 13: Hoare triple {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6065#(= (bvadd (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (_ bv1 1)) (_ bv0 1))} is VALID [2022-02-20 23:46:12,333 INFO L290 TraceCheckUtils]: 12: Hoare triple {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume !!(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:46:12,333 INFO L290 TraceCheckUtils]: 11: Hoare triple {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} assume { :end_inline_append } true; {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:46:12,335 INFO L290 TraceCheckUtils]: 10: Hoare triple {6078#(or (forall ((v_arrayElimCell_30 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_30)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|)))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {6010#(= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1))} is VALID [2022-02-20 23:46:12,336 INFO L290 TraceCheckUtils]: 9: Hoare triple {6078#(or (forall ((v_arrayElimCell_30 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_30)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6078#(or (forall ((v_arrayElimCell_30 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_30)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|)))} is VALID [2022-02-20 23:46:12,336 INFO L290 TraceCheckUtils]: 8: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {6078#(or (forall ((v_arrayElimCell_30 (_ BitVec 32))) (= (_ bv0 1) (bvadd (bvneg (select |#valid| v_arrayElimCell_30)) (_ bv1 1)))) (and (= (_ bv0 1) (bvadd (_ bv1 1) (bvneg (select |#valid| |ULTIMATE.start_append_~item~0#1.base|)))) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|)))} is VALID [2022-02-20 23:46:12,337 INFO L290 TraceCheckUtils]: 7: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,337 INFO L290 TraceCheckUtils]: 6: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,338 INFO L290 TraceCheckUtils]: 5: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,339 INFO L290 TraceCheckUtils]: 4: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,339 INFO L290 TraceCheckUtils]: 3: Hoare triple {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,340 INFO L290 TraceCheckUtils]: 2: Hoare triple {5973#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {5984#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:12,340 INFO L290 TraceCheckUtils]: 1: Hoare triple {5973#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {5973#true} is VALID [2022-02-20 23:46:12,340 INFO L290 TraceCheckUtils]: 0: Hoare triple {5973#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(14bv32, 2bv32); {5973#true} is VALID [2022-02-20 23:46:12,341 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:12,341 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:12,341 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1629929950] [2022-02-20 23:46:12,341 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1629929950] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:12,341 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:12,341 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8] total 12 [2022-02-20 23:46:12,341 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [260156014] [2022-02-20 23:46:12,341 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:12,341 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:46:12,342 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:12,343 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:46:12,375 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:12,375 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2022-02-20 23:46:12,376 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:12,376 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2022-02-20 23:46:12,376 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=128, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:46:12,376 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:46:14,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,151 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 23:46:14,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:46:14,151 INFO L78 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:46:14,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:14,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:46:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-02-20 23:46:14,152 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:46:14,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 109 transitions. [2022-02-20 23:46:14,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 109 transitions. [2022-02-20 23:46:14,259 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:14,260 INFO L225 Difference]: With dead ends: 116 [2022-02-20 23:46:14,260 INFO L226 Difference]: Without dead ends: 116 [2022-02-20 23:46:14,260 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 2 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=75, Invalid=231, Unknown=0, NotChecked=0, Total=306 [2022-02-20 23:46:14,261 INFO L933 BasicCegarLoop]: 57 mSDtfsCounter, 168 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 437 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 89 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:14,261 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 325 Invalid, 437 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 336 Invalid, 0 Unknown, 89 Unchecked, 0.5s Time] [2022-02-20 23:46:14,261 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2022-02-20 23:46:14,262 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 98. [2022-02-20 23:46:14,262 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:14,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 116 states. Second operand has 98 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,263 INFO L74 IsIncluded]: Start isIncluded. First operand 116 states. Second operand has 98 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,263 INFO L87 Difference]: Start difference. First operand 116 states. Second operand has 98 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,264 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 23:46:14,264 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-02-20 23:46:14,265 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,265 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,265 INFO L74 IsIncluded]: Start isIncluded. First operand has 98 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:46:14,265 INFO L87 Difference]: Start difference. First operand has 98 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 116 states. [2022-02-20 23:46:14,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:14,266 INFO L93 Difference]: Finished difference Result 116 states and 122 transitions. [2022-02-20 23:46:14,267 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 122 transitions. [2022-02-20 23:46:14,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:14,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:14,267 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:14,267 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:14,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 69 states have (on average 1.4927536231884058) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:14,268 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2022-02-20 23:46:14,268 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 21 [2022-02-20 23:46:14,268 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:14,269 INFO L470 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2022-02-20 23:46:14,269 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 2.5833333333333335) internal successors, (31), 13 states have internal predecessors, (31), 0 states have call successors, (0), 0 states 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:46:14,269 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2022-02-20 23:46:14,269 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:46:14,269 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:14,269 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:14,276 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:14,476 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:46:14,476 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:46:14,476 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:14,476 INFO L85 PathProgramCache]: Analyzing trace with hash 717052318, now seen corresponding path program 1 times [2022-02-20 23:46:14,476 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:14,476 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [16235560] [2022-02-20 23:46:14,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:14,477 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:14,477 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:14,478 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:46:14,483 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2022-02-20 23:46:14,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,566 INFO L263 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 23:46:14,581 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:14,582 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:14,674 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:46:14,740 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 11 treesize of output 7 [2022-02-20 23:46:14,747 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 11 treesize of output 7 [2022-02-20 23:46:14,811 INFO L356 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2022-02-20 23:46:14,811 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2022-02-20 23:46:14,820 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 18 [2022-02-20 23:46:14,912 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:46:14,912 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 23 treesize of output 18 [2022-02-20 23:46:14,930 INFO L356 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2022-02-20 23:46:14,930 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 24 [2022-02-20 23:46:15,097 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:46:15,097 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 16 [2022-02-20 23:46:15,112 INFO L356 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2022-02-20 23:46:15,112 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 10 [2022-02-20 23:46:15,134 INFO L290 TraceCheckUtils]: 0: Hoare triple {6564#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(14bv32, 2bv32); {6564#true} is VALID [2022-02-20 23:46:15,135 INFO L290 TraceCheckUtils]: 1: Hoare triple {6564#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {6564#true} is VALID [2022-02-20 23:46:15,135 INFO L290 TraceCheckUtils]: 2: Hoare triple {6564#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:15,136 INFO L290 TraceCheckUtils]: 3: Hoare triple {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:15,136 INFO L290 TraceCheckUtils]: 4: Hoare triple {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:15,137 INFO L290 TraceCheckUtils]: 5: Hoare triple {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:15,137 INFO L290 TraceCheckUtils]: 6: Hoare triple {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:15,137 INFO L290 TraceCheckUtils]: 7: Hoare triple {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:15,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {6575#(and (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {6594#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:15,138 INFO L290 TraceCheckUtils]: 9: Hoare triple {6594#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6594#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} is VALID [2022-02-20 23:46:15,140 INFO L290 TraceCheckUtils]: 10: Hoare triple {6594#(and (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)) (= |ULTIMATE.start_append_~item~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (= (select |#valid| |ULTIMATE.start_append_~item~0#1.base|) (_ bv1 1)))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {6601#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:15,141 INFO L290 TraceCheckUtils]: 11: Hoare triple {6601#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :end_inline_append } true; {6601#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:15,142 INFO L290 TraceCheckUtils]: 12: Hoare triple {6601#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume !!(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6601#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} is VALID [2022-02-20 23:46:15,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {6601#(and (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (_ bv1 1)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6611#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 23:46:15,148 INFO L290 TraceCheckUtils]: 14: Hoare triple {6611#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {6615#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= |ULTIMATE.start_append_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_#t~mem4#1.base|)))} is VALID [2022-02-20 23:46:15,150 INFO L290 TraceCheckUtils]: 15: Hoare triple {6615#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= |ULTIMATE.start_append_#t~mem4#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_#t~mem4#1.base|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:46:15,151 INFO L290 TraceCheckUtils]: 16: Hoare triple {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:46:15,153 INFO L290 TraceCheckUtils]: 17: Hoare triple {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:46:15,154 INFO L290 TraceCheckUtils]: 18: Hoare triple {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} assume append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32; {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 23:46:15,155 INFO L290 TraceCheckUtils]: 19: Hoare triple {6619#(exists ((|ULTIMATE.start_append_~plist#1.base| (_ BitVec 32)) (|ULTIMATE.start_append_~plist#1.offset| (_ BitVec 32))) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) |ULTIMATE.start_append_~item~0#1.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvule (_ bv8 32) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|) (_ bv0 32))))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L533 {6632#(and (= |ULTIMATE.start_append_#t~mem6#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)))} is VALID [2022-02-20 23:46:15,155 INFO L290 TraceCheckUtils]: 20: Hoare triple {6632#(and (= |ULTIMATE.start_append_#t~mem6#1.offset| (_ bv0 32)) (bvule (_ bv8 32) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, append_#t~mem6#1.offset)), #length[append_#t~mem6#1.base]) && ~bvule32(~bvadd32(4bv32, append_#t~mem6#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, append_#t~mem6#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, append_#t~mem6#1.offset))); {6565#false} is VALID [2022-02-20 23:46:15,156 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:15,156 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:46:15,724 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 98 treesize of output 94 [2022-02-20 23:46:15,863 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 143 treesize of output 127 [2022-02-20 23:46:16,142 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:46:16,142 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2022-02-20 23:46:16,367 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 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 24 treesize of output 22 [2022-02-20 23:46:16,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {6636#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem6#1.offset|) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_#t~mem6#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem6#1.offset|)))} assume !((~bvule32(~bvadd32(4bv32, ~bvadd32(4bv32, append_#t~mem6#1.offset)), #length[append_#t~mem6#1.base]) && ~bvule32(~bvadd32(4bv32, append_#t~mem6#1.offset), ~bvadd32(4bv32, ~bvadd32(4bv32, append_#t~mem6#1.offset)))) && ~bvule32(0bv32, ~bvadd32(4bv32, append_#t~mem6#1.offset))); {6565#false} is VALID [2022-02-20 23:46:16,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} SUMMARY for call append_#t~mem6#1.base, append_#t~mem6#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L533 {6636#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem6#1.offset|) (select |#length| |ULTIMATE.start_append_#t~mem6#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_#t~mem6#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem6#1.offset|)))} is VALID [2022-02-20 23:46:16,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} assume append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32; {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:46:16,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:46:16,500 INFO L290 TraceCheckUtils]: 16: Hoare triple {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:46:16,521 INFO L290 TraceCheckUtils]: 15: Hoare triple {6653#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem4#1.offset|) (select |#length| |ULTIMATE.start_append_#t~mem4#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_#t~mem4#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem4#1.offset|)))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {6640#(and (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv4 32)) (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32))) (bvule (bvadd (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|) (_ bv8 32)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) |ULTIMATE.start_append_~item~0#1.offset|))))} is VALID [2022-02-20 23:46:16,551 INFO L290 TraceCheckUtils]: 14: Hoare triple {6657#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {6653#(and (bvule (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem4#1.offset|) (select |#length| |ULTIMATE.start_append_#t~mem4#1.base|)) (bvule (bvadd (_ bv4 32) |ULTIMATE.start_append_#t~mem4#1.offset|) (bvadd (_ bv8 32) |ULTIMATE.start_append_#t~mem4#1.offset|)))} is VALID [2022-02-20 23:46:16,558 INFO L290 TraceCheckUtils]: 13: Hoare triple {6661#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6657#(and (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (select |#length| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_~plist#1.base|) |ULTIMATE.start_append_~plist#1.offset|))))} is VALID [2022-02-20 23:46:16,560 INFO L290 TraceCheckUtils]: 12: Hoare triple {6661#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} assume !!(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {6661#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} is VALID [2022-02-20 23:46:16,561 INFO L290 TraceCheckUtils]: 11: Hoare triple {6661#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} assume { :end_inline_append } true; {6661#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} is VALID [2022-02-20 23:46:16,593 INFO L290 TraceCheckUtils]: 10: Hoare triple {6671#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) |ULTIMATE.start_append_~item~0#1.base|))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {6661#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (bvule (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv8 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} is VALID [2022-02-20 23:46:16,594 INFO L290 TraceCheckUtils]: 9: Hoare triple {6671#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) |ULTIMATE.start_append_~item~0#1.base|))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6671#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) |ULTIMATE.start_append_~item~0#1.base|))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} is VALID [2022-02-20 23:46:16,602 INFO L290 TraceCheckUtils]: 8: Hoare triple {6678#(or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)))) (forall ((|ULTIMATE.start_append_~item~0#1.base| (_ BitVec 32))) (not (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)))))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {6671#(forall ((|v_ULTIMATE.start_append_~item~0#1.base_18| (_ BitVec 32))) (or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (forall ((v_ArrVal_297 (_ BitVec 32))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select (store |#length| |v_ULTIMATE.start_append_~item~0#1.base_18| v_ArrVal_297) |ULTIMATE.start_append_~item~0#1.base|))) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)))) (not (= (select |#valid| |v_ULTIMATE.start_append_~item~0#1.base_18|) (_ bv0 1)))))} is VALID [2022-02-20 23:46:16,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {6678#(or (and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)))) (forall ((|ULTIMATE.start_append_~item~0#1.base| (_ BitVec 32))) (not (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32)) (select |#length| |ULTIMATE.start_append_~item~0#1.base|)))))} is VALID [2022-02-20 23:46:16,604 INFO L290 TraceCheckUtils]: 6: Hoare triple {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:46:16,604 INFO L290 TraceCheckUtils]: 5: Hoare triple {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:46:16,604 INFO L290 TraceCheckUtils]: 4: Hoare triple {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:46:16,605 INFO L290 TraceCheckUtils]: 3: Hoare triple {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:46:16,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {6564#true} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {6682#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|) (bvule (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32)) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv8 32))))} is VALID [2022-02-20 23:46:16,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {6564#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {6564#true} is VALID [2022-02-20 23:46:16,606 INFO L290 TraceCheckUtils]: 0: Hoare triple {6564#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(14bv32, 2bv32); {6564#true} is VALID [2022-02-20 23:46:16,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:46:16,606 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:16,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [16235560] [2022-02-20 23:46:16,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [16235560] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:46:16,606 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 23:46:16,606 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 9] total 16 [2022-02-20 23:46:16,606 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [878224243] [2022-02-20 23:46:16,606 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 23:46:16,606 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:46:16,607 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:16,607 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:46:16,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:16,732 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 17 states [2022-02-20 23:46:16,732 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:16,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2022-02-20 23:46:16,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=229, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:46:16,733 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:46:19,738 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:19,738 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-02-20 23:46:19,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:46:19,739 INFO L78 Accepts]: Start accepts. Automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 23:46:19,739 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:46:19,739 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:46:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-02-20 23:46:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:46:19,741 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 160 transitions. [2022-02-20 23:46:19,741 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 160 transitions. [2022-02-20 23:46:20,120 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 160 edges. 160 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:20,125 INFO L225 Difference]: With dead ends: 160 [2022-02-20 23:46:20,126 INFO L226 Difference]: Without dead ends: 160 [2022-02-20 23:46:20,126 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 50 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=90, Invalid=372, Unknown=0, NotChecked=0, Total=462 [2022-02-20 23:46:20,126 INFO L933 BasicCegarLoop]: 50 mSDtfsCounter, 194 mSDsluCounter, 472 mSDsCounter, 0 mSdLazyCounter, 270 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 194 SdHoareTripleChecker+Valid, 522 SdHoareTripleChecker+Invalid, 538 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 260 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2022-02-20 23:46:20,126 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [194 Valid, 522 Invalid, 538 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 270 Invalid, 0 Unknown, 260 Unchecked, 0.7s Time] [2022-02-20 23:46:20,127 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2022-02-20 23:46:20,128 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 106. [2022-02-20 23:46:20,128 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:46:20,129 INFO L82 GeneralOperation]: Start isEquivalent. First operand 160 states. Second operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:46:20,129 INFO L74 IsIncluded]: Start isIncluded. First operand 160 states. Second operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:46:20,129 INFO L87 Difference]: Start difference. First operand 160 states. Second operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:46:20,131 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,131 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-02-20 23:46:20,131 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-02-20 23:46:20,131 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,132 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,132 INFO L74 IsIncluded]: Start isIncluded. First operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:46:20,132 INFO L87 Difference]: Start difference. First operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand 160 states. [2022-02-20 23:46:20,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:46:20,134 INFO L93 Difference]: Finished difference Result 160 states and 169 transitions. [2022-02-20 23:46:20,134 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 169 transitions. [2022-02-20 23:46:20,134 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:46:20,134 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:46:20,134 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:46:20,134 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:46:20,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 77 states have (on average 1.4545454545454546) internal successors, (112), 105 states have internal predecessors, (112), 0 states have call successors, (0), 0 states 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:46:20,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 112 transitions. [2022-02-20 23:46:20,136 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 112 transitions. Word has length 21 [2022-02-20 23:46:20,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:46:20,136 INFO L470 AbstractCegarLoop]: Abstraction has 106 states and 112 transitions. [2022-02-20 23:46:20,136 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 17 states, 16 states have (on average 2.5) internal successors, (40), 17 states have internal predecessors, (40), 0 states have call successors, (0), 0 states 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:46:20,136 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 112 transitions. [2022-02-20 23:46:20,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:46:20,136 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:46:20,137 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:46:20,155 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2022-02-20 23:46:20,344 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 23:46:20,344 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 51 more)] === [2022-02-20 23:46:20,344 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:46:20,345 INFO L85 PathProgramCache]: Analyzing trace with hash -1488018422, now seen corresponding path program 1 times [2022-02-20 23:46:20,345 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 23:46:20,345 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228720883] [2022-02-20 23:46:20,345 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:46:20,345 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 23:46:20,345 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 23:46:20,346 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 23:46:20,355 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2022-02-20 23:46:20,439 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,443 INFO L263 TraceCheckSpWp]: Trace formula consists of 138 conjuncts, 23 conjunts are in the unsatisfiable core [2022-02-20 23:46:20,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:46:20,837 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:46:20,843 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:46:20,866 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:46:20,867 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:46:20,961 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 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:46:21,039 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2022-02-20 23:46:21,045 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 11 treesize of output 7 [2022-02-20 23:46:21,145 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 25 treesize of output 17 [2022-02-20 23:46:21,198 INFO L356 Elim1Store]: treesize reduction 13, result has 7.1 percent of original size [2022-02-20 23:46:21,198 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 14 [2022-02-20 23:46:21,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {7300#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(14bv32, 2bv32); {7300#true} is VALID [2022-02-20 23:46:21,225 INFO L290 TraceCheckUtils]: 1: Hoare triple {7300#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~nondet10#1, main_#t~mem11#1.base, main_#t~mem11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1.base, main_#t~mem14#1.offset, main_#t~mem15#1.base, main_#t~mem15#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~next~0#1.base, main_~next~0#1.offset, main_#t~mem17#1.base, main_#t~mem17#1.offset, main_#t~mem18#1.base, main_#t~mem18#1.offset, main_#t~mem19#1.base, main_#t~mem19#1.offset, main_#t~mem20#1.base, main_#t~mem20#1.offset, main_#t~mem21#1.base, main_#t~mem21#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_#t~mem22#1.base, main_#t~mem22#1.offset, main_~#list~0#1.base, main_~#list~0#1.offset;call main_~#list~0#1.base, main_~#list~0#1.offset := #Ultimate.allocOnStack(4bv32);call write~init~$Pointer$(0bv32, 0bv32, main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); {7308#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} is VALID [2022-02-20 23:46:21,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {7308#(= (select |#valid| |ULTIMATE.start_main_~#list~0#1.base|) (_ bv1 1))} assume { :begin_inline_append } true;append_#in~plist#1.base, append_#in~plist#1.offset := main_~#list~0#1.base, main_~#list~0#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset, append_#t~mem4#1.base, append_#t~mem4#1.offset, append_#t~mem5#1.base, append_#t~mem5#1.offset, append_#t~ite9#1.base, append_#t~ite9#1.offset, append_#t~mem6#1.base, append_#t~mem6#1.offset, append_#t~mem7#1.base, append_#t~mem7#1.offset, append_#t~malloc8#1.base, append_#t~malloc8#1.offset, append_~plist#1.base, append_~plist#1.offset, append_~item~0#1.base, append_~item~0#1.offset;append_~plist#1.base, append_~plist#1.offset := append_#in~plist#1.base, append_#in~plist#1.offset;call append_#t~malloc3#1.base, append_#t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);append_~item~0#1.base, append_~item~0#1.offset := append_#t~malloc3#1.base, append_#t~malloc3#1.offset;havoc append_#t~malloc3#1.base, append_#t~malloc3#1.offset; {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,226 INFO L290 TraceCheckUtils]: 3: Hoare triple {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem4#1.base, append_#t~mem4#1.offset := read~$Pointer$(append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L531 {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,227 INFO L290 TraceCheckUtils]: 4: Hoare triple {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~mem4#1.base, append_#t~mem4#1.offset, append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L531-1 {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,227 INFO L290 TraceCheckUtils]: 5: Hoare triple {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem4#1.base, append_#t~mem4#1.offset; {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call append_#t~mem5#1.base, append_#t~mem5#1.offset := read~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, 4bv32); srcloc: L532 {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {7312#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} assume !(append_#t~mem5#1.base != 0bv32 || append_#t~mem5#1.offset != 0bv32);call append_#t~malloc8#1.base, append_#t~malloc8#1.offset := #Ultimate.allocOnHeap(8bv32);append_#t~ite9#1.base, append_#t~ite9#1.offset := append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {7328#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (bvult |ULTIMATE.start_append_#t~ite9#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,236 INFO L290 TraceCheckUtils]: 8: Hoare triple {7328#(and (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (bvult |ULTIMATE.start_append_#t~ite9#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_#t~ite9#1.base, append_#t~ite9#1.offset, append_~item~0#1.base, ~bvadd32(4bv32, append_~item~0#1.offset), 4bv32); srcloc: L532-3 {7332#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:21,237 INFO L290 TraceCheckUtils]: 9: Hoare triple {7332#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} havoc append_#t~mem5#1.base, append_#t~mem5#1.offset;havoc append_#t~ite9#1.base, append_#t~ite9#1.offset;havoc append_#t~mem6#1.base, append_#t~mem6#1.offset;havoc append_#t~mem7#1.base, append_#t~mem7#1.offset;havoc append_#t~malloc8#1.base, append_#t~malloc8#1.offset; {7332#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} is VALID [2022-02-20 23:46:23,245 WARN L290 TraceCheckUtils]: 10: Hoare triple {7332#(and (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_~item~0#1.base|) (bvadd |ULTIMATE.start_append_~item~0#1.offset| (_ bv4 32))) |#StackHeapBarrier|) (= |ULTIMATE.start_main_~#list~0#1.base| |ULTIMATE.start_append_~plist#1.base|) (not (= |ULTIMATE.start_append_~item~0#1.base| |ULTIMATE.start_main_~#list~0#1.base|)) (= |ULTIMATE.start_main_~#list~0#1.offset| |ULTIMATE.start_append_~plist#1.offset|))} SUMMARY for call write~$Pointer$(append_~item~0#1.base, append_~item~0#1.offset, append_~plist#1.base, append_~plist#1.offset, 4bv32); srcloc: L535 {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is UNKNOWN [2022-02-20 23:46:23,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} assume { :end_inline_append } true; {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} assume !(0bv32 != main_#t~nondet10#1);havoc main_#t~nondet10#1; {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,247 INFO L290 TraceCheckUtils]: 13: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem11#1.base, main_#t~mem11#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L540-4 {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,247 INFO L290 TraceCheckUtils]: 14: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} assume main_#t~mem11#1.base != 0bv32 || main_#t~mem11#1.offset != 0bv32;havoc main_#t~mem11#1.base, main_#t~mem11#1.offset; {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L544 {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,248 INFO L290 TraceCheckUtils]: 16: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem13#1.base, main_#t~mem13#1.offset := read~$Pointer$(main_#t~mem12#1.base, main_#t~mem12#1.offset, 4bv32); srcloc: L544-1 {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} main_~next~0#1.base, main_~next~0#1.offset := main_#t~mem13#1.base, main_#t~mem13#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem13#1.base, main_#t~mem13#1.offset; {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} is VALID [2022-02-20 23:46:23,258 INFO L290 TraceCheckUtils]: 18: Hoare triple {7339#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|))) |#StackHeapBarrier|))} SUMMARY for call main_#t~mem14#1.base, main_#t~mem14#1.offset := read~$Pointer$(main_~#list~0#1.base, main_~#list~0#1.offset, 4bv32); srcloc: L545 {7364#(exists ((|ULTIMATE.start_main_~#list~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#list~0#1.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem14#1.offset|)) |#StackHeapBarrier|)))} is VALID [2022-02-20 23:46:23,266 INFO L290 TraceCheckUtils]: 19: Hoare triple {7364#(exists ((|ULTIMATE.start_main_~#list~0#1.base| (_ BitVec 32)) (|ULTIMATE.start_main_~#list~0#1.offset| (_ BitVec 32))) (and (= |ULTIMATE.start_main_#t~mem14#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|) |ULTIMATE.start_main_~#list~0#1.base|)) (bvult (select (select |#memory_$Pointer$.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#list~0#1.base|) |ULTIMATE.start_main_~#list~0#1.offset|)) (bvadd (_ bv4 32) |ULTIMATE.start_main_#t~mem14#1.offset|)) |#StackHeapBarrier|)))} SUMMARY for call main_#t~mem15#1.base, main_#t~mem15#1.offset := read~$Pointer$(main_#t~mem14#1.base, ~bvadd32(4bv32, main_#t~mem14#1.offset), 4bv32); srcloc: L545-1 {7368#(bvult |ULTIMATE.start_main_#t~mem15#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:23,269 INFO L290 TraceCheckUtils]: 20: Hoare triple {7368#(bvult |ULTIMATE.start_main_#t~mem15#1.base| |#StackHeapBarrier|)} assume 0bv32 == main_#t~mem15#1.offset; {7368#(bvult |ULTIMATE.start_main_#t~mem15#1.base| |#StackHeapBarrier|)} is VALID [2022-02-20 23:46:23,269 INFO L290 TraceCheckUtils]: 21: Hoare triple {7368#(bvult |ULTIMATE.start_main_#t~mem15#1.base| |#StackHeapBarrier|)} assume !~bvult32(main_#t~mem15#1.base, #StackHeapBarrier); {7301#false} is VALID [2022-02-20 23:46:23,270 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:46:23,270 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:46:23,270 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 23:46:23,270 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228720883] [2022-02-20 23:46:23,270 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228720883] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:46:23,270 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:46:23,270 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:46:23,270 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1147468988] [2022-02-20 23:46:23,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:46:23,270 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 23:46:23,271 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:46:23,271 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:46:25,310 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 21 inductive. 0 not inductive. 1 times theorem prover too weak to decide inductivity. [2022-02-20 23:46:25,310 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:46:25,311 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 23:46:25,311 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:46:25,311 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:46:25,311 INFO L87 Difference]: Start difference. First operand 106 states and 112 transitions. Second operand has 9 states, 8 states have (on average 2.75) internal successors, (22), 9 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0)