./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext-properties/test-0217_1.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/list-ext-properties/test-0217_1.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 e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:48:30,249 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:48:30,250 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:48:30,268 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:48:30,269 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:48:30,270 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:48:30,271 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:48:30,272 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:48:30,273 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:48:30,273 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:48:30,274 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:48:30,275 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:48:30,275 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:48:30,276 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:48:30,276 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:48:30,277 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:48:30,278 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:48:30,278 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:48:30,279 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:48:30,280 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:48:30,281 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:48:30,282 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:48:30,283 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:48:30,283 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:48:30,285 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:48:30,285 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:48:30,286 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:48:30,286 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:48:30,286 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:48:30,287 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:48:30,287 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:48:30,288 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:48:30,288 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:48:30,289 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:48:30,289 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:48:30,290 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:48:30,290 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:48:30,290 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:48:30,290 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:48:30,291 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:48:30,291 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:48:30,292 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:48:30,305 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:48:30,305 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:48:30,306 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:48:30,306 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:48:30,306 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:48:30,307 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:48:30,307 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:48:30,307 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:48:30,307 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:48:30,308 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:48:30,308 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:48:30,308 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:48:30,308 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:48:30,308 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:48:30,308 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:48:30,308 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:48:30,309 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:48:30,309 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:48:30,309 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:48:30,309 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:48:30,309 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:48:30,309 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:48:30,310 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:48:30,310 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:48:30,310 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:48:30,310 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:30,310 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:48:30,310 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:48:30,310 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:48:30,311 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:48:30,311 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 -> e4aac8fd1b71e0bd84f9ab8e5c238dc6bf3a295fcb9cebe504ba6d0c9a6a7b7a [2022-02-20 23:48:30,478 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:48:30,502 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:48:30,504 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:48:30,505 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:48:30,509 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:48:30,510 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext-properties/test-0217_1.i [2022-02-20 23:48:30,570 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fd682d5/01acb2e18c674ea8bc97595d9b9cb689/FLAGe362ea847 [2022-02-20 23:48:30,906 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:48:30,907 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext-properties/test-0217_1.i [2022-02-20 23:48:30,917 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fd682d5/01acb2e18c674ea8bc97595d9b9cb689/FLAGe362ea847 [2022-02-20 23:48:31,310 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/b2fd682d5/01acb2e18c674ea8bc97595d9b9cb689 [2022-02-20 23:48:31,312 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:48:31,313 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:48:31,314 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:31,315 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:48:31,325 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:48:31,326 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,327 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6aec76c1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31, skipping insertion in model container [2022-02-20 23:48:31,327 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,332 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:48:31,362 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:48:31,627 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:31,644 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:48:31,691 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:48:31,720 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:48:31,721 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31 WrapperNode [2022-02-20 23:48:31,721 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:48:31,722 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:31,722 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:48:31,722 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:48:31,727 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:48:31" (1/1) ... [2022-02-20 23:48:31,738 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:48:31" (1/1) ... [2022-02-20 23:48:31,777 INFO L137 Inliner]: procedures = 181, calls = 47, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 257 [2022-02-20 23:48:31,777 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:48:31,778 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:48:31,778 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:48:31,778 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:48:31,798 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,798 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,802 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,823 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,824 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,827 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:48:31,827 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:48:31,827 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:48:31,828 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:48:31,828 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (1/1) ... [2022-02-20 23:48:31,845 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:48:31,861 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:48:31,874 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:48:31,877 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:48:31,900 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-02-20 23:48:31,900 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:48:31,901 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:48:31,902 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:48:31,902 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:48:31,982 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:48:31,983 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:48:32,427 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:48:32,435 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:48:32,436 INFO L299 CfgBuilder]: Removed 6 assume(true) statements. [2022-02-20 23:48:32,437 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:32 BoogieIcfgContainer [2022-02-20 23:48:32,438 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:48:32,439 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:48:32,439 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:48:32,442 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:48:32,442 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:48:31" (1/3) ... [2022-02-20 23:48:32,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d683341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:32, skipping insertion in model container [2022-02-20 23:48:32,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:48:31" (2/3) ... [2022-02-20 23:48:32,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6d683341 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:48:32, skipping insertion in model container [2022-02-20 23:48:32,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:48:32" (3/3) ... [2022-02-20 23:48:32,447 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0217_1.i [2022-02-20 23:48:32,452 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:48:32,452 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 67 error locations. [2022-02-20 23:48:32,485 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:48:32,496 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:48:32,496 INFO L340 AbstractCegarLoop]: Starting to check reachability of 67 error locations. [2022-02-20 23:48:32,517 INFO L276 IsEmpty]: Start isEmpty. Operand has 174 states, 103 states have (on average 1.9514563106796117) internal successors, (201), 170 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:32,523 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:48:32,523 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:32,524 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:48:32,524 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:32,527 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:32,528 INFO L85 PathProgramCache]: Analyzing trace with hash 1046105098, now seen corresponding path program 1 times [2022-02-20 23:48:32,534 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:32,535 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [494530313] [2022-02-20 23:48:32,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:32,535 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:32,590 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:32,624 INFO L290 TraceCheckUtils]: 0: Hoare triple {177#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {177#true} is VALID [2022-02-20 23:48:32,624 INFO L290 TraceCheckUtils]: 1: Hoare triple {177#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {177#true} is VALID [2022-02-20 23:48:32,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {177#true} assume !true; {178#false} is VALID [2022-02-20 23:48:32,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {178#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {178#false} is VALID [2022-02-20 23:48:32,626 INFO L290 TraceCheckUtils]: 4: Hoare triple {178#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {178#false} is VALID [2022-02-20 23:48:32,626 INFO L290 TraceCheckUtils]: 5: Hoare triple {178#false} assume !(1 == #valid[~#list~0.base]); {178#false} is VALID [2022-02-20 23:48:32,626 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:48:32,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:32,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [494530313] [2022-02-20 23:48:32,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [494530313] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:32,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:32,628 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:32,630 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862512248] [2022-02-20 23:48:32,630 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:32,633 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:48:32,634 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:32,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,643 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:32,644 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:48:32,644 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:32,659 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:48:32,660 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:32,665 INFO L87 Difference]: Start difference. First operand has 174 states, 103 states have (on average 1.9514563106796117) internal successors, (201), 170 states have internal predecessors, (201), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:32,799 INFO L93 Difference]: Finished difference Result 174 states and 198 transitions. [2022-02-20 23:48:32,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:48:32,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2022-02-20 23:48:32,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:32,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2022-02-20 23:48:32,812 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:32,815 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 205 transitions. [2022-02-20 23:48:32,815 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 205 transitions. [2022-02-20 23:48:32,964 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 205 edges. 205 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:32,978 INFO L225 Difference]: With dead ends: 174 [2022-02-20 23:48:32,978 INFO L226 Difference]: Without dead ends: 172 [2022-02-20 23:48:32,980 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:48:32,982 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 198 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:32,983 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:32,995 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 172 states. [2022-02-20 23:48:33,014 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 172 to 172. [2022-02-20 23:48:33,014 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:33,019 INFO L82 GeneralOperation]: Start isEquivalent. First operand 172 states. Second operand has 172 states, 102 states have (on average 1.8823529411764706) internal successors, (192), 168 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,020 INFO L74 IsIncluded]: Start isIncluded. First operand 172 states. Second operand has 172 states, 102 states have (on average 1.8823529411764706) internal successors, (192), 168 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,021 INFO L87 Difference]: Start difference. First operand 172 states. Second operand has 172 states, 102 states have (on average 1.8823529411764706) internal successors, (192), 168 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,036 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,036 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2022-02-20 23:48:33,036 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2022-02-20 23:48:33,038 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,038 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,038 INFO L74 IsIncluded]: Start isIncluded. First operand has 172 states, 102 states have (on average 1.8823529411764706) internal successors, (192), 168 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 172 states. [2022-02-20 23:48:33,039 INFO L87 Difference]: Start difference. First operand has 172 states, 102 states have (on average 1.8823529411764706) internal successors, (192), 168 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 172 states. [2022-02-20 23:48:33,047 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,047 INFO L93 Difference]: Finished difference Result 172 states and 196 transitions. [2022-02-20 23:48:33,047 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2022-02-20 23:48:33,052 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,052 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,052 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:33,053 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:33,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 172 states, 102 states have (on average 1.8823529411764706) internal successors, (192), 168 states have internal predecessors, (192), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 172 states to 172 states and 196 transitions. [2022-02-20 23:48:33,067 INFO L78 Accepts]: Start accepts. Automaton has 172 states and 196 transitions. Word has length 6 [2022-02-20 23:48:33,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:33,067 INFO L470 AbstractCegarLoop]: Abstraction has 172 states and 196 transitions. [2022-02-20 23:48:33,068 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,068 INFO L276 IsEmpty]: Start isEmpty. Operand 172 states and 196 transitions. [2022-02-20 23:48:33,069 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:33,069 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:33,069 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:33,069 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:48:33,069 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:33,070 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:33,070 INFO L85 PathProgramCache]: Analyzing trace with hash 594388414, now seen corresponding path program 1 times [2022-02-20 23:48:33,070 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:33,071 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [968957172] [2022-02-20 23:48:33,072 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:33,072 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:33,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:33,132 INFO L290 TraceCheckUtils]: 0: Hoare triple {871#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {871#true} is VALID [2022-02-20 23:48:33,133 INFO L290 TraceCheckUtils]: 1: Hoare triple {871#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {873#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:48:33,134 INFO L290 TraceCheckUtils]: 2: Hoare triple {873#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {874#|ULTIMATE.start_main_#t~short29#1|} is VALID [2022-02-20 23:48:33,135 INFO L290 TraceCheckUtils]: 3: Hoare triple {874#|ULTIMATE.start_main_#t~short29#1|} assume !main_#t~short29#1; {872#false} is VALID [2022-02-20 23:48:33,135 INFO L290 TraceCheckUtils]: 4: Hoare triple {872#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {872#false} is VALID [2022-02-20 23:48:33,135 INFO L290 TraceCheckUtils]: 5: Hoare triple {872#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {872#false} is VALID [2022-02-20 23:48:33,135 INFO L290 TraceCheckUtils]: 6: Hoare triple {872#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {872#false} is VALID [2022-02-20 23:48:33,136 INFO L290 TraceCheckUtils]: 7: Hoare triple {872#false} assume !(1 == #valid[~#list~0.base]); {872#false} is VALID [2022-02-20 23:48:33,139 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:48:33,140 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:33,140 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [968957172] [2022-02-20 23:48:33,141 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [968957172] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:33,141 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:33,141 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:33,141 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1004071749] [2022-02-20 23:48:33,141 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:33,142 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:33,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:33,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,148 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,148 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:33,148 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:33,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:33,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:33,149 INFO L87 Difference]: Start difference. First operand 172 states and 196 transitions. Second operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,543 INFO L93 Difference]: Finished difference Result 339 states and 387 transitions. [2022-02-20 23:48:33,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:33,544 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:33,544 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:33,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2022-02-20 23:48:33,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,552 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 388 transitions. [2022-02-20 23:48:33,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 388 transitions. [2022-02-20 23:48:33,871 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 388 edges. 388 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,880 INFO L225 Difference]: With dead ends: 339 [2022-02-20 23:48:33,880 INFO L226 Difference]: Without dead ends: 339 [2022-02-20 23:48:33,881 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:48:33,882 INFO L933 BasicCegarLoop]: 269 mSDtfsCounter, 185 mSDsluCounter, 458 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 187 SdHoareTripleChecker+Valid, 727 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:33,882 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [187 Valid, 727 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:33,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2022-02-20 23:48:33,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 174. [2022-02-20 23:48:33,889 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:33,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 339 states. Second operand has 174 states, 104 states have (on average 1.8653846153846154) internal successors, (194), 170 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,890 INFO L74 IsIncluded]: Start isIncluded. First operand 339 states. Second operand has 174 states, 104 states have (on average 1.8653846153846154) internal successors, (194), 170 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,890 INFO L87 Difference]: Start difference. First operand 339 states. Second operand has 174 states, 104 states have (on average 1.8653846153846154) internal successors, (194), 170 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,901 INFO L93 Difference]: Finished difference Result 339 states and 387 transitions. [2022-02-20 23:48:33,901 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2022-02-20 23:48:33,902 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,902 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,902 INFO L74 IsIncluded]: Start isIncluded. First operand has 174 states, 104 states have (on average 1.8653846153846154) internal successors, (194), 170 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 339 states. [2022-02-20 23:48:33,903 INFO L87 Difference]: Start difference. First operand has 174 states, 104 states have (on average 1.8653846153846154) internal successors, (194), 170 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Second operand 339 states. [2022-02-20 23:48:33,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:33,913 INFO L93 Difference]: Finished difference Result 339 states and 387 transitions. [2022-02-20 23:48:33,913 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 387 transitions. [2022-02-20 23:48:33,914 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:33,914 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:33,914 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:33,914 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:33,915 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 174 states, 104 states have (on average 1.8653846153846154) internal successors, (194), 170 states have internal predecessors, (194), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:48:33,919 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 174 states to 174 states and 198 transitions. [2022-02-20 23:48:33,919 INFO L78 Accepts]: Start accepts. Automaton has 174 states and 198 transitions. Word has length 8 [2022-02-20 23:48:33,919 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:33,920 INFO L470 AbstractCegarLoop]: Abstraction has 174 states and 198 transitions. [2022-02-20 23:48:33,920 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,920 INFO L276 IsEmpty]: Start isEmpty. Operand 174 states and 198 transitions. [2022-02-20 23:48:33,920 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:33,920 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:33,920 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:33,921 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:48:33,921 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:33,921 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:33,921 INFO L85 PathProgramCache]: Analyzing trace with hash 592541372, now seen corresponding path program 1 times [2022-02-20 23:48:33,922 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:33,922 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849364601] [2022-02-20 23:48:33,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:33,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:33,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:33,972 INFO L290 TraceCheckUtils]: 0: Hoare triple {2070#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,972 INFO L290 TraceCheckUtils]: 1: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,973 INFO L290 TraceCheckUtils]: 2: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} main_#t~short29#1 := main_~i~0#1 < 3; {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,974 INFO L290 TraceCheckUtils]: 3: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,974 INFO L290 TraceCheckUtils]: 4: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,975 INFO L290 TraceCheckUtils]: 5: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,975 INFO L290 TraceCheckUtils]: 6: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:48:33,976 INFO L290 TraceCheckUtils]: 7: Hoare triple {2072#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(1 == #valid[~#list~0.base]); {2071#false} is VALID [2022-02-20 23:48:33,976 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:48:33,976 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:33,977 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849364601] [2022-02-20 23:48:33,977 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849364601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:33,977 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:33,977 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-20 23:48:33,977 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1800347449] [2022-02-20 23:48:33,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:33,978 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:33,978 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:33,978 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:33,985 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:33,985 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:33,985 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:33,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:33,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:33,986 INFO L87 Difference]: Start difference. First operand 174 states and 198 transitions. Second operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,316 INFO L93 Difference]: Finished difference Result 337 states and 384 transitions. [2022-02-20 23:48:34,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:34,316 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:34,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:34,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-02-20 23:48:34,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 383 transitions. [2022-02-20 23:48:34,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 383 transitions. [2022-02-20 23:48:34,585 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 383 edges. 383 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,592 INFO L225 Difference]: With dead ends: 337 [2022-02-20 23:48:34,593 INFO L226 Difference]: Without dead ends: 337 [2022-02-20 23:48:34,593 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 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:48:34,598 INFO L933 BasicCegarLoop]: 134 mSDtfsCounter, 176 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 131 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 176 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 131 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:34,599 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [176 Valid, 261 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 131 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:34,601 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 337 states. [2022-02-20 23:48:34,616 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 337 to 241. [2022-02-20 23:48:34,617 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:34,618 INFO L82 GeneralOperation]: Start isEquivalent. First operand 337 states. Second operand has 241 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 234 states have internal predecessors, (312), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,619 INFO L74 IsIncluded]: Start isIncluded. First operand 337 states. Second operand has 241 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 234 states have internal predecessors, (312), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,622 INFO L87 Difference]: Start difference. First operand 337 states. Second operand has 241 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 234 states have internal predecessors, (312), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,633 INFO L93 Difference]: Finished difference Result 337 states and 384 transitions. [2022-02-20 23:48:34,634 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 384 transitions. [2022-02-20 23:48:34,634 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 241 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 234 states have internal predecessors, (312), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 337 states. [2022-02-20 23:48:34,636 INFO L87 Difference]: Start difference. First operand has 241 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 234 states have internal predecessors, (312), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Second operand 337 states. [2022-02-20 23:48:34,650 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:34,651 INFO L93 Difference]: Finished difference Result 337 states and 384 transitions. [2022-02-20 23:48:34,651 INFO L276 IsEmpty]: Start isEmpty. Operand 337 states and 384 transitions. [2022-02-20 23:48:34,652 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:34,652 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:34,652 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:34,652 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:34,653 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 168 states have (on average 1.8571428571428572) internal successors, (312), 234 states have internal predecessors, (312), 4 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:48:34,660 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 320 transitions. [2022-02-20 23:48:34,660 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 320 transitions. Word has length 8 [2022-02-20 23:48:34,660 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:34,661 INFO L470 AbstractCegarLoop]: Abstraction has 241 states and 320 transitions. [2022-02-20 23:48:34,661 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.0) internal successors, (8), 2 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,661 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 320 transitions. [2022-02-20 23:48:34,661 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:34,661 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:34,661 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:34,662 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:48:34,662 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:34,663 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:34,663 INFO L85 PathProgramCache]: Analyzing trace with hash 592541373, now seen corresponding path program 1 times [2022-02-20 23:48:34,663 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:34,663 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1372586189] [2022-02-20 23:48:34,663 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:34,663 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:34,695 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:34,805 INFO L290 TraceCheckUtils]: 0: Hoare triple {3327#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,805 INFO L290 TraceCheckUtils]: 1: Hoare triple {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,806 INFO L290 TraceCheckUtils]: 2: Hoare triple {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,806 INFO L290 TraceCheckUtils]: 3: Hoare triple {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,807 INFO L290 TraceCheckUtils]: 4: Hoare triple {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,807 INFO L290 TraceCheckUtils]: 5: Hoare triple {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:34,808 INFO L290 TraceCheckUtils]: 6: Hoare triple {3329#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {3330#(and (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |~#list~0.base|) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} is VALID [2022-02-20 23:48:34,808 INFO L290 TraceCheckUtils]: 7: Hoare triple {3330#(and (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |~#list~0.base|) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {3328#false} is VALID [2022-02-20 23:48:34,809 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:48:34,809 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:34,809 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1372586189] [2022-02-20 23:48:34,809 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1372586189] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:34,809 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:34,809 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:34,810 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1803000540] [2022-02-20 23:48:34,810 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:34,810 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:34,810 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:34,810 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:34,816 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:34,816 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:34,816 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:34,817 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:34,817 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:34,818 INFO L87 Difference]: Start difference. First operand 241 states and 320 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,315 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,316 INFO L93 Difference]: Finished difference Result 392 states and 502 transitions. [2022-02-20 23:48:35,316 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:35,316 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:35,316 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:35,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2022-02-20 23:48:35,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 332 transitions. [2022-02-20 23:48:35,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 332 transitions. [2022-02-20 23:48:35,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 332 edges. 332 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:35,557 INFO L225 Difference]: With dead ends: 392 [2022-02-20 23:48:35,557 INFO L226 Difference]: Without dead ends: 392 [2022-02-20 23:48:35,557 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:48:35,566 INFO L933 BasicCegarLoop]: 171 mSDtfsCounter, 147 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 147 SdHoareTripleChecker+Valid, 440 SdHoareTripleChecker+Invalid, 150 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:35,567 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [147 Valid, 440 Invalid, 150 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:35,568 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-02-20 23:48:35,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 326. [2022-02-20 23:48:35,575 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:35,576 INFO L82 GeneralOperation]: Start isEquivalent. First operand 392 states. Second operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,577 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,577 INFO L87 Difference]: Start difference. First operand 392 states. Second operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,605 INFO L93 Difference]: Finished difference Result 392 states and 502 transitions. [2022-02-20 23:48:35,605 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 502 transitions. [2022-02-20 23:48:35,606 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:35,606 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:35,607 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 392 states. [2022-02-20 23:48:35,608 INFO L87 Difference]: Start difference. First operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 392 states. [2022-02-20 23:48:35,629 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:35,629 INFO L93 Difference]: Finished difference Result 392 states and 502 transitions. [2022-02-20 23:48:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 502 transitions. [2022-02-20 23:48:35,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:35,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:35,630 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:35,631 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:35,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:35,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 465 transitions. [2022-02-20 23:48:35,648 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 465 transitions. Word has length 8 [2022-02-20 23:48:35,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:35,648 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 465 transitions. [2022-02-20 23:48:35,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,649 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 465 transitions. [2022-02-20 23:48:35,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 23:48:35,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:35,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:35,649 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:48:35,649 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:35,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:35,650 INFO L85 PathProgramCache]: Analyzing trace with hash 592541435, now seen corresponding path program 1 times [2022-02-20 23:48:35,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:35,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [544637487] [2022-02-20 23:48:35,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:35,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:35,679 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:35,754 INFO L290 TraceCheckUtils]: 0: Hoare triple {4837#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,755 INFO L290 TraceCheckUtils]: 1: Hoare triple {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,756 INFO L290 TraceCheckUtils]: 2: Hoare triple {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,756 INFO L290 TraceCheckUtils]: 3: Hoare triple {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,756 INFO L290 TraceCheckUtils]: 4: Hoare triple {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,757 INFO L290 TraceCheckUtils]: 5: Hoare triple {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:35,757 INFO L290 TraceCheckUtils]: 6: Hoare triple {4839#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet41#1);havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {4840#(and (<= (* ~unnamed1~0~LIST_END 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) (= (select |#length| |~#list~0.base|) 8) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)))} is VALID [2022-02-20 23:48:35,758 INFO L290 TraceCheckUtils]: 7: Hoare triple {4840#(and (<= (* ~unnamed1~0~LIST_END 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) (= (select |#length| |~#list~0.base|) 8) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_END 4)))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {4838#false} is VALID [2022-02-20 23:48:35,758 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:48:35,758 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:35,759 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [544637487] [2022-02-20 23:48:35,759 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [544637487] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:35,759 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:35,759 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:35,759 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1024469902] [2022-02-20 23:48:35,759 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:35,759 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:35,760 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:35,760 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:35,766 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:35,766 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:35,766 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:35,767 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:35,767 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:35,767 INFO L87 Difference]: Start difference. First operand 326 states and 465 transitions. Second operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,183 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,184 INFO L93 Difference]: Finished difference Result 391 states and 500 transitions. [2022-02-20 23:48:36,184 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:36,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 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 8 [2022-02-20 23:48:36,184 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:36,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,187 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2022-02-20 23:48:36,188 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,190 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 331 transitions. [2022-02-20 23:48:36,195 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 331 transitions. [2022-02-20 23:48:36,485 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 331 edges. 331 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:36,492 INFO L225 Difference]: With dead ends: 391 [2022-02-20 23:48:36,492 INFO L226 Difference]: Without dead ends: 391 [2022-02-20 23:48:36,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 0 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:48:36,493 INFO L933 BasicCegarLoop]: 185 mSDtfsCounter, 129 mSDsluCounter, 269 mSDsCounter, 0 mSdLazyCounter, 153 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 454 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 153 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:36,493 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [129 Valid, 454 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 153 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 391 states. [2022-02-20 23:48:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 391 to 326. [2022-02-20 23:48:36,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:36,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 391 states. Second operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,499 INFO L74 IsIncluded]: Start isIncluded. First operand 391 states. Second operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,499 INFO L87 Difference]: Start difference. First operand 391 states. Second operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,507 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,507 INFO L93 Difference]: Finished difference Result 391 states and 500 transitions. [2022-02-20 23:48:36,507 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 500 transitions. [2022-02-20 23:48:36,508 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,508 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,509 INFO L74 IsIncluded]: Start isIncluded. First operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 391 states. [2022-02-20 23:48:36,509 INFO L87 Difference]: Start difference. First operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 391 states. [2022-02-20 23:48:36,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,517 INFO L93 Difference]: Finished difference Result 391 states and 500 transitions. [2022-02-20 23:48:36,518 INFO L276 IsEmpty]: Start isEmpty. Operand 391 states and 500 transitions. [2022-02-20 23:48:36,518 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:36,518 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:36,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:36,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:36,519 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 326 states, 247 states have (on average 1.8178137651821862) internal successors, (449), 315 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:36,524 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 326 states to 326 states and 465 transitions. [2022-02-20 23:48:36,525 INFO L78 Accepts]: Start accepts. Automaton has 326 states and 465 transitions. Word has length 8 [2022-02-20 23:48:36,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:36,525 INFO L470 AbstractCegarLoop]: Abstraction has 326 states and 465 transitions. [2022-02-20 23:48:36,525 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.6666666666666665) internal successors, (8), 3 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,525 INFO L276 IsEmpty]: Start isEmpty. Operand 326 states and 465 transitions. [2022-02-20 23:48:36,526 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:48:36,526 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:36,526 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:36,526 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:48:36,526 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:36,526 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:36,527 INFO L85 PathProgramCache]: Analyzing trace with hash 84699063, now seen corresponding path program 1 times [2022-02-20 23:48:36,527 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:36,527 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [989914815] [2022-02-20 23:48:36,527 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:36,527 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:36,540 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:36,551 INFO L290 TraceCheckUtils]: 0: Hoare triple {6344#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {6344#true} is VALID [2022-02-20 23:48:36,552 INFO L290 TraceCheckUtils]: 1: Hoare triple {6344#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,552 INFO L290 TraceCheckUtils]: 2: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,552 INFO L290 TraceCheckUtils]: 3: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,553 INFO L290 TraceCheckUtils]: 4: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,553 INFO L290 TraceCheckUtils]: 5: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,553 INFO L290 TraceCheckUtils]: 6: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,554 INFO L290 TraceCheckUtils]: 7: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,554 INFO L290 TraceCheckUtils]: 8: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} is VALID [2022-02-20 23:48:36,554 INFO L290 TraceCheckUtils]: 9: Hoare triple {6346#(= |ULTIMATE.start_main_~length~0#1| 0)} assume !!(main_~length~0#1 > 0); {6345#false} is VALID [2022-02-20 23:48:36,555 INFO L290 TraceCheckUtils]: 10: Hoare triple {6345#false} assume !(1 == #valid[main_~cursor~1#1.base]); {6345#false} is VALID [2022-02-20 23:48:36,555 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:48:36,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:36,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [989914815] [2022-02-20 23:48:36,555 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [989914815] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:36,555 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:36,555 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:36,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1461968687] [2022-02-20 23:48:36,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:36,556 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:36,556 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:36,556 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,563 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:48:36,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:36,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:36,564 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:36,564 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:36,564 INFO L87 Difference]: Start difference. First operand 326 states and 465 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:36,762 INFO L93 Difference]: Finished difference Result 467 states and 621 transitions. [2022-02-20 23:48:36,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:36,763 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:48:36,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:36,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-02-20 23:48:36,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:36,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 377 transitions. [2022-02-20 23:48:36,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 377 transitions. [2022-02-20 23:48:37,035 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,043 INFO L225 Difference]: With dead ends: 467 [2022-02-20 23:48:37,044 INFO L226 Difference]: Without dead ends: 467 [2022-02-20 23:48:37,044 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:37,044 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 167 mSDsluCounter, 189 mSDsCounter, 0 mSdLazyCounter, 9 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 384 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 9 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:37,045 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [169 Valid, 384 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 9 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:37,045 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 467 states. [2022-02-20 23:48:37,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 467 to 328. [2022-02-20 23:48:37,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:37,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 467 states. Second operand has 328 states, 249 states have (on average 1.8032128514056225) internal successors, (449), 317 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,051 INFO L74 IsIncluded]: Start isIncluded. First operand 467 states. Second operand has 328 states, 249 states have (on average 1.8032128514056225) internal successors, (449), 317 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,051 INFO L87 Difference]: Start difference. First operand 467 states. Second operand has 328 states, 249 states have (on average 1.8032128514056225) internal successors, (449), 317 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,063 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,063 INFO L93 Difference]: Finished difference Result 467 states and 621 transitions. [2022-02-20 23:48:37,064 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 621 transitions. [2022-02-20 23:48:37,064 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,064 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,065 INFO L74 IsIncluded]: Start isIncluded. First operand has 328 states, 249 states have (on average 1.8032128514056225) internal successors, (449), 317 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 467 states. [2022-02-20 23:48:37,066 INFO L87 Difference]: Start difference. First operand has 328 states, 249 states have (on average 1.8032128514056225) internal successors, (449), 317 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 467 states. [2022-02-20 23:48:37,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,076 INFO L93 Difference]: Finished difference Result 467 states and 621 transitions. [2022-02-20 23:48:37,076 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 621 transitions. [2022-02-20 23:48:37,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,077 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:37,077 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:37,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 328 states, 249 states have (on average 1.8032128514056225) internal successors, (449), 317 states have internal predecessors, (449), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,083 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 328 states to 328 states and 465 transitions. [2022-02-20 23:48:37,084 INFO L78 Accepts]: Start accepts. Automaton has 328 states and 465 transitions. Word has length 11 [2022-02-20 23:48:37,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:37,084 INFO L470 AbstractCegarLoop]: Abstraction has 328 states and 465 transitions. [2022-02-20 23:48:37,084 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,084 INFO L276 IsEmpty]: Start isEmpty. Operand 328 states and 465 transitions. [2022-02-20 23:48:37,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 23:48:37,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:37,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:48:37,085 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:37,085 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,086 INFO L85 PathProgramCache]: Analyzing trace with hash -1669297564, now seen corresponding path program 1 times [2022-02-20 23:48:37,086 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,086 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1896855091] [2022-02-20 23:48:37,086 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,086 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,095 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,104 INFO L290 TraceCheckUtils]: 0: Hoare triple {8078#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {8078#true} is VALID [2022-02-20 23:48:37,105 INFO L290 TraceCheckUtils]: 1: Hoare triple {8078#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,105 INFO L290 TraceCheckUtils]: 2: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#t~short29#1 := main_~i~0#1 < 3; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,106 INFO L290 TraceCheckUtils]: 3: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,106 INFO L290 TraceCheckUtils]: 4: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,107 INFO L290 TraceCheckUtils]: 5: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,107 INFO L290 TraceCheckUtils]: 6: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,107 INFO L290 TraceCheckUtils]: 7: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,108 INFO L290 TraceCheckUtils]: 8: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,108 INFO L290 TraceCheckUtils]: 9: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(main_~length~0#1 > 0); {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,109 INFO L290 TraceCheckUtils]: 10: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:48:37,109 INFO L290 TraceCheckUtils]: 11: Hoare triple {8080#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {8079#false} is VALID [2022-02-20 23:48:37,109 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:48:37,109 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,109 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1896855091] [2022-02-20 23:48:37,109 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1896855091] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,110 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,110 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:37,110 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1813564783] [2022-02-20 23:48:37,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,110 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-02-20 23:48:37,110 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,118 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,118 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:37,118 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,118 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:37,119 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:37,119 INFO L87 Difference]: Start difference. First operand 328 states and 465 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,386 INFO L93 Difference]: Finished difference Result 383 states and 518 transitions. [2022-02-20 23:48:37,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:37,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 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 12 [2022-02-20 23:48:37,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:37,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,389 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2022-02-20 23:48:37,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 291 transitions. [2022-02-20 23:48:37,391 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 291 transitions. [2022-02-20 23:48:37,578 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 291 edges. 291 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:37,584 INFO L225 Difference]: With dead ends: 383 [2022-02-20 23:48:37,584 INFO L226 Difference]: Without dead ends: 376 [2022-02-20 23:48:37,584 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:48:37,585 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 77 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 299 SdHoareTripleChecker+Invalid, 94 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:37,585 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [79 Valid, 299 Invalid, 94 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:37,585 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 376 states. [2022-02-20 23:48:37,589 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 376 to 325. [2022-02-20 23:48:37,590 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:37,590 INFO L82 GeneralOperation]: Start isEquivalent. First operand 376 states. Second operand has 325 states, 246 states have (on average 1.8048780487804879) internal successors, (444), 314 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,591 INFO L74 IsIncluded]: Start isIncluded. First operand 376 states. Second operand has 325 states, 246 states have (on average 1.8048780487804879) internal successors, (444), 314 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,592 INFO L87 Difference]: Start difference. First operand 376 states. Second operand has 325 states, 246 states have (on average 1.8048780487804879) internal successors, (444), 314 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,598 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,599 INFO L93 Difference]: Finished difference Result 376 states and 510 transitions. [2022-02-20 23:48:37,599 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 510 transitions. [2022-02-20 23:48:37,599 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,599 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,600 INFO L74 IsIncluded]: Start isIncluded. First operand has 325 states, 246 states have (on average 1.8048780487804879) internal successors, (444), 314 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 376 states. [2022-02-20 23:48:37,600 INFO L87 Difference]: Start difference. First operand has 325 states, 246 states have (on average 1.8048780487804879) internal successors, (444), 314 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 376 states. [2022-02-20 23:48:37,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,607 INFO L93 Difference]: Finished difference Result 376 states and 510 transitions. [2022-02-20 23:48:37,608 INFO L276 IsEmpty]: Start isEmpty. Operand 376 states and 510 transitions. [2022-02-20 23:48:37,608 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:37,608 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:37,608 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:37,608 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:37,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 325 states, 246 states have (on average 1.8048780487804879) internal successors, (444), 314 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:37,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 325 states to 325 states and 460 transitions. [2022-02-20 23:48:37,614 INFO L78 Accepts]: Start accepts. Automaton has 325 states and 460 transitions. Word has length 12 [2022-02-20 23:48:37,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:37,615 INFO L470 AbstractCegarLoop]: Abstraction has 325 states and 460 transitions. [2022-02-20 23:48:37,615 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:48:37,615 INFO L276 IsEmpty]: Start isEmpty. Operand 325 states and 460 transitions. [2022-02-20 23:48:37,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:37,615 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:37,615 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:48:37,616 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:48:37,616 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:37,616 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:37,616 INFO L85 PathProgramCache]: Analyzing trace with hash 79488163, now seen corresponding path program 1 times [2022-02-20 23:48:37,616 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:37,616 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [507788428] [2022-02-20 23:48:37,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:37,617 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:37,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,638 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:37,640 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:37,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {9543#true} #res := ~unnamed1~0~LIST_BEG; {9543#true} is VALID [2022-02-20 23:48:37,642 INFO L290 TraceCheckUtils]: 1: Hoare triple {9543#true} assume true; {9543#true} is VALID [2022-02-20 23:48:37,642 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {9543#true} {9544#false} #335#return; {9544#false} is VALID [2022-02-20 23:48:37,642 INFO L290 TraceCheckUtils]: 0: Hoare triple {9543#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {9543#true} is VALID [2022-02-20 23:48:37,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {9543#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:48:37,643 INFO L290 TraceCheckUtils]: 2: Hoare triple {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:48:37,643 INFO L290 TraceCheckUtils]: 3: Hoare triple {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:48:37,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:48:37,644 INFO L290 TraceCheckUtils]: 5: Hoare triple {9545#(= |ULTIMATE.start_main_~y~1#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {9546#|ULTIMATE.start_main_#t~short31#1|} is VALID [2022-02-20 23:48:37,644 INFO L290 TraceCheckUtils]: 6: Hoare triple {9546#|ULTIMATE.start_main_#t~short31#1|} assume !main_#t~short31#1; {9544#false} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {9544#false} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {9544#false} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {9544#false} main_#t~short36#1 := main_~z~0#1 < 7; {9544#false} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {9544#false} assume !main_#t~short36#1; {9544#false} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 10: Hoare triple {9544#false} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {9544#false} is VALID [2022-02-20 23:48:37,645 INFO L272 TraceCheckUtils]: 11: Hoare triple {9544#false} call main_#t~ret37#1 := rand_end_point(); {9543#true} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {9543#true} #res := ~unnamed1~0~LIST_BEG; {9543#true} is VALID [2022-02-20 23:48:37,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {9543#true} assume true; {9543#true} is VALID [2022-02-20 23:48:37,646 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {9543#true} {9544#false} #335#return; {9544#false} is VALID [2022-02-20 23:48:37,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {9544#false} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {9544#false} is VALID [2022-02-20 23:48:37,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {9544#false} assume !(1 == #valid[is_empty_~list#1.base]); {9544#false} is VALID [2022-02-20 23:48:37,646 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:48:37,646 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:37,646 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [507788428] [2022-02-20 23:48:37,647 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [507788428] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:37,647 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:37,647 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:37,647 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363125107] [2022-02-20 23:48:37,647 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:37,647 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:37,648 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:37,648 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,657 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:48:37,657 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:37,657 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:37,658 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:37,658 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:37,658 INFO L87 Difference]: Start difference. First operand 325 states and 460 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:37,909 INFO L93 Difference]: Finished difference Result 527 states and 732 transitions. [2022-02-20 23:48:37,909 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:37,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:37,909 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:37,909 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,912 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2022-02-20 23:48:37,912 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:37,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 362 transitions. [2022-02-20 23:48:37,914 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 362 transitions. [2022-02-20 23:48:38,150 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 362 edges. 362 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,160 INFO L225 Difference]: With dead ends: 527 [2022-02-20 23:48:38,160 INFO L226 Difference]: Without dead ends: 527 [2022-02-20 23:48:38,161 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 4 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:48:38,161 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 181 mSDsluCounter, 358 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 183 SdHoareTripleChecker+Valid, 554 SdHoareTripleChecker+Invalid, 15 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:38,161 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [183 Valid, 554 Invalid, 15 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:38,162 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2022-02-20 23:48:38,166 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 329. [2022-02-20 23:48:38,166 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,167 INFO L82 GeneralOperation]: Start isEquivalent. First operand 527 states. Second operand has 329 states, 250 states have (on average 1.784) internal successors, (446), 318 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,167 INFO L74 IsIncluded]: Start isIncluded. First operand 527 states. Second operand has 329 states, 250 states have (on average 1.784) internal successors, (446), 318 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,168 INFO L87 Difference]: Start difference. First operand 527 states. Second operand has 329 states, 250 states have (on average 1.784) internal successors, (446), 318 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,181 INFO L93 Difference]: Finished difference Result 527 states and 732 transitions. [2022-02-20 23:48:38,181 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 732 transitions. [2022-02-20 23:48:38,182 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,182 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,183 INFO L74 IsIncluded]: Start isIncluded. First operand has 329 states, 250 states have (on average 1.784) internal successors, (446), 318 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 527 states. [2022-02-20 23:48:38,183 INFO L87 Difference]: Start difference. First operand has 329 states, 250 states have (on average 1.784) internal successors, (446), 318 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 527 states. [2022-02-20 23:48:38,196 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,207 INFO L93 Difference]: Finished difference Result 527 states and 732 transitions. [2022-02-20 23:48:38,207 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 732 transitions. [2022-02-20 23:48:38,208 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,208 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,208 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,208 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,209 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 329 states, 250 states have (on average 1.784) internal successors, (446), 318 states have internal predecessors, (446), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,215 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 329 states to 329 states and 462 transitions. [2022-02-20 23:48:38,216 INFO L78 Accepts]: Start accepts. Automaton has 329 states and 462 transitions. Word has length 17 [2022-02-20 23:48:38,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,216 INFO L470 AbstractCegarLoop]: Abstraction has 329 states and 462 transitions. [2022-02-20 23:48:38,216 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,216 INFO L276 IsEmpty]: Start isEmpty. Operand 329 states and 462 transitions. [2022-02-20 23:48:38,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:38,217 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,217 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:48:38,217 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:48:38,217 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:38,217 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,217 INFO L85 PathProgramCache]: Analyzing trace with hash -621576415, now seen corresponding path program 1 times [2022-02-20 23:48:38,218 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,218 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [211656717] [2022-02-20 23:48:38,218 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,218 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,227 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,235 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:38,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,238 INFO L290 TraceCheckUtils]: 0: Hoare triple {11464#true} #res := ~unnamed1~0~LIST_BEG; {11464#true} is VALID [2022-02-20 23:48:38,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-02-20 23:48:38,239 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {11464#true} {11465#false} #335#return; {11465#false} is VALID [2022-02-20 23:48:38,239 INFO L290 TraceCheckUtils]: 0: Hoare triple {11464#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {11464#true} is VALID [2022-02-20 23:48:38,239 INFO L290 TraceCheckUtils]: 1: Hoare triple {11464#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {11464#true} is VALID [2022-02-20 23:48:38,239 INFO L290 TraceCheckUtils]: 2: Hoare triple {11464#true} main_#t~short29#1 := main_~i~0#1 < 3; {11464#true} is VALID [2022-02-20 23:48:38,239 INFO L290 TraceCheckUtils]: 3: Hoare triple {11464#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {11464#true} is VALID [2022-02-20 23:48:38,240 INFO L290 TraceCheckUtils]: 4: Hoare triple {11464#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {11464#true} is VALID [2022-02-20 23:48:38,240 INFO L290 TraceCheckUtils]: 5: Hoare triple {11464#true} main_#t~short31#1 := main_~y~1#1 < 4; {11464#true} is VALID [2022-02-20 23:48:38,240 INFO L290 TraceCheckUtils]: 6: Hoare triple {11464#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {11464#true} is VALID [2022-02-20 23:48:38,240 INFO L290 TraceCheckUtils]: 7: Hoare triple {11464#true} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {11464#true} is VALID [2022-02-20 23:48:38,240 INFO L290 TraceCheckUtils]: 8: Hoare triple {11464#true} main_#t~short36#1 := main_~z~0#1 < 7; {11464#true} is VALID [2022-02-20 23:48:38,241 INFO L290 TraceCheckUtils]: 9: Hoare triple {11464#true} assume !main_#t~short36#1; {11466#(not |ULTIMATE.start_main_#t~short36#1|)} is VALID [2022-02-20 23:48:38,241 INFO L290 TraceCheckUtils]: 10: Hoare triple {11466#(not |ULTIMATE.start_main_#t~short36#1|)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {11465#false} is VALID [2022-02-20 23:48:38,241 INFO L272 TraceCheckUtils]: 11: Hoare triple {11465#false} call main_#t~ret37#1 := rand_end_point(); {11464#true} is VALID [2022-02-20 23:48:38,241 INFO L290 TraceCheckUtils]: 12: Hoare triple {11464#true} #res := ~unnamed1~0~LIST_BEG; {11464#true} is VALID [2022-02-20 23:48:38,241 INFO L290 TraceCheckUtils]: 13: Hoare triple {11464#true} assume true; {11464#true} is VALID [2022-02-20 23:48:38,241 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {11464#true} {11465#false} #335#return; {11465#false} is VALID [2022-02-20 23:48:38,242 INFO L290 TraceCheckUtils]: 15: Hoare triple {11465#false} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {11465#false} is VALID [2022-02-20 23:48:38,242 INFO L290 TraceCheckUtils]: 16: Hoare triple {11465#false} assume !(1 == #valid[is_empty_~list#1.base]); {11465#false} is VALID [2022-02-20 23:48:38,242 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:48:38,242 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,242 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [211656717] [2022-02-20 23:48:38,242 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [211656717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,242 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,243 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:38,243 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [495858827] [2022-02-20 23:48:38,243 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,243 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:38,243 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,243 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,253 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:48:38,254 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:38,254 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,254 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:38,254 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:38,255 INFO L87 Difference]: Start difference. First operand 329 states and 462 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,397 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,398 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2022-02-20 23:48:38,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:38,398 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:38,398 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:38,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 23:48:38,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 198 transitions. [2022-02-20 23:48:38,401 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 198 transitions. [2022-02-20 23:48:38,527 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 198 edges. 198 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:38,532 INFO L225 Difference]: With dead ends: 333 [2022-02-20 23:48:38,532 INFO L226 Difference]: Without dead ends: 333 [2022-02-20 23:48:38,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 4 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:48:38,533 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 0 mSDsluCounter, 190 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 385 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:38,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 385 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:38,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 333 states. [2022-02-20 23:48:38,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 333 to 333. [2022-02-20 23:48:38,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:38,537 INFO L82 GeneralOperation]: Start isEquivalent. First operand 333 states. Second operand has 333 states, 254 states have (on average 1.7716535433070866) internal successors, (450), 322 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,538 INFO L74 IsIncluded]: Start isIncluded. First operand 333 states. Second operand has 333 states, 254 states have (on average 1.7716535433070866) internal successors, (450), 322 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,538 INFO L87 Difference]: Start difference. First operand 333 states. Second operand has 333 states, 254 states have (on average 1.7716535433070866) internal successors, (450), 322 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,545 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2022-02-20 23:48:38,545 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2022-02-20 23:48:38,545 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,545 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,546 INFO L74 IsIncluded]: Start isIncluded. First operand has 333 states, 254 states have (on average 1.7716535433070866) internal successors, (450), 322 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 333 states. [2022-02-20 23:48:38,547 INFO L87 Difference]: Start difference. First operand has 333 states, 254 states have (on average 1.7716535433070866) internal successors, (450), 322 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 333 states. [2022-02-20 23:48:38,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:38,553 INFO L93 Difference]: Finished difference Result 333 states and 466 transitions. [2022-02-20 23:48:38,553 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2022-02-20 23:48:38,553 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:38,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:38,554 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:38,554 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:38,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 333 states, 254 states have (on average 1.7716535433070866) internal successors, (450), 322 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:38,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 333 states to 333 states and 466 transitions. [2022-02-20 23:48:38,560 INFO L78 Accepts]: Start accepts. Automaton has 333 states and 466 transitions. Word has length 17 [2022-02-20 23:48:38,560 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:38,560 INFO L470 AbstractCegarLoop]: Abstraction has 333 states and 466 transitions. [2022-02-20 23:48:38,561 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,561 INFO L276 IsEmpty]: Start isEmpty. Operand 333 states and 466 transitions. [2022-02-20 23:48:38,561 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:38,561 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:38,561 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:48:38,561 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:48:38,561 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:38,562 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:38,562 INFO L85 PathProgramCache]: Analyzing trace with hash 187770211, now seen corresponding path program 1 times [2022-02-20 23:48:38,562 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:38,562 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2113217351] [2022-02-20 23:48:38,562 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:38,562 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:38,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,592 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:38,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:38,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {12804#true} #res := ~unnamed1~0~LIST_BEG; {12804#true} is VALID [2022-02-20 23:48:38,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {12804#true} assume true; {12804#true} is VALID [2022-02-20 23:48:38,597 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {12804#true} {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #335#return; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,598 INFO L290 TraceCheckUtils]: 0: Hoare triple {12804#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,598 INFO L290 TraceCheckUtils]: 1: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,598 INFO L290 TraceCheckUtils]: 2: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short29#1 := main_~i~0#1 < 3; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,599 INFO L290 TraceCheckUtils]: 4: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short31#1 := main_~y~1#1 < 4; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,600 INFO L290 TraceCheckUtils]: 6: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,601 INFO L290 TraceCheckUtils]: 7: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,601 INFO L290 TraceCheckUtils]: 8: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short36#1 := main_~z~0#1 < 7; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,601 INFO L290 TraceCheckUtils]: 9: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,602 INFO L290 TraceCheckUtils]: 10: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,602 INFO L272 TraceCheckUtils]: 11: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret37#1 := rand_end_point(); {12804#true} is VALID [2022-02-20 23:48:38,602 INFO L290 TraceCheckUtils]: 12: Hoare triple {12804#true} #res := ~unnamed1~0~LIST_BEG; {12804#true} is VALID [2022-02-20 23:48:38,602 INFO L290 TraceCheckUtils]: 13: Hoare triple {12804#true} assume true; {12804#true} is VALID [2022-02-20 23:48:38,603 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {12804#true} {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #335#return; {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:38,603 INFO L290 TraceCheckUtils]: 15: Hoare triple {12806#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {12810#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1))} is VALID [2022-02-20 23:48:38,604 INFO L290 TraceCheckUtils]: 16: Hoare triple {12810#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1))} assume !(1 == #valid[is_empty_~list#1.base]); {12805#false} is VALID [2022-02-20 23:48:38,604 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:48:38,604 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:38,604 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2113217351] [2022-02-20 23:48:38,604 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2113217351] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:38,604 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:38,604 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:38,605 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1069794124] [2022-02-20 23:48:38,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:38,605 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:38,605 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:38,605 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:38,616 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:48:38,616 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:38,616 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:38,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:38,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:38,617 INFO L87 Difference]: Start difference. First operand 333 states and 466 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,250 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,250 INFO L93 Difference]: Finished difference Result 566 states and 714 transitions. [2022-02-20 23:48:39,250 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:39,251 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:39,251 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:39,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2022-02-20 23:48:39,254 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 500 transitions. [2022-02-20 23:48:39,257 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 500 transitions. [2022-02-20 23:48:39,599 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 500 edges. 500 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:39,610 INFO L225 Difference]: With dead ends: 566 [2022-02-20 23:48:39,610 INFO L226 Difference]: Without dead ends: 566 [2022-02-20 23:48:39,611 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:48:39,611 INFO L933 BasicCegarLoop]: 210 mSDtfsCounter, 340 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 254 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 340 SdHoareTripleChecker+Valid, 458 SdHoareTripleChecker+Invalid, 260 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 254 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:39,611 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [340 Valid, 458 Invalid, 260 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 254 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:39,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 566 states. [2022-02-20 23:48:39,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 566 to 339. [2022-02-20 23:48:39,616 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:39,616 INFO L82 GeneralOperation]: Start isEquivalent. First operand 566 states. Second operand has 339 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 328 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,617 INFO L74 IsIncluded]: Start isIncluded. First operand 566 states. Second operand has 339 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 328 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,617 INFO L87 Difference]: Start difference. First operand 566 states. Second operand has 339 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 328 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,631 INFO L93 Difference]: Finished difference Result 566 states and 714 transitions. [2022-02-20 23:48:39,631 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 714 transitions. [2022-02-20 23:48:39,631 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,632 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 328 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 566 states. [2022-02-20 23:48:39,633 INFO L87 Difference]: Start difference. First operand has 339 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 328 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 566 states. [2022-02-20 23:48:39,649 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:39,649 INFO L93 Difference]: Finished difference Result 566 states and 714 transitions. [2022-02-20 23:48:39,649 INFO L276 IsEmpty]: Start isEmpty. Operand 566 states and 714 transitions. [2022-02-20 23:48:39,650 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:39,650 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:39,650 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:39,650 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:39,651 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 260 states have (on average 1.7538461538461538) internal successors, (456), 328 states have internal predecessors, (456), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:39,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 472 transitions. [2022-02-20 23:48:39,659 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 472 transitions. Word has length 17 [2022-02-20 23:48:39,659 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:39,659 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 472 transitions. [2022-02-20 23:48:39,659 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,659 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 472 transitions. [2022-02-20 23:48:39,660 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:48:39,660 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:39,660 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:48:39,660 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:48:39,660 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:39,661 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:39,661 INFO L85 PathProgramCache]: Analyzing trace with hash 187770212, now seen corresponding path program 1 times [2022-02-20 23:48:39,661 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:39,661 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1714405054] [2022-02-20 23:48:39,661 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:39,661 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:39,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,741 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:39,742 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:39,745 INFO L290 TraceCheckUtils]: 0: Hoare triple {14852#true} #res := ~unnamed1~0~LIST_BEG; {14852#true} is VALID [2022-02-20 23:48:39,746 INFO L290 TraceCheckUtils]: 1: Hoare triple {14852#true} assume true; {14852#true} is VALID [2022-02-20 23:48:39,746 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {14852#true} {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #335#return; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {14852#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,748 INFO L290 TraceCheckUtils]: 3: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short31#1 := main_~y~1#1 < 4; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,750 INFO L290 TraceCheckUtils]: 6: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,751 INFO L290 TraceCheckUtils]: 8: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short36#1 := main_~z~0#1 < 7; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,751 INFO L290 TraceCheckUtils]: 9: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,751 INFO L290 TraceCheckUtils]: 10: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,752 INFO L272 TraceCheckUtils]: 11: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret37#1 := rand_end_point(); {14852#true} is VALID [2022-02-20 23:48:39,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {14852#true} #res := ~unnamed1~0~LIST_BEG; {14852#true} is VALID [2022-02-20 23:48:39,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {14852#true} assume true; {14852#true} is VALID [2022-02-20 23:48:39,755 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {14852#true} {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #335#return; {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:39,756 INFO L290 TraceCheckUtils]: 15: Hoare triple {14854#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {14858#(and (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (<= |ULTIMATE.start_is_empty_~list#1.offset| 0) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:48:39,756 INFO L290 TraceCheckUtils]: 16: Hoare triple {14858#(and (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (<= |ULTIMATE.start_is_empty_~list#1.offset| 0) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {14853#false} is VALID [2022-02-20 23:48:39,757 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:48:39,757 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:39,757 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1714405054] [2022-02-20 23:48:39,757 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1714405054] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:39,757 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:39,757 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:39,757 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49725543] [2022-02-20 23:48:39,757 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:39,758 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:39,758 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:39,758 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:39,770 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:48:39,770 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:39,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:39,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:39,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:39,771 INFO L87 Difference]: Start difference. First operand 339 states and 472 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,161 INFO L93 Difference]: Finished difference Result 386 states and 491 transitions. [2022-02-20 23:48:40,161 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:40,162 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 17 [2022-02-20 23:48:40,162 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:40,162 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2022-02-20 23:48:40,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,167 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 320 transitions. [2022-02-20 23:48:40,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 320 transitions. [2022-02-20 23:48:40,388 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 320 edges. 320 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:40,394 INFO L225 Difference]: With dead ends: 386 [2022-02-20 23:48:40,394 INFO L226 Difference]: Without dead ends: 386 [2022-02-20 23:48:40,394 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:48:40,395 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 184 mSDsluCounter, 266 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 167 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:40,395 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [184 Valid, 460 Invalid, 167 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:40,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 386 states. [2022-02-20 23:48:40,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 386 to 339. [2022-02-20 23:48:40,398 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:40,399 INFO L82 GeneralOperation]: Start isEquivalent. First operand 386 states. Second operand has 339 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 328 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,400 INFO L74 IsIncluded]: Start isIncluded. First operand 386 states. Second operand has 339 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 328 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,400 INFO L87 Difference]: Start difference. First operand 386 states. Second operand has 339 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 328 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,407 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,408 INFO L93 Difference]: Finished difference Result 386 states and 491 transitions. [2022-02-20 23:48:40,408 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 491 transitions. [2022-02-20 23:48:40,408 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,408 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,409 INFO L74 IsIncluded]: Start isIncluded. First operand has 339 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 328 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 386 states. [2022-02-20 23:48:40,409 INFO L87 Difference]: Start difference. First operand has 339 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 328 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 386 states. [2022-02-20 23:48:40,437 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:40,437 INFO L93 Difference]: Finished difference Result 386 states and 491 transitions. [2022-02-20 23:48:40,437 INFO L276 IsEmpty]: Start isEmpty. Operand 386 states and 491 transitions. [2022-02-20 23:48:40,438 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:40,438 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:40,438 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:40,438 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:40,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 339 states, 260 states have (on average 1.7307692307692308) internal successors, (450), 328 states have internal predecessors, (450), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:40,444 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 339 states to 339 states and 466 transitions. [2022-02-20 23:48:40,445 INFO L78 Accepts]: Start accepts. Automaton has 339 states and 466 transitions. Word has length 17 [2022-02-20 23:48:40,445 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:40,445 INFO L470 AbstractCegarLoop]: Abstraction has 339 states and 466 transitions. [2022-02-20 23:48:40,445 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,445 INFO L276 IsEmpty]: Start isEmpty. Operand 339 states and 466 transitions. [2022-02-20 23:48:40,446 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:48:40,446 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:40,446 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:48:40,446 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:48:40,446 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:40,446 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:40,447 INFO L85 PathProgramCache]: Analyzing trace with hash 1574138016, now seen corresponding path program 1 times [2022-02-20 23:48:40,447 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:40,447 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [727599998] [2022-02-20 23:48:40,447 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:40,447 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:40,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,502 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:40,503 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:40,506 INFO L290 TraceCheckUtils]: 0: Hoare triple {16360#true} #res := ~unnamed1~0~LIST_BEG; {16360#true} is VALID [2022-02-20 23:48:40,506 INFO L290 TraceCheckUtils]: 1: Hoare triple {16360#true} assume true; {16360#true} is VALID [2022-02-20 23:48:40,507 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {16360#true} {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #333#return; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,507 INFO L290 TraceCheckUtils]: 0: Hoare triple {16360#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,508 INFO L290 TraceCheckUtils]: 1: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,508 INFO L290 TraceCheckUtils]: 2: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short29#1 := main_~i~0#1 < 3; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,509 INFO L290 TraceCheckUtils]: 3: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,509 INFO L290 TraceCheckUtils]: 4: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,509 INFO L290 TraceCheckUtils]: 5: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short31#1 := main_~y~1#1 < 4; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,510 INFO L290 TraceCheckUtils]: 6: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,510 INFO L290 TraceCheckUtils]: 7: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,510 INFO L272 TraceCheckUtils]: 8: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret32#1 := rand_end_point(); {16360#true} is VALID [2022-02-20 23:48:40,510 INFO L290 TraceCheckUtils]: 9: Hoare triple {16360#true} #res := ~unnamed1~0~LIST_BEG; {16360#true} is VALID [2022-02-20 23:48:40,511 INFO L290 TraceCheckUtils]: 10: Hoare triple {16360#true} assume true; {16360#true} is VALID [2022-02-20 23:48:40,511 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {16360#true} {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #333#return; {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:40,515 INFO L290 TraceCheckUtils]: 12: Hoare triple {16362#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {16366#(and (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:40,516 INFO L290 TraceCheckUtils]: 13: Hoare triple {16366#(and (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:48:40,516 INFO L290 TraceCheckUtils]: 14: Hoare triple {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:48:40,517 INFO L290 TraceCheckUtils]: 15: Hoare triple {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:48:40,517 INFO L290 TraceCheckUtils]: 16: Hoare triple {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:48:40,517 INFO L290 TraceCheckUtils]: 17: Hoare triple {16367#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} assume !(1 == #valid[create_item_~cursor#1.base]); {16361#false} is VALID [2022-02-20 23:48:40,518 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:48:40,518 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:40,518 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [727599998] [2022-02-20 23:48:40,518 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [727599998] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:40,518 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:40,518 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:40,519 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2035034009] [2022-02-20 23:48:40,519 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:40,519 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:48:40,519 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:40,519 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:40,530 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:48:40,530 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:40,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:40,531 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:40,531 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:40,532 INFO L87 Difference]: Start difference. First operand 339 states and 466 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:41,539 INFO L93 Difference]: Finished difference Result 704 states and 839 transitions. [2022-02-20 23:48:41,539 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:41,539 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:48:41,539 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:41,540 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-02-20 23:48:41,544 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:41,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 738 transitions. [2022-02-20 23:48:41,548 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 738 transitions. [2022-02-20 23:48:42,070 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 738 edges. 738 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:42,087 INFO L225 Difference]: With dead ends: 704 [2022-02-20 23:48:42,087 INFO L226 Difference]: Without dead ends: 704 [2022-02-20 23:48:42,087 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=18, Invalid=24, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:42,088 INFO L933 BasicCegarLoop]: 183 mSDtfsCounter, 894 mSDsluCounter, 379 mSDsCounter, 0 mSdLazyCounter, 319 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 896 SdHoareTripleChecker+Valid, 562 SdHoareTripleChecker+Invalid, 344 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 319 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:42,088 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [896 Valid, 562 Invalid, 344 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 319 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:48:42,089 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 704 states. [2022-02-20 23:48:42,093 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 704 to 336. [2022-02-20 23:48:42,093 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:42,094 INFO L82 GeneralOperation]: Start isEquivalent. First operand 704 states. Second operand has 336 states, 261 states have (on average 1.7011494252873562) internal successors, (444), 325 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,096 INFO L74 IsIncluded]: Start isIncluded. First operand 704 states. Second operand has 336 states, 261 states have (on average 1.7011494252873562) internal successors, (444), 325 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,097 INFO L87 Difference]: Start difference. First operand 704 states. Second operand has 336 states, 261 states have (on average 1.7011494252873562) internal successors, (444), 325 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,116 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,116 INFO L93 Difference]: Finished difference Result 704 states and 839 transitions. [2022-02-20 23:48:42,116 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 839 transitions. [2022-02-20 23:48:42,117 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,117 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,118 INFO L74 IsIncluded]: Start isIncluded. First operand has 336 states, 261 states have (on average 1.7011494252873562) internal successors, (444), 325 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 704 states. [2022-02-20 23:48:42,118 INFO L87 Difference]: Start difference. First operand has 336 states, 261 states have (on average 1.7011494252873562) internal successors, (444), 325 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 704 states. [2022-02-20 23:48:42,136 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:42,136 INFO L93 Difference]: Finished difference Result 704 states and 839 transitions. [2022-02-20 23:48:42,136 INFO L276 IsEmpty]: Start isEmpty. Operand 704 states and 839 transitions. [2022-02-20 23:48:42,137 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:42,138 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:42,138 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:42,138 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:42,138 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 336 states, 261 states have (on average 1.7011494252873562) internal successors, (444), 325 states have internal predecessors, (444), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:42,144 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 336 states to 336 states and 460 transitions. [2022-02-20 23:48:42,145 INFO L78 Accepts]: Start accepts. Automaton has 336 states and 460 transitions. Word has length 18 [2022-02-20 23:48:42,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:42,146 INFO L470 AbstractCegarLoop]: Abstraction has 336 states and 460 transitions. [2022-02-20 23:48:42,146 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,146 INFO L276 IsEmpty]: Start isEmpty. Operand 336 states and 460 transitions. [2022-02-20 23:48:42,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:48:42,146 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:42,147 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:48:42,147 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:48:42,147 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:42,147 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:42,147 INFO L85 PathProgramCache]: Analyzing trace with hash 1574138017, now seen corresponding path program 1 times [2022-02-20 23:48:42,147 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:42,147 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [403430710] [2022-02-20 23:48:42,148 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:42,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:42,172 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:42,245 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:42,248 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:42,275 INFO L290 TraceCheckUtils]: 0: Hoare triple {18822#true} #res := ~unnamed1~0~LIST_BEG; {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:42,276 INFO L290 TraceCheckUtils]: 1: Hoare triple {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:42,277 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #333#return; {18828#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:48:42,277 INFO L290 TraceCheckUtils]: 0: Hoare triple {18822#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,278 INFO L290 TraceCheckUtils]: 1: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,278 INFO L290 TraceCheckUtils]: 2: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,279 INFO L290 TraceCheckUtils]: 3: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,279 INFO L290 TraceCheckUtils]: 4: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,280 INFO L290 TraceCheckUtils]: 5: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short31#1 := main_~y~1#1 < 4; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,280 INFO L290 TraceCheckUtils]: 6: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,281 INFO L290 TraceCheckUtils]: 7: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:42,281 INFO L272 TraceCheckUtils]: 8: Hoare triple {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {18822#true} is VALID [2022-02-20 23:48:42,281 INFO L290 TraceCheckUtils]: 9: Hoare triple {18822#true} #res := ~unnamed1~0~LIST_BEG; {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:42,281 INFO L290 TraceCheckUtils]: 10: Hoare triple {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:42,282 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {18830#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {18824#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #333#return; {18828#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:48:42,283 INFO L290 TraceCheckUtils]: 12: Hoare triple {18828#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_BEG 4)))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:48:42,284 INFO L290 TraceCheckUtils]: 13: Hoare triple {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:48:42,284 INFO L290 TraceCheckUtils]: 14: Hoare triple {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:48:42,285 INFO L290 TraceCheckUtils]: 15: Hoare triple {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:48:42,285 INFO L290 TraceCheckUtils]: 16: Hoare triple {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:48:42,285 INFO L290 TraceCheckUtils]: 17: Hoare triple {18829#(and (<= (* ~unnamed1~0~LIST_BEG 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !(4 + create_item_~cursor#1.offset <= #length[create_item_~cursor#1.base] && 0 <= create_item_~cursor#1.offset); {18823#false} is VALID [2022-02-20 23:48:42,286 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:42,286 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:42,286 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [403430710] [2022-02-20 23:48:42,286 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [403430710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:42,286 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:42,286 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:42,286 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1036739999] [2022-02-20 23:48:42,287 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:42,287 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:48:42,287 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:42,287 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:42,300 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:48:42,300 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:42,301 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:42,301 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:42,301 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:42,301 INFO L87 Difference]: Start difference. First operand 336 states and 460 transitions. Second operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:43,798 INFO L93 Difference]: Finished difference Result 686 states and 840 transitions. [2022-02-20 23:48:43,798 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:48:43,799 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 18 [2022-02-20 23:48:43,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:43,799 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,802 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2022-02-20 23:48:43,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:43,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 653 transitions. [2022-02-20 23:48:43,806 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 653 transitions. [2022-02-20 23:48:44,305 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 653 edges. 653 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:44,319 INFO L225 Difference]: With dead ends: 686 [2022-02-20 23:48:44,319 INFO L226 Difference]: Without dead ends: 686 [2022-02-20 23:48:44,319 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:48:44,320 INFO L933 BasicCegarLoop]: 170 mSDtfsCounter, 640 mSDsluCounter, 571 mSDsCounter, 0 mSdLazyCounter, 596 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 644 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 610 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 596 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:44,320 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [644 Valid, 741 Invalid, 610 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 596 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:44,321 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 686 states. [2022-02-20 23:48:44,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 686 to 356. [2022-02-20 23:48:44,327 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:44,328 INFO L82 GeneralOperation]: Start isEquivalent. First operand 686 states. Second operand has 356 states, 281 states have (on average 1.704626334519573) internal successors, (479), 345 states have internal predecessors, (479), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,328 INFO L74 IsIncluded]: Start isIncluded. First operand 686 states. Second operand has 356 states, 281 states have (on average 1.704626334519573) internal successors, (479), 345 states have internal predecessors, (479), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,329 INFO L87 Difference]: Start difference. First operand 686 states. Second operand has 356 states, 281 states have (on average 1.704626334519573) internal successors, (479), 345 states have internal predecessors, (479), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,345 INFO L93 Difference]: Finished difference Result 686 states and 840 transitions. [2022-02-20 23:48:44,345 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 840 transitions. [2022-02-20 23:48:44,346 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:44,346 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:44,347 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 281 states have (on average 1.704626334519573) internal successors, (479), 345 states have internal predecessors, (479), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 686 states. [2022-02-20 23:48:44,347 INFO L87 Difference]: Start difference. First operand has 356 states, 281 states have (on average 1.704626334519573) internal successors, (479), 345 states have internal predecessors, (479), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) Second operand 686 states. [2022-02-20 23:48:44,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:44,363 INFO L93 Difference]: Finished difference Result 686 states and 840 transitions. [2022-02-20 23:48:44,364 INFO L276 IsEmpty]: Start isEmpty. Operand 686 states and 840 transitions. [2022-02-20 23:48:44,364 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:44,364 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:44,365 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:44,365 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:44,365 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 281 states have (on average 1.704626334519573) internal successors, (479), 345 states have internal predecessors, (479), 8 states have call successors, (8), 4 states have call predecessors, (8), 4 states have return successors, (8), 6 states have call predecessors, (8), 8 states have call successors, (8) [2022-02-20 23:48:44,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 495 transitions. [2022-02-20 23:48:44,371 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 495 transitions. Word has length 18 [2022-02-20 23:48:44,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:44,371 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 495 transitions. [2022-02-20 23:48:44,371 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) internal successors, (16), 4 states have internal predecessors, (16), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,371 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 495 transitions. [2022-02-20 23:48:44,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:48:44,372 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:44,372 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:48:44,372 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:48:44,372 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:44,372 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:44,373 INFO L85 PathProgramCache]: Analyzing trace with hash 1870398950, now seen corresponding path program 1 times [2022-02-20 23:48:44,373 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:44,373 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2057181255] [2022-02-20 23:48:44,373 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:44,373 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:44,391 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:44,558 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:44,560 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:44,562 INFO L290 TraceCheckUtils]: 0: Hoare triple {21255#true} #res := ~unnamed1~0~LIST_BEG; {21255#true} is VALID [2022-02-20 23:48:44,563 INFO L290 TraceCheckUtils]: 1: Hoare triple {21255#true} assume true; {21255#true} is VALID [2022-02-20 23:48:44,563 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {21255#true} {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #333#return; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,564 INFO L290 TraceCheckUtils]: 0: Hoare triple {21255#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,564 INFO L290 TraceCheckUtils]: 1: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,565 INFO L290 TraceCheckUtils]: 2: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short29#1 := main_~i~0#1 < 3; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,565 INFO L290 TraceCheckUtils]: 3: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,566 INFO L290 TraceCheckUtils]: 4: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,566 INFO L290 TraceCheckUtils]: 5: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short31#1 := main_~y~1#1 < 4; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,567 INFO L290 TraceCheckUtils]: 6: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,567 INFO L290 TraceCheckUtils]: 7: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,567 INFO L272 TraceCheckUtils]: 8: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret32#1 := rand_end_point(); {21255#true} is VALID [2022-02-20 23:48:44,567 INFO L290 TraceCheckUtils]: 9: Hoare triple {21255#true} #res := ~unnamed1~0~LIST_BEG; {21255#true} is VALID [2022-02-20 23:48:44,567 INFO L290 TraceCheckUtils]: 10: Hoare triple {21255#true} assume true; {21255#true} is VALID [2022-02-20 23:48:44,568 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {21255#true} {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #333#return; {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:44,569 INFO L290 TraceCheckUtils]: 12: Hoare triple {21257#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {21261#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} is VALID [2022-02-20 23:48:44,570 INFO L290 TraceCheckUtils]: 13: Hoare triple {21261#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {21261#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} is VALID [2022-02-20 23:48:44,573 INFO L290 TraceCheckUtils]: 14: Hoare triple {21261#(or (not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {21262#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} is VALID [2022-02-20 23:48:44,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {21262#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)))))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {21263#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} is VALID [2022-02-20 23:48:44,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {21263#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {21263#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} is VALID [2022-02-20 23:48:44,575 INFO L290 TraceCheckUtils]: 17: Hoare triple {21263#(and (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_BEG 4)) (or (not (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {21264#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:48:44,575 INFO L290 TraceCheckUtils]: 18: Hoare triple {21264#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {21265#(and (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (not |ULTIMATE.start_create_item_#t~short10#1|))} is VALID [2022-02-20 23:48:44,576 INFO L290 TraceCheckUtils]: 19: Hoare triple {21265#(and (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (not |ULTIMATE.start_create_item_#t~short10#1|))} assume create_item_#t~short10#1; {21256#false} is VALID [2022-02-20 23:48:44,576 INFO L290 TraceCheckUtils]: 20: Hoare triple {21256#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-3 {21256#false} is VALID [2022-02-20 23:48:44,576 INFO L290 TraceCheckUtils]: 21: Hoare triple {21256#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {21256#false} is VALID [2022-02-20 23:48:44,576 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:48:44,576 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:44,577 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2057181255] [2022-02-20 23:48:44,577 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2057181255] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:44,577 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:44,577 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:48:44,577 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [621854320] [2022-02-20 23:48:44,577 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:44,577 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-20 23:48:44,578 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:44,578 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:44,593 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:48:44,593 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:48:44,593 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:44,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:48:44,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:44,597 INFO L87 Difference]: Start difference. First operand 356 states and 495 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,559 INFO L93 Difference]: Finished difference Result 544 states and 724 transitions. [2022-02-20 23:48:45,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:48:45,560 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 22 [2022-02-20 23:48:45,560 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:45,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 359 transitions. [2022-02-20 23:48:45,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 359 transitions. [2022-02-20 23:48:45,565 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 359 transitions. [2022-02-20 23:48:45,811 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 359 edges. 359 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:45,821 INFO L225 Difference]: With dead ends: 544 [2022-02-20 23:48:45,821 INFO L226 Difference]: Without dead ends: 544 [2022-02-20 23:48:45,822 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=55, Invalid=101, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:48:45,822 INFO L933 BasicCegarLoop]: 177 mSDtfsCounter, 192 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 253 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 192 SdHoareTripleChecker+Valid, 1003 SdHoareTripleChecker+Invalid, 262 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 253 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:45,822 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [192 Valid, 1003 Invalid, 262 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 253 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:45,823 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 544 states. [2022-02-20 23:48:45,827 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 544 to 415. [2022-02-20 23:48:45,827 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:45,828 INFO L82 GeneralOperation]: Start isEquivalent. First operand 544 states. Second operand has 415 states, 337 states have (on average 1.6706231454005935) internal successors, (563), 400 states have internal predecessors, (563), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:45,828 INFO L74 IsIncluded]: Start isIncluded. First operand 544 states. Second operand has 415 states, 337 states have (on average 1.6706231454005935) internal successors, (563), 400 states have internal predecessors, (563), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:45,829 INFO L87 Difference]: Start difference. First operand 544 states. Second operand has 415 states, 337 states have (on average 1.6706231454005935) internal successors, (563), 400 states have internal predecessors, (563), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:45,840 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,841 INFO L93 Difference]: Finished difference Result 544 states and 724 transitions. [2022-02-20 23:48:45,841 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 724 transitions. [2022-02-20 23:48:45,842 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,842 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,842 INFO L74 IsIncluded]: Start isIncluded. First operand has 415 states, 337 states have (on average 1.6706231454005935) internal successors, (563), 400 states have internal predecessors, (563), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 544 states. [2022-02-20 23:48:45,843 INFO L87 Difference]: Start difference. First operand has 415 states, 337 states have (on average 1.6706231454005935) internal successors, (563), 400 states have internal predecessors, (563), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 544 states. [2022-02-20 23:48:45,854 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:45,854 INFO L93 Difference]: Finished difference Result 544 states and 724 transitions. [2022-02-20 23:48:45,854 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 724 transitions. [2022-02-20 23:48:45,855 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:45,855 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:45,855 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:45,856 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:45,856 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 415 states, 337 states have (on average 1.6706231454005935) internal successors, (563), 400 states have internal predecessors, (563), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:45,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 415 states to 415 states and 583 transitions. [2022-02-20 23:48:45,864 INFO L78 Accepts]: Start accepts. Automaton has 415 states and 583 transitions. Word has length 22 [2022-02-20 23:48:45,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:45,864 INFO L470 AbstractCegarLoop]: Abstraction has 415 states and 583 transitions. [2022-02-20 23:48:45,864 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 8 states have internal predecessors, (20), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:45,864 INFO L276 IsEmpty]: Start isEmpty. Operand 415 states and 583 transitions. [2022-02-20 23:48:45,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:45,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:45,865 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:48:45,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:48:45,865 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr35ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:45,865 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:45,865 INFO L85 PathProgramCache]: Analyzing trace with hash -189481273, now seen corresponding path program 1 times [2022-02-20 23:48:45,865 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:45,866 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2096973111] [2022-02-20 23:48:45,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:45,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:45,881 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:46,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:46,111 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:46,113 INFO L290 TraceCheckUtils]: 0: Hoare triple {23325#true} #res := ~unnamed1~0~LIST_BEG; {23325#true} is VALID [2022-02-20 23:48:46,113 INFO L290 TraceCheckUtils]: 1: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-02-20 23:48:46,113 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {23325#true} {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #335#return; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {23325#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,115 INFO L290 TraceCheckUtils]: 2: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short29#1 := main_~i~0#1 < 3; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,117 INFO L290 TraceCheckUtils]: 5: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short31#1 := main_~y~1#1 < 4; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,118 INFO L290 TraceCheckUtils]: 7: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,118 INFO L290 TraceCheckUtils]: 8: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short36#1 := main_~z~0#1 < 7; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,119 INFO L290 TraceCheckUtils]: 9: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,120 INFO L290 TraceCheckUtils]: 10: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,120 INFO L272 TraceCheckUtils]: 11: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret37#1 := rand_end_point(); {23325#true} is VALID [2022-02-20 23:48:46,120 INFO L290 TraceCheckUtils]: 12: Hoare triple {23325#true} #res := ~unnamed1~0~LIST_BEG; {23325#true} is VALID [2022-02-20 23:48:46,120 INFO L290 TraceCheckUtils]: 13: Hoare triple {23325#true} assume true; {23325#true} is VALID [2022-02-20 23:48:46,121 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {23325#true} {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #335#return; {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:46,121 INFO L290 TraceCheckUtils]: 15: Hoare triple {23327#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {23331#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)))} is VALID [2022-02-20 23:48:46,122 INFO L290 TraceCheckUtils]: 16: Hoare triple {23331#(or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0)) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {23332#(and (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|)) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0))) (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)))} is VALID [2022-02-20 23:48:46,123 INFO L290 TraceCheckUtils]: 17: Hoare triple {23332#(and (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|)) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0))) (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {23333#(and (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0))))} is VALID [2022-02-20 23:48:46,124 INFO L290 TraceCheckUtils]: 18: Hoare triple {23333#(and (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)) (or (and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_is_empty_~list#1.base|) (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|)) 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0))))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {23334#(and (or (and (= |ULTIMATE.start_is_empty_#t~mem4#1.base| 0) (= |ULTIMATE.start_is_empty_#t~mem4#1.offset| 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|))) (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)))} is VALID [2022-02-20 23:48:46,124 INFO L290 TraceCheckUtils]: 19: Hoare triple {23334#(and (or (and (= |ULTIMATE.start_is_empty_#t~mem4#1.base| 0) (= |ULTIMATE.start_is_empty_#t~mem4#1.offset| 0) (= |ULTIMATE.start_is_empty_~no_beg~0#1| 1)) (<= 5 (+ (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_is_empty_~list#1.offset|))) (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {23335#(and (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)) (or (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0))))} is VALID [2022-02-20 23:48:46,125 INFO L290 TraceCheckUtils]: 20: Hoare triple {23335#(and (or (< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0)) (or (= |ULTIMATE.start_is_empty_~no_end~0#1| |ULTIMATE.start_is_empty_~no_beg~0#1|) (not (= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)) 0))))} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1; {23336#(< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:48:46,125 INFO L290 TraceCheckUtils]: 21: Hoare triple {23336#(< 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4)))} assume 0 == is_empty_~list#1.offset; {23326#false} is VALID [2022-02-20 23:48:46,125 INFO L290 TraceCheckUtils]: 22: Hoare triple {23326#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {23326#false} is VALID [2022-02-20 23:48:46,126 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:48:46,126 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:46,126 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2096973111] [2022-02-20 23:48:46,126 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2096973111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:46,126 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:46,126 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:48:46,126 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1135255680] [2022-02-20 23:48:46,126 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:46,127 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:46,127 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:46,127 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:46,147 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:48:46,147 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:48:46,147 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:46,148 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:48:46,148 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:46,148 INFO L87 Difference]: Start difference. First operand 415 states and 583 transitions. Second operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,295 INFO L93 Difference]: Finished difference Result 766 states and 1047 transitions. [2022-02-20 23:48:48,295 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2022-02-20 23:48:48,296 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:48,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:48,296 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,301 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 493 transitions. [2022-02-20 23:48:48,301 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,303 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 493 transitions. [2022-02-20 23:48:48,304 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 11 states and 493 transitions. [2022-02-20 23:48:48,735 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 493 edges. 493 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:48,753 INFO L225 Difference]: With dead ends: 766 [2022-02-20 23:48:48,753 INFO L226 Difference]: Without dead ends: 764 [2022-02-20 23:48:48,753 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=66, Invalid=144, Unknown=0, NotChecked=0, Total=210 [2022-02-20 23:48:48,754 INFO L933 BasicCegarLoop]: 273 mSDtfsCounter, 549 mSDsluCounter, 1411 mSDsCounter, 0 mSdLazyCounter, 360 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 551 SdHoareTripleChecker+Valid, 1684 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 360 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:48,754 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [551 Valid, 1684 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 360 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:48:48,755 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 764 states. [2022-02-20 23:48:48,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 764 to 409. [2022-02-20 23:48:48,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:48,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 764 states. Second operand has 409 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 394 states have internal predecessors, (552), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:48,760 INFO L74 IsIncluded]: Start isIncluded. First operand 764 states. Second operand has 409 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 394 states have internal predecessors, (552), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:48,761 INFO L87 Difference]: Start difference. First operand 764 states. Second operand has 409 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 394 states have internal predecessors, (552), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:48,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,779 INFO L93 Difference]: Finished difference Result 764 states and 1045 transitions. [2022-02-20 23:48:48,779 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1045 transitions. [2022-02-20 23:48:48,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 394 states have internal predecessors, (552), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 764 states. [2022-02-20 23:48:48,781 INFO L87 Difference]: Start difference. First operand has 409 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 394 states have internal predecessors, (552), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 764 states. [2022-02-20 23:48:48,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:48,800 INFO L93 Difference]: Finished difference Result 764 states and 1045 transitions. [2022-02-20 23:48:48,801 INFO L276 IsEmpty]: Start isEmpty. Operand 764 states and 1045 transitions. [2022-02-20 23:48:48,802 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:48,802 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:48,802 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:48,802 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:48,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 331 states have (on average 1.6676737160120847) internal successors, (552), 394 states have internal predecessors, (552), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:48,809 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 572 transitions. [2022-02-20 23:48:48,809 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 572 transitions. Word has length 23 [2022-02-20 23:48:48,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:48,809 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 572 transitions. [2022-02-20 23:48:48,810 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.3333333333333335) internal successors, (21), 9 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,810 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 572 transitions. [2022-02-20 23:48:48,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:48,810 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:48,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] [2022-02-20 23:48:48,810 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:48:48,811 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:48,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:48,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1937391848, now seen corresponding path program 1 times [2022-02-20 23:48:48,811 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:48,811 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [53102467] [2022-02-20 23:48:48,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:48,811 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:48,826 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:48,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:48,868 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:48,880 INFO L290 TraceCheckUtils]: 0: Hoare triple {26054#true} #res := ~unnamed1~0~LIST_BEG; {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:48,881 INFO L290 TraceCheckUtils]: 1: Hoare triple {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:48,886 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {26054#true} #333#return; {26059#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:48,886 INFO L290 TraceCheckUtils]: 0: Hoare triple {26054#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {26054#true} is VALID [2022-02-20 23:48:48,887 INFO L290 TraceCheckUtils]: 1: Hoare triple {26054#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {26054#true} is VALID [2022-02-20 23:48:48,887 INFO L290 TraceCheckUtils]: 2: Hoare triple {26054#true} main_#t~short29#1 := main_~i~0#1 < 3; {26054#true} is VALID [2022-02-20 23:48:48,889 INFO L290 TraceCheckUtils]: 3: Hoare triple {26054#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {26054#true} is VALID [2022-02-20 23:48:48,890 INFO L290 TraceCheckUtils]: 4: Hoare triple {26054#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {26054#true} is VALID [2022-02-20 23:48:48,891 INFO L290 TraceCheckUtils]: 5: Hoare triple {26054#true} main_#t~short31#1 := main_~y~1#1 < 4; {26054#true} is VALID [2022-02-20 23:48:48,891 INFO L290 TraceCheckUtils]: 6: Hoare triple {26054#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {26054#true} is VALID [2022-02-20 23:48:48,891 INFO L290 TraceCheckUtils]: 7: Hoare triple {26054#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {26054#true} is VALID [2022-02-20 23:48:48,891 INFO L272 TraceCheckUtils]: 8: Hoare triple {26054#true} call main_#t~ret32#1 := rand_end_point(); {26054#true} is VALID [2022-02-20 23:48:48,892 INFO L290 TraceCheckUtils]: 9: Hoare triple {26054#true} #res := ~unnamed1~0~LIST_BEG; {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:48,892 INFO L290 TraceCheckUtils]: 10: Hoare triple {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:48,892 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {26062#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {26054#true} #333#return; {26059#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:48:48,893 INFO L290 TraceCheckUtils]: 12: Hoare triple {26059#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {26060#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:48:48,893 INFO L290 TraceCheckUtils]: 13: Hoare triple {26060#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {26060#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:48:48,894 INFO L290 TraceCheckUtils]: 14: Hoare triple {26060#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {26060#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:48:48,894 INFO L290 TraceCheckUtils]: 15: Hoare triple {26060#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {26061#(not |ULTIMATE.start_create_item_#t~switch6#1|)} is VALID [2022-02-20 23:48:48,894 INFO L290 TraceCheckUtils]: 16: Hoare triple {26061#(not |ULTIMATE.start_create_item_#t~switch6#1|)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {26055#false} is VALID [2022-02-20 23:48:48,894 INFO L290 TraceCheckUtils]: 17: Hoare triple {26055#false} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {26055#false} is VALID [2022-02-20 23:48:48,894 INFO L290 TraceCheckUtils]: 18: Hoare triple {26055#false} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {26055#false} is VALID [2022-02-20 23:48:48,895 INFO L290 TraceCheckUtils]: 19: Hoare triple {26055#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {26055#false} is VALID [2022-02-20 23:48:48,895 INFO L290 TraceCheckUtils]: 20: Hoare triple {26055#false} assume create_item_#t~short10#1; {26055#false} is VALID [2022-02-20 23:48:48,895 INFO L290 TraceCheckUtils]: 21: Hoare triple {26055#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-3 {26055#false} is VALID [2022-02-20 23:48:48,895 INFO L290 TraceCheckUtils]: 22: Hoare triple {26055#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {26055#false} is VALID [2022-02-20 23:48:48,895 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:48:48,895 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:48,895 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [53102467] [2022-02-20 23:48:48,895 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [53102467] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:48,896 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:48,896 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:48,896 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [792136870] [2022-02-20 23:48:48,896 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:48,896 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:48,896 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:48,897 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:48,909 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:48:48,909 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:48,910 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:48,910 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:48,910 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:48,910 INFO L87 Difference]: Start difference. First operand 409 states and 572 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:49,396 INFO L93 Difference]: Finished difference Result 442 states and 575 transitions. [2022-02-20 23:48:49,397 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:49,397 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:49,397 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:49,397 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,398 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2022-02-20 23:48:49,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,400 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 292 transitions. [2022-02-20 23:48:49,400 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 292 transitions. [2022-02-20 23:48:49,525 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 292 edges. 292 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:49,532 INFO L225 Difference]: With dead ends: 442 [2022-02-20 23:48:49,532 INFO L226 Difference]: Without dead ends: 442 [2022-02-20 23:48:49,532 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:49,533 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 252 mSDsluCounter, 858 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 254 SdHoareTripleChecker+Valid, 1135 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:49,533 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [254 Valid, 1135 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:49,533 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 442 states. [2022-02-20 23:48:49,537 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 442 to 409. [2022-02-20 23:48:49,537 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:49,538 INFO L82 GeneralOperation]: Start isEquivalent. First operand 442 states. Second operand has 409 states, 331 states have (on average 1.661631419939577) internal successors, (550), 394 states have internal predecessors, (550), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:49,538 INFO L74 IsIncluded]: Start isIncluded. First operand 442 states. Second operand has 409 states, 331 states have (on average 1.661631419939577) internal successors, (550), 394 states have internal predecessors, (550), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:49,539 INFO L87 Difference]: Start difference. First operand 442 states. Second operand has 409 states, 331 states have (on average 1.661631419939577) internal successors, (550), 394 states have internal predecessors, (550), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:49,546 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:49,546 INFO L93 Difference]: Finished difference Result 442 states and 575 transitions. [2022-02-20 23:48:49,546 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 575 transitions. [2022-02-20 23:48:49,547 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:49,547 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:49,548 INFO L74 IsIncluded]: Start isIncluded. First operand has 409 states, 331 states have (on average 1.661631419939577) internal successors, (550), 394 states have internal predecessors, (550), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 442 states. [2022-02-20 23:48:49,548 INFO L87 Difference]: Start difference. First operand has 409 states, 331 states have (on average 1.661631419939577) internal successors, (550), 394 states have internal predecessors, (550), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 442 states. [2022-02-20 23:48:49,556 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:49,556 INFO L93 Difference]: Finished difference Result 442 states and 575 transitions. [2022-02-20 23:48:49,556 INFO L276 IsEmpty]: Start isEmpty. Operand 442 states and 575 transitions. [2022-02-20 23:48:49,557 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:49,557 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:49,557 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:49,557 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:49,557 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 409 states, 331 states have (on average 1.661631419939577) internal successors, (550), 394 states have internal predecessors, (550), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:49,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 409 states to 409 states and 570 transitions. [2022-02-20 23:48:49,564 INFO L78 Accepts]: Start accepts. Automaton has 409 states and 570 transitions. Word has length 23 [2022-02-20 23:48:49,564 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:49,565 INFO L470 AbstractCegarLoop]: Abstraction has 409 states and 570 transitions. [2022-02-20 23:48:49,565 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,565 INFO L276 IsEmpty]: Start isEmpty. Operand 409 states and 570 transitions. [2022-02-20 23:48:49,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:48:49,565 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:49,565 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:48:49,565 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:48:49,566 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:49,566 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:49,566 INFO L85 PathProgramCache]: Analyzing trace with hash -582568086, now seen corresponding path program 1 times [2022-02-20 23:48:49,566 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:49,566 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [949190821] [2022-02-20 23:48:49,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:49,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:49,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:49,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:49,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:49,640 INFO L290 TraceCheckUtils]: 0: Hoare triple {27804#true} #res := ~unnamed1~0~LIST_BEG; {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:49,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:49,641 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {27804#true} #333#return; {27809#(and (< 0 (+ |ULTIMATE.start_main_#t~ret32#1| 1)) (<= |ULTIMATE.start_main_#t~ret32#1| 0))} is VALID [2022-02-20 23:48:49,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {27804#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {27804#true} is VALID [2022-02-20 23:48:49,641 INFO L290 TraceCheckUtils]: 1: Hoare triple {27804#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L290 TraceCheckUtils]: 2: Hoare triple {27804#true} main_#t~short29#1 := main_~i~0#1 < 3; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L290 TraceCheckUtils]: 3: Hoare triple {27804#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L290 TraceCheckUtils]: 4: Hoare triple {27804#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L290 TraceCheckUtils]: 5: Hoare triple {27804#true} main_#t~short31#1 := main_~y~1#1 < 4; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L290 TraceCheckUtils]: 6: Hoare triple {27804#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L290 TraceCheckUtils]: 7: Hoare triple {27804#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {27804#true} is VALID [2022-02-20 23:48:49,642 INFO L272 TraceCheckUtils]: 8: Hoare triple {27804#true} call main_#t~ret32#1 := rand_end_point(); {27804#true} is VALID [2022-02-20 23:48:49,643 INFO L290 TraceCheckUtils]: 9: Hoare triple {27804#true} #res := ~unnamed1~0~LIST_BEG; {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:49,643 INFO L290 TraceCheckUtils]: 10: Hoare triple {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:49,644 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {27812#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {27804#true} #333#return; {27809#(and (< 0 (+ |ULTIMATE.start_main_#t~ret32#1| 1)) (<= |ULTIMATE.start_main_#t~ret32#1| 0))} is VALID [2022-02-20 23:48:49,645 INFO L290 TraceCheckUtils]: 12: Hoare triple {27809#(and (< 0 (+ |ULTIMATE.start_main_#t~ret32#1| 1)) (<= |ULTIMATE.start_main_#t~ret32#1| 0))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {27810#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:48:49,645 INFO L290 TraceCheckUtils]: 13: Hoare triple {27810#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {27810#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:48:49,646 INFO L290 TraceCheckUtils]: 14: Hoare triple {27810#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {27811#|ULTIMATE.start_create_item_#t~switch6#1|} is VALID [2022-02-20 23:48:49,646 INFO L290 TraceCheckUtils]: 15: Hoare triple {27811#|ULTIMATE.start_create_item_#t~switch6#1|} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {27805#false} is VALID [2022-02-20 23:48:49,646 INFO L290 TraceCheckUtils]: 16: Hoare triple {27805#false} assume !create_item_#t~switch6#1; {27805#false} is VALID [2022-02-20 23:48:49,646 INFO L290 TraceCheckUtils]: 17: Hoare triple {27805#false} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {27805#false} is VALID [2022-02-20 23:48:49,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {27805#false} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {27805#false} is VALID [2022-02-20 23:48:49,647 INFO L290 TraceCheckUtils]: 19: Hoare triple {27805#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {27805#false} is VALID [2022-02-20 23:48:49,647 INFO L290 TraceCheckUtils]: 20: Hoare triple {27805#false} assume create_item_#t~short10#1; {27805#false} is VALID [2022-02-20 23:48:49,647 INFO L290 TraceCheckUtils]: 21: Hoare triple {27805#false} SUMMARY for call create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-3 {27805#false} is VALID [2022-02-20 23:48:49,647 INFO L290 TraceCheckUtils]: 22: Hoare triple {27805#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {27805#false} is VALID [2022-02-20 23:48:49,649 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:48:49,649 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:49,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [949190821] [2022-02-20 23:48:49,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [949190821] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:49,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:49,649 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:49,649 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1514588171] [2022-02-20 23:48:49,650 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:49,650 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:49,651 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:49,651 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:49,664 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:48:49,664 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:49,664 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:49,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:49,665 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:49,665 INFO L87 Difference]: Start difference. First operand 409 states and 570 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,206 INFO L93 Difference]: Finished difference Result 438 states and 567 transitions. [2022-02-20 23:48:50,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:48:50,207 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 23 [2022-02-20 23:48:50,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:50,207 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 289 transitions. [2022-02-20 23:48:50,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 289 transitions. [2022-02-20 23:48:50,210 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 289 transitions. [2022-02-20 23:48:50,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 289 edges. 289 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:50,405 INFO L225 Difference]: With dead ends: 438 [2022-02-20 23:48:50,405 INFO L226 Difference]: Without dead ends: 438 [2022-02-20 23:48:50,405 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:48:50,406 INFO L933 BasicCegarLoop]: 275 mSDtfsCounter, 249 mSDsluCounter, 856 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 251 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:50,406 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [251 Valid, 1131 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:50,406 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 438 states. [2022-02-20 23:48:50,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 438 to 407. [2022-02-20 23:48:50,411 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:50,411 INFO L82 GeneralOperation]: Start isEquivalent. First operand 438 states. Second operand has 407 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 392 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,412 INFO L74 IsIncluded]: Start isIncluded. First operand 438 states. Second operand has 407 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 392 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,412 INFO L87 Difference]: Start difference. First operand 438 states. Second operand has 407 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 392 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,422 INFO L93 Difference]: Finished difference Result 438 states and 567 transitions. [2022-02-20 23:48:50,422 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 567 transitions. [2022-02-20 23:48:50,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,424 INFO L74 IsIncluded]: Start isIncluded. First operand has 407 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 392 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 438 states. [2022-02-20 23:48:50,424 INFO L87 Difference]: Start difference. First operand has 407 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 392 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 438 states. [2022-02-20 23:48:50,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,432 INFO L93 Difference]: Finished difference Result 438 states and 567 transitions. [2022-02-20 23:48:50,432 INFO L276 IsEmpty]: Start isEmpty. Operand 438 states and 567 transitions. [2022-02-20 23:48:50,432 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,433 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:50,433 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:50,433 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 407 states, 329 states have (on average 1.6534954407294833) internal successors, (544), 392 states have internal predecessors, (544), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 407 states to 407 states and 564 transitions. [2022-02-20 23:48:50,440 INFO L78 Accepts]: Start accepts. Automaton has 407 states and 564 transitions. Word has length 23 [2022-02-20 23:48:50,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:50,441 INFO L470 AbstractCegarLoop]: Abstraction has 407 states and 564 transitions. [2022-02-20 23:48:50,441 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 5 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,441 INFO L276 IsEmpty]: Start isEmpty. Operand 407 states and 564 transitions. [2022-02-20 23:48:50,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:48:50,441 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:50,442 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:48:50,442 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:48:50,442 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:50,442 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:50,442 INFO L85 PathProgramCache]: Analyzing trace with hash -2129210531, now seen corresponding path program 1 times [2022-02-20 23:48:50,443 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:50,443 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [249503517] [2022-02-20 23:48:50,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:50,443 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:50,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,464 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:50,466 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:50,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {29540#true} #res := ~unnamed1~0~LIST_BEG; {29540#true} is VALID [2022-02-20 23:48:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {29540#true} assume true; {29540#true} is VALID [2022-02-20 23:48:50,468 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {29540#true} {29540#true} #333#return; {29540#true} is VALID [2022-02-20 23:48:50,468 INFO L290 TraceCheckUtils]: 0: Hoare triple {29540#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {29540#true} is VALID [2022-02-20 23:48:50,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {29540#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L290 TraceCheckUtils]: 2: Hoare triple {29540#true} main_#t~short29#1 := main_~i~0#1 < 3; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L290 TraceCheckUtils]: 3: Hoare triple {29540#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L290 TraceCheckUtils]: 4: Hoare triple {29540#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L290 TraceCheckUtils]: 5: Hoare triple {29540#true} main_#t~short31#1 := main_~y~1#1 < 4; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L290 TraceCheckUtils]: 6: Hoare triple {29540#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L290 TraceCheckUtils]: 7: Hoare triple {29540#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {29540#true} is VALID [2022-02-20 23:48:50,469 INFO L272 TraceCheckUtils]: 8: Hoare triple {29540#true} call main_#t~ret32#1 := rand_end_point(); {29540#true} is VALID [2022-02-20 23:48:50,470 INFO L290 TraceCheckUtils]: 9: Hoare triple {29540#true} #res := ~unnamed1~0~LIST_BEG; {29540#true} is VALID [2022-02-20 23:48:50,470 INFO L290 TraceCheckUtils]: 10: Hoare triple {29540#true} assume true; {29540#true} is VALID [2022-02-20 23:48:50,470 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {29540#true} {29540#true} #333#return; {29540#true} is VALID [2022-02-20 23:48:50,471 INFO L290 TraceCheckUtils]: 12: Hoare triple {29540#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,471 INFO L290 TraceCheckUtils]: 13: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,472 INFO L290 TraceCheckUtils]: 14: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,472 INFO L290 TraceCheckUtils]: 15: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,472 INFO L290 TraceCheckUtils]: 16: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,473 INFO L290 TraceCheckUtils]: 17: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,474 INFO L290 TraceCheckUtils]: 18: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,474 INFO L290 TraceCheckUtils]: 19: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short10#1; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,474 INFO L290 TraceCheckUtils]: 20: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,475 INFO L290 TraceCheckUtils]: 21: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,475 INFO L290 TraceCheckUtils]: 22: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:48:50,476 INFO L290 TraceCheckUtils]: 23: Hoare triple {29545#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(1 == #valid[create_item_~item~0#1.base]); {29541#false} is VALID [2022-02-20 23:48:50,476 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:48:50,476 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:50,476 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [249503517] [2022-02-20 23:48:50,476 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [249503517] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:50,476 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:50,476 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:48:50,476 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1984097743] [2022-02-20 23:48:50,477 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:50,477 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-20 23:48:50,477 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:50,477 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,491 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:48:50,491 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:48:50,491 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:50,492 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:48:50,492 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:48:50,492 INFO L87 Difference]: Start difference. First operand 407 states and 564 transitions. Second operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,764 INFO L93 Difference]: Finished difference Result 499 states and 664 transitions. [2022-02-20 23:48:50,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:48:50,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-20 23:48:50,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:50,766 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 23:48:50,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:50,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 297 transitions. [2022-02-20 23:48:50,768 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 297 transitions. [2022-02-20 23:48:50,965 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 297 edges. 297 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:50,974 INFO L225 Difference]: With dead ends: 499 [2022-02-20 23:48:50,974 INFO L226 Difference]: Without dead ends: 499 [2022-02-20 23:48:50,974 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:48:50,975 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 156 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 101 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 291 SdHoareTripleChecker+Invalid, 103 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 101 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:50,975 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [158 Valid, 291 Invalid, 103 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 101 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:48:50,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 499 states. [2022-02-20 23:48:50,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 499 to 404. [2022-02-20 23:48:50,981 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:50,982 INFO L82 GeneralOperation]: Start isEquivalent. First operand 499 states. Second operand has 404 states, 329 states have (on average 1.6261398176291793) internal successors, (535), 389 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,982 INFO L74 IsIncluded]: Start isIncluded. First operand 499 states. Second operand has 404 states, 329 states have (on average 1.6261398176291793) internal successors, (535), 389 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,983 INFO L87 Difference]: Start difference. First operand 499 states. Second operand has 404 states, 329 states have (on average 1.6261398176291793) internal successors, (535), 389 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:50,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:50,992 INFO L93 Difference]: Finished difference Result 499 states and 664 transitions. [2022-02-20 23:48:50,992 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 664 transitions. [2022-02-20 23:48:50,993 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:50,993 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:50,993 INFO L74 IsIncluded]: Start isIncluded. First operand has 404 states, 329 states have (on average 1.6261398176291793) internal successors, (535), 389 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 499 states. [2022-02-20 23:48:50,994 INFO L87 Difference]: Start difference. First operand has 404 states, 329 states have (on average 1.6261398176291793) internal successors, (535), 389 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 499 states. [2022-02-20 23:48:51,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,003 INFO L93 Difference]: Finished difference Result 499 states and 664 transitions. [2022-02-20 23:48:51,003 INFO L276 IsEmpty]: Start isEmpty. Operand 499 states and 664 transitions. [2022-02-20 23:48:51,003 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:51,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:51,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:51,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:51,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 404 states, 329 states have (on average 1.6261398176291793) internal successors, (535), 389 states have internal predecessors, (535), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:51,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 404 states to 404 states and 555 transitions. [2022-02-20 23:48:51,011 INFO L78 Accepts]: Start accepts. Automaton has 404 states and 555 transitions. Word has length 24 [2022-02-20 23:48:51,011 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:51,011 INFO L470 AbstractCegarLoop]: Abstraction has 404 states and 555 transitions. [2022-02-20 23:48:51,011 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.0) internal successors, (22), 3 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,011 INFO L276 IsEmpty]: Start isEmpty. Operand 404 states and 555 transitions. [2022-02-20 23:48:51,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 23:48:51,011 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:51,012 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:48:51,012 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:48:51,012 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:51,013 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:51,013 INFO L85 PathProgramCache]: Analyzing trace with hash -2129210530, now seen corresponding path program 1 times [2022-02-20 23:48:51,013 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:51,013 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033221340] [2022-02-20 23:48:51,013 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:51,013 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:51,026 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:51,061 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:51,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:51,064 INFO L290 TraceCheckUtils]: 0: Hoare triple {31449#true} #res := ~unnamed1~0~LIST_BEG; {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {31449#true} assume true; {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {31449#true} {31449#true} #333#return; {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L290 TraceCheckUtils]: 0: Hoare triple {31449#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L290 TraceCheckUtils]: 1: Hoare triple {31449#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L290 TraceCheckUtils]: 2: Hoare triple {31449#true} main_#t~short29#1 := main_~i~0#1 < 3; {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L290 TraceCheckUtils]: 3: Hoare triple {31449#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {31449#true} is VALID [2022-02-20 23:48:51,065 INFO L290 TraceCheckUtils]: 4: Hoare triple {31449#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L290 TraceCheckUtils]: 5: Hoare triple {31449#true} main_#t~short31#1 := main_~y~1#1 < 4; {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L290 TraceCheckUtils]: 6: Hoare triple {31449#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L290 TraceCheckUtils]: 7: Hoare triple {31449#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L272 TraceCheckUtils]: 8: Hoare triple {31449#true} call main_#t~ret32#1 := rand_end_point(); {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L290 TraceCheckUtils]: 9: Hoare triple {31449#true} #res := ~unnamed1~0~LIST_BEG; {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L290 TraceCheckUtils]: 10: Hoare triple {31449#true} assume true; {31449#true} is VALID [2022-02-20 23:48:51,066 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {31449#true} {31449#true} #333#return; {31449#true} is VALID [2022-02-20 23:48:51,067 INFO L290 TraceCheckUtils]: 12: Hoare triple {31449#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {31454#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:51,068 INFO L290 TraceCheckUtils]: 13: Hoare triple {31454#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {31454#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:51,068 INFO L290 TraceCheckUtils]: 14: Hoare triple {31454#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {31454#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:51,068 INFO L290 TraceCheckUtils]: 15: Hoare triple {31454#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,069 INFO L290 TraceCheckUtils]: 16: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,069 INFO L290 TraceCheckUtils]: 17: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,070 INFO L290 TraceCheckUtils]: 18: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,070 INFO L290 TraceCheckUtils]: 19: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} assume !create_item_#t~short10#1; {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,074 INFO L290 TraceCheckUtils]: 20: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,075 INFO L290 TraceCheckUtils]: 21: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,076 INFO L290 TraceCheckUtils]: 22: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:48:51,076 INFO L290 TraceCheckUtils]: 23: Hoare triple {31455#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} assume !(4 + (create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1) <= #length[create_item_~item~0#1.base] && 0 <= create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1); {31450#false} is VALID [2022-02-20 23:48:51,076 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:48:51,076 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:51,077 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033221340] [2022-02-20 23:48:51,077 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033221340] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:51,077 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:51,077 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:51,077 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [832253980] [2022-02-20 23:48:51,077 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:51,078 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-20 23:48:51,078 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:51,078 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,092 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:48:51,092 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:51,092 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:51,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:51,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:51,093 INFO L87 Difference]: Start difference. First operand 404 states and 555 transitions. Second operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,524 INFO L93 Difference]: Finished difference Result 433 states and 552 transitions. [2022-02-20 23:48:51,524 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:51,524 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 24 [2022-02-20 23:48:51,525 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:51,525 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,526 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2022-02-20 23:48:51,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 285 transitions. [2022-02-20 23:48:51,527 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 285 transitions. [2022-02-20 23:48:51,724 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 285 edges. 285 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:51,731 INFO L225 Difference]: With dead ends: 433 [2022-02-20 23:48:51,732 INFO L226 Difference]: Without dead ends: 433 [2022-02-20 23:48:51,732 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:48:51,732 INFO L933 BasicCegarLoop]: 218 mSDtfsCounter, 173 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 104 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 175 SdHoareTripleChecker+Valid, 382 SdHoareTripleChecker+Invalid, 105 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 104 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:51,732 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [175 Valid, 382 Invalid, 105 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 104 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:51,733 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 433 states. [2022-02-20 23:48:51,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 433 to 402. [2022-02-20 23:48:51,737 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:51,737 INFO L82 GeneralOperation]: Start isEquivalent. First operand 433 states. Second operand has 402 states, 329 states have (on average 1.6079027355623101) internal successors, (529), 387 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:51,738 INFO L74 IsIncluded]: Start isIncluded. First operand 433 states. Second operand has 402 states, 329 states have (on average 1.6079027355623101) internal successors, (529), 387 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:51,738 INFO L87 Difference]: Start difference. First operand 433 states. Second operand has 402 states, 329 states have (on average 1.6079027355623101) internal successors, (529), 387 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:51,750 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,750 INFO L93 Difference]: Finished difference Result 433 states and 552 transitions. [2022-02-20 23:48:51,750 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 552 transitions. [2022-02-20 23:48:51,751 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:51,751 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:51,752 INFO L74 IsIncluded]: Start isIncluded. First operand has 402 states, 329 states have (on average 1.6079027355623101) internal successors, (529), 387 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 433 states. [2022-02-20 23:48:51,752 INFO L87 Difference]: Start difference. First operand has 402 states, 329 states have (on average 1.6079027355623101) internal successors, (529), 387 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 433 states. [2022-02-20 23:48:51,759 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:51,760 INFO L93 Difference]: Finished difference Result 433 states and 552 transitions. [2022-02-20 23:48:51,760 INFO L276 IsEmpty]: Start isEmpty. Operand 433 states and 552 transitions. [2022-02-20 23:48:51,760 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:51,760 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:51,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:51,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:51,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 402 states, 329 states have (on average 1.6079027355623101) internal successors, (529), 387 states have internal predecessors, (529), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:51,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 402 states to 402 states and 549 transitions. [2022-02-20 23:48:51,769 INFO L78 Accepts]: Start accepts. Automaton has 402 states and 549 transitions. Word has length 24 [2022-02-20 23:48:51,769 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:51,769 INFO L470 AbstractCegarLoop]: Abstraction has 402 states and 549 transitions. [2022-02-20 23:48:51,769 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.333333333333333) internal successors, (22), 4 states have internal predecessors, (22), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,770 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 549 transitions. [2022-02-20 23:48:51,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:48:51,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:51,770 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:48:51,770 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:48:51,771 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:51,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:51,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1695234990, now seen corresponding path program 1 times [2022-02-20 23:48:51,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:51,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1362257323] [2022-02-20 23:48:51,771 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:51,771 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:51,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:51,805 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:51,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:51,809 INFO L290 TraceCheckUtils]: 0: Hoare triple {33159#true} #res := ~unnamed1~0~LIST_BEG; {33159#true} is VALID [2022-02-20 23:48:51,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {33159#true} assume true; {33159#true} is VALID [2022-02-20 23:48:51,809 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {33159#true} {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #335#return; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,810 INFO L290 TraceCheckUtils]: 0: Hoare triple {33159#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,810 INFO L290 TraceCheckUtils]: 1: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,811 INFO L290 TraceCheckUtils]: 2: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short29#1 := main_~i~0#1 < 3; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,811 INFO L290 TraceCheckUtils]: 3: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,812 INFO L290 TraceCheckUtils]: 4: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,812 INFO L290 TraceCheckUtils]: 5: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short31#1 := main_~y~1#1 < 4; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,812 INFO L290 TraceCheckUtils]: 6: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,813 INFO L290 TraceCheckUtils]: 7: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,813 INFO L290 TraceCheckUtils]: 8: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short36#1 := main_~z~0#1 < 7; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,814 INFO L290 TraceCheckUtils]: 9: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,814 INFO L290 TraceCheckUtils]: 10: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,814 INFO L272 TraceCheckUtils]: 11: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret37#1 := rand_end_point(); {33159#true} is VALID [2022-02-20 23:48:51,814 INFO L290 TraceCheckUtils]: 12: Hoare triple {33159#true} #res := ~unnamed1~0~LIST_BEG; {33159#true} is VALID [2022-02-20 23:48:51,814 INFO L290 TraceCheckUtils]: 13: Hoare triple {33159#true} assume true; {33159#true} is VALID [2022-02-20 23:48:51,815 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {33159#true} {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #335#return; {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:51,815 INFO L290 TraceCheckUtils]: 15: Hoare triple {33161#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,816 INFO L290 TraceCheckUtils]: 16: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,816 INFO L290 TraceCheckUtils]: 17: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,817 INFO L290 TraceCheckUtils]: 18: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,817 INFO L290 TraceCheckUtils]: 19: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,818 INFO L290 TraceCheckUtils]: 20: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,818 INFO L290 TraceCheckUtils]: 21: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is_empty_#res#1 := is_empty_~no_beg~0#1; {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,820 INFO L290 TraceCheckUtils]: 22: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,820 INFO L290 TraceCheckUtils]: 23: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} is VALID [2022-02-20 23:48:51,822 INFO L290 TraceCheckUtils]: 24: Hoare triple {33165#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(1 == #valid[remove_one_~list#1.base]); {33160#false} is VALID [2022-02-20 23:48:51,822 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:48:51,822 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:51,822 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1362257323] [2022-02-20 23:48:51,822 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1362257323] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:51,822 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:51,823 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:51,823 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525602573] [2022-02-20 23:48:51,823 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:51,823 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:51,823 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:51,823 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:51,839 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:48:51,839 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:51,839 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:51,839 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:51,840 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:51,840 INFO L87 Difference]: Start difference. First operand 402 states and 549 transitions. Second operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,368 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:52,368 INFO L93 Difference]: Finished difference Result 635 states and 810 transitions. [2022-02-20 23:48:52,368 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:52,368 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:52,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:52,368 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-02-20 23:48:52,370 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 461 transitions. [2022-02-20 23:48:52,388 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 461 transitions. [2022-02-20 23:48:52,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 461 edges. 461 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:52,663 INFO L225 Difference]: With dead ends: 635 [2022-02-20 23:48:52,663 INFO L226 Difference]: Without dead ends: 635 [2022-02-20 23:48:52,663 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 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:48:52,664 INFO L933 BasicCegarLoop]: 209 mSDtfsCounter, 298 mSDsluCounter, 237 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 446 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 225 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:52,676 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 446 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:52,681 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-02-20 23:48:52,688 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 430. [2022-02-20 23:48:52,688 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:52,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand has 430 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 415 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:52,689 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand has 430 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 415 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:52,689 INFO L87 Difference]: Start difference. First operand 635 states. Second operand has 430 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 415 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:52,714 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:52,714 INFO L93 Difference]: Finished difference Result 635 states and 810 transitions. [2022-02-20 23:48:52,715 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 810 transitions. [2022-02-20 23:48:52,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:52,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:52,725 INFO L74 IsIncluded]: Start isIncluded. First operand has 430 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 415 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 635 states. [2022-02-20 23:48:52,729 INFO L87 Difference]: Start difference. First operand has 430 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 415 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 635 states. [2022-02-20 23:48:52,743 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:52,759 INFO L93 Difference]: Finished difference Result 635 states and 810 transitions. [2022-02-20 23:48:52,759 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 810 transitions. [2022-02-20 23:48:52,761 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:52,761 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:52,761 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:52,761 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:52,762 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.6274509803921569) internal successors, (581), 415 states have internal predecessors, (581), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:52,783 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 601 transitions. [2022-02-20 23:48:52,783 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 601 transitions. Word has length 25 [2022-02-20 23:48:52,783 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:52,783 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 601 transitions. [2022-02-20 23:48:52,783 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.666666666666667) internal successors, (23), 4 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,784 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 601 transitions. [2022-02-20 23:48:52,784 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:48:52,784 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:52,784 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:48:52,784 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:48:52,784 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:52,784 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:52,785 INFO L85 PathProgramCache]: Analyzing trace with hash -1695234989, now seen corresponding path program 1 times [2022-02-20 23:48:52,785 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:52,785 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1353885191] [2022-02-20 23:48:52,785 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:52,785 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:52,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:52,918 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:52,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:52,921 INFO L290 TraceCheckUtils]: 0: Hoare triple {35505#true} #res := ~unnamed1~0~LIST_BEG; {35505#true} is VALID [2022-02-20 23:48:52,921 INFO L290 TraceCheckUtils]: 1: Hoare triple {35505#true} assume true; {35505#true} is VALID [2022-02-20 23:48:52,922 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {35505#true} {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #335#return; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,922 INFO L290 TraceCheckUtils]: 0: Hoare triple {35505#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,923 INFO L290 TraceCheckUtils]: 1: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,923 INFO L290 TraceCheckUtils]: 2: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short29#1 := main_~i~0#1 < 3; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,925 INFO L290 TraceCheckUtils]: 3: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,926 INFO L290 TraceCheckUtils]: 4: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,926 INFO L290 TraceCheckUtils]: 5: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short31#1 := main_~y~1#1 < 4; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,927 INFO L290 TraceCheckUtils]: 6: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,927 INFO L290 TraceCheckUtils]: 7: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,928 INFO L290 TraceCheckUtils]: 8: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short36#1 := main_~z~0#1 < 7; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,928 INFO L290 TraceCheckUtils]: 9: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,928 INFO L290 TraceCheckUtils]: 10: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,928 INFO L272 TraceCheckUtils]: 11: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret37#1 := rand_end_point(); {35505#true} is VALID [2022-02-20 23:48:52,928 INFO L290 TraceCheckUtils]: 12: Hoare triple {35505#true} #res := ~unnamed1~0~LIST_BEG; {35505#true} is VALID [2022-02-20 23:48:52,928 INFO L290 TraceCheckUtils]: 13: Hoare triple {35505#true} assume true; {35505#true} is VALID [2022-02-20 23:48:52,929 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {35505#true} {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #335#return; {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:48:52,929 INFO L290 TraceCheckUtils]: 15: Hoare triple {35507#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {35511#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:52,930 INFO L290 TraceCheckUtils]: 16: Hoare triple {35511#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {35512#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:52,930 INFO L290 TraceCheckUtils]: 17: Hoare triple {35512#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {35512#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:48:52,931 INFO L290 TraceCheckUtils]: 18: Hoare triple {35512#(and (= (+ (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) (- 8)) 0) (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:52,932 INFO L290 TraceCheckUtils]: 19: Hoare triple {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:52,932 INFO L290 TraceCheckUtils]: 20: Hoare triple {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:52,932 INFO L290 TraceCheckUtils]: 21: Hoare triple {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_#res#1 := is_empty_~no_beg~0#1; {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:52,933 INFO L290 TraceCheckUtils]: 22: Hoare triple {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:52,933 INFO L290 TraceCheckUtils]: 23: Hoare triple {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:52,934 INFO L290 TraceCheckUtils]: 24: Hoare triple {35513#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(4 + (remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {35506#false} is VALID [2022-02-20 23:48:52,934 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:48:52,934 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:52,934 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1353885191] [2022-02-20 23:48:52,934 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1353885191] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:52,934 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:52,935 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:52,935 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [8559978] [2022-02-20 23:48:52,935 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:52,935 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:52,935 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:52,936 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:52,953 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:48:52,953 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:52,954 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:52,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:52,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:52,954 INFO L87 Difference]: Start difference. First operand 430 states and 601 transitions. Second operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:53,694 INFO L93 Difference]: Finished difference Result 473 states and 616 transitions. [2022-02-20 23:48:53,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:53,695 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 25 [2022-02-20 23:48:53,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:53,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,718 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2022-02-20 23:48:53,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,720 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 305 transitions. [2022-02-20 23:48:53,720 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 305 transitions. [2022-02-20 23:48:53,891 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 305 edges. 305 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:53,899 INFO L225 Difference]: With dead ends: 473 [2022-02-20 23:48:53,899 INFO L226 Difference]: Without dead ends: 473 [2022-02-20 23:48:53,899 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:48:53,901 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 345 mSDsluCounter, 359 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 345 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 250 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:53,901 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [345 Valid, 538 Invalid, 250 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:53,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 473 states. [2022-02-20 23:48:53,930 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 473 to 430. [2022-02-20 23:48:53,930 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:53,931 INFO L82 GeneralOperation]: Start isEquivalent. First operand 473 states. Second operand has 430 states, 357 states have (on average 1.6022408963585435) internal successors, (572), 415 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:53,931 INFO L74 IsIncluded]: Start isIncluded. First operand 473 states. Second operand has 430 states, 357 states have (on average 1.6022408963585435) internal successors, (572), 415 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:53,931 INFO L87 Difference]: Start difference. First operand 473 states. Second operand has 430 states, 357 states have (on average 1.6022408963585435) internal successors, (572), 415 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:53,940 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:53,940 INFO L93 Difference]: Finished difference Result 473 states and 616 transitions. [2022-02-20 23:48:53,940 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 616 transitions. [2022-02-20 23:48:53,941 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:53,941 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:53,941 INFO L74 IsIncluded]: Start isIncluded. First operand has 430 states, 357 states have (on average 1.6022408963585435) internal successors, (572), 415 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 473 states. [2022-02-20 23:48:53,942 INFO L87 Difference]: Start difference. First operand has 430 states, 357 states have (on average 1.6022408963585435) internal successors, (572), 415 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 473 states. [2022-02-20 23:48:53,966 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:53,967 INFO L93 Difference]: Finished difference Result 473 states and 616 transitions. [2022-02-20 23:48:53,967 INFO L276 IsEmpty]: Start isEmpty. Operand 473 states and 616 transitions. [2022-02-20 23:48:53,971 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:53,971 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:53,971 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:53,971 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:53,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 430 states, 357 states have (on average 1.6022408963585435) internal successors, (572), 415 states have internal predecessors, (572), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:53,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 430 states to 430 states and 592 transitions. [2022-02-20 23:48:53,979 INFO L78 Accepts]: Start accepts. Automaton has 430 states and 592 transitions. Word has length 25 [2022-02-20 23:48:53,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:53,979 INFO L470 AbstractCegarLoop]: Abstraction has 430 states and 592 transitions. [2022-02-20 23:48:53,979 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.6) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:53,979 INFO L276 IsEmpty]: Start isEmpty. Operand 430 states and 592 transitions. [2022-02-20 23:48:53,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:48:53,980 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:53,980 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:48:53,980 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:48:53,980 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:53,980 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:53,980 INFO L85 PathProgramCache]: Analyzing trace with hash -1766884672, now seen corresponding path program 1 times [2022-02-20 23:48:53,980 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:53,980 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [540442441] [2022-02-20 23:48:53,980 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:53,980 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:54,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:54,073 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:54,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:54,075 INFO L290 TraceCheckUtils]: 0: Hoare triple {37371#true} #res := ~unnamed1~0~LIST_BEG; {37371#true} is VALID [2022-02-20 23:48:54,075 INFO L290 TraceCheckUtils]: 1: Hoare triple {37371#true} assume true; {37371#true} is VALID [2022-02-20 23:48:54,075 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {37371#true} {37371#true} #333#return; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 0: Hoare triple {37371#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 1: Hoare triple {37371#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 2: Hoare triple {37371#true} main_#t~short29#1 := main_~i~0#1 < 3; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 3: Hoare triple {37371#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 4: Hoare triple {37371#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 5: Hoare triple {37371#true} main_#t~short31#1 := main_~y~1#1 < 4; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 6: Hoare triple {37371#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 7: Hoare triple {37371#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L272 TraceCheckUtils]: 8: Hoare triple {37371#true} call main_#t~ret32#1 := rand_end_point(); {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 9: Hoare triple {37371#true} #res := ~unnamed1~0~LIST_BEG; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L290 TraceCheckUtils]: 10: Hoare triple {37371#true} assume true; {37371#true} is VALID [2022-02-20 23:48:54,076 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {37371#true} {37371#true} #333#return; {37371#true} is VALID [2022-02-20 23:48:54,077 INFO L290 TraceCheckUtils]: 12: Hoare triple {37371#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {37376#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:54,077 INFO L290 TraceCheckUtils]: 13: Hoare triple {37376#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {37376#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:54,078 INFO L290 TraceCheckUtils]: 14: Hoare triple {37376#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {37376#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:48:54,078 INFO L290 TraceCheckUtils]: 15: Hoare triple {37376#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,078 INFO L290 TraceCheckUtils]: 16: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,079 INFO L290 TraceCheckUtils]: 17: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,079 INFO L290 TraceCheckUtils]: 18: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,080 INFO L290 TraceCheckUtils]: 19: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !create_item_#t~short10#1; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,080 INFO L290 TraceCheckUtils]: 20: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,081 INFO L290 TraceCheckUtils]: 21: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,081 INFO L290 TraceCheckUtils]: 22: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,081 INFO L290 TraceCheckUtils]: 23: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,082 INFO L290 TraceCheckUtils]: 24: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,082 INFO L290 TraceCheckUtils]: 25: Hoare triple {37377#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ 265 (* |ULTIMATE.start_create_item_~term_field~0#1| 4)) (+ (* ~unnamed2~0~ITEM_PREV 4) (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|))) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(4 + (create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1) <= #length[create_item_~item~0#1.base] && 0 <= create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1); {37372#false} is VALID [2022-02-20 23:48:54,083 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:48:54,083 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:54,083 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [540442441] [2022-02-20 23:48:54,083 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [540442441] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:54,083 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:54,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:48:54,083 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [869152354] [2022-02-20 23:48:54,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:54,083 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:48:54,083 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:54,084 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,099 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:48:54,099 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:48:54,099 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:54,100 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:48:54,100 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:48:54,100 INFO L87 Difference]: Start difference. First operand 430 states and 592 transitions. Second operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,389 INFO L93 Difference]: Finished difference Result 457 states and 592 transitions. [2022-02-20 23:48:54,389 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:48:54,389 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:48:54,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:54,389 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,391 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-02-20 23:48:54,391 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,392 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 280 transitions. [2022-02-20 23:48:54,392 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 280 transitions. [2022-02-20 23:48:54,554 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:54,563 INFO L225 Difference]: With dead ends: 457 [2022-02-20 23:48:54,563 INFO L226 Difference]: Without dead ends: 457 [2022-02-20 23:48:54,564 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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:48:54,570 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 172 mSDsluCounter, 164 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 174 SdHoareTripleChecker+Valid, 380 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:54,571 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [174 Valid, 380 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:54,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 457 states. [2022-02-20 23:48:54,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 457 to 429. [2022-02-20 23:48:54,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:54,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 457 states. Second operand has 429 states, 357 states have (on average 1.5938375350140057) internal successors, (569), 414 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:54,619 INFO L74 IsIncluded]: Start isIncluded. First operand 457 states. Second operand has 429 states, 357 states have (on average 1.5938375350140057) internal successors, (569), 414 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:54,619 INFO L87 Difference]: Start difference. First operand 457 states. Second operand has 429 states, 357 states have (on average 1.5938375350140057) internal successors, (569), 414 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:54,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,627 INFO L93 Difference]: Finished difference Result 457 states and 592 transitions. [2022-02-20 23:48:54,627 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 592 transitions. [2022-02-20 23:48:54,628 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:54,628 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:54,628 INFO L74 IsIncluded]: Start isIncluded. First operand has 429 states, 357 states have (on average 1.5938375350140057) internal successors, (569), 414 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 457 states. [2022-02-20 23:48:54,629 INFO L87 Difference]: Start difference. First operand has 429 states, 357 states have (on average 1.5938375350140057) internal successors, (569), 414 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 457 states. [2022-02-20 23:48:54,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:54,638 INFO L93 Difference]: Finished difference Result 457 states and 592 transitions. [2022-02-20 23:48:54,638 INFO L276 IsEmpty]: Start isEmpty. Operand 457 states and 592 transitions. [2022-02-20 23:48:54,638 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:54,638 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:54,638 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:54,638 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:54,639 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 429 states, 357 states have (on average 1.5938375350140057) internal successors, (569), 414 states have internal predecessors, (569), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:54,663 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 429 states to 429 states and 589 transitions. [2022-02-20 23:48:54,663 INFO L78 Accepts]: Start accepts. Automaton has 429 states and 589 transitions. Word has length 26 [2022-02-20 23:48:54,663 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:54,663 INFO L470 AbstractCegarLoop]: Abstraction has 429 states and 589 transitions. [2022-02-20 23:48:54,663 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.0) internal successors, (24), 4 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,663 INFO L276 IsEmpty]: Start isEmpty. Operand 429 states and 589 transitions. [2022-02-20 23:48:54,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:48:54,680 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:54,680 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:48:54,680 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:48:54,680 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:54,680 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:54,680 INFO L85 PathProgramCache]: Analyzing trace with hash -1766884865, now seen corresponding path program 1 times [2022-02-20 23:48:54,680 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:54,680 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1986651534] [2022-02-20 23:48:54,681 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:54,681 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:54,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:54,766 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:48:54,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {39180#true} #res := ~unnamed1~0~LIST_BEG; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {39180#true} assume true; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {39180#true} {39180#true} #333#return; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {39180#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {39180#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {39180#true} main_#t~short29#1 := main_~i~0#1 < 3; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 3: Hoare triple {39180#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 4: Hoare triple {39180#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 5: Hoare triple {39180#true} main_#t~short31#1 := main_~y~1#1 < 4; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 6: Hoare triple {39180#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 7: Hoare triple {39180#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L272 TraceCheckUtils]: 8: Hoare triple {39180#true} call main_#t~ret32#1 := rand_end_point(); {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 9: Hoare triple {39180#true} #res := ~unnamed1~0~LIST_BEG; {39180#true} is VALID [2022-02-20 23:48:54,770 INFO L290 TraceCheckUtils]: 10: Hoare triple {39180#true} assume true; {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {39180#true} {39180#true} #333#return; {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L290 TraceCheckUtils]: 12: Hoare triple {39180#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L290 TraceCheckUtils]: 13: Hoare triple {39180#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L290 TraceCheckUtils]: 14: Hoare triple {39180#true} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L290 TraceCheckUtils]: 15: Hoare triple {39180#true} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {39180#true} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {39180#true} is VALID [2022-02-20 23:48:54,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {39180#true} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {39185#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|))} is VALID [2022-02-20 23:48:54,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {39185#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) |ULTIMATE.start_create_item_#t~mem8#1.offset|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {39186#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) |ULTIMATE.start_create_item_#t~short10#1|)} is VALID [2022-02-20 23:48:54,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {39186#(or (and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0)) |ULTIMATE.start_create_item_#t~short10#1|)} assume !create_item_#t~short10#1; {39187#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:48:54,772 INFO L290 TraceCheckUtils]: 20: Hoare triple {39187#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {39187#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} is VALID [2022-02-20 23:48:54,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {39187#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) |ULTIMATE.start_create_item_~cursor#1.offset|) 0))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {39188#(and (= |ULTIMATE.start_create_item_#t~mem13#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem13#1.base| 0))} is VALID [2022-02-20 23:48:54,773 INFO L290 TraceCheckUtils]: 22: Hoare triple {39188#(and (= |ULTIMATE.start_create_item_#t~mem13#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem13#1.base| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {39189#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {39189#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {39189#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} is VALID [2022-02-20 23:48:54,774 INFO L290 TraceCheckUtils]: 24: Hoare triple {39189#(and (= |ULTIMATE.start_create_item_~link~0#1.base| 0) (= |ULTIMATE.start_create_item_~link~0#1.offset| 0))} assume create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0; {39181#false} is VALID [2022-02-20 23:48:54,774 INFO L290 TraceCheckUtils]: 25: Hoare triple {39181#false} assume !(4 + (create_item_~link~0#1.offset + 4 * create_item_~term_field~0#1) <= #length[create_item_~link~0#1.base] && 0 <= create_item_~link~0#1.offset + 4 * create_item_~term_field~0#1); {39181#false} is VALID [2022-02-20 23:48:54,774 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:48:54,774 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:54,774 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1986651534] [2022-02-20 23:48:54,775 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1986651534] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:54,775 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:54,775 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:48:54,775 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1431361126] [2022-02-20 23:48:54,775 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:54,776 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:48:54,776 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:54,776 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:54,807 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:48:54,808 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:54,808 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:54,808 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:54,808 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:54,808 INFO L87 Difference]: Start difference. First operand 429 states and 589 transitions. Second operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:55,744 INFO L93 Difference]: Finished difference Result 649 states and 872 transitions. [2022-02-20 23:48:55,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:48:55,744 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 26 [2022-02-20 23:48:55,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:55,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 338 transitions. [2022-02-20 23:48:55,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:55,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 338 transitions. [2022-02-20 23:48:55,749 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 338 transitions. [2022-02-20 23:48:55,969 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 338 edges. 338 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:55,981 INFO L225 Difference]: With dead ends: 649 [2022-02-20 23:48:55,982 INFO L226 Difference]: Without dead ends: 649 [2022-02-20 23:48:55,982 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:48:55,985 INFO L933 BasicCegarLoop]: 255 mSDtfsCounter, 160 mSDsluCounter, 1060 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 162 SdHoareTripleChecker+Valid, 1315 SdHoareTripleChecker+Invalid, 207 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:55,985 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [162 Valid, 1315 Invalid, 207 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:55,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 649 states. [2022-02-20 23:48:55,993 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 649 to 459. [2022-02-20 23:48:55,993 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:55,993 INFO L82 GeneralOperation]: Start isEquivalent. First operand 649 states. Second operand has 459 states, 387 states have (on average 1.5607235142118863) internal successors, (604), 444 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:55,994 INFO L74 IsIncluded]: Start isIncluded. First operand 649 states. Second operand has 459 states, 387 states have (on average 1.5607235142118863) internal successors, (604), 444 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:55,994 INFO L87 Difference]: Start difference. First operand 649 states. Second operand has 459 states, 387 states have (on average 1.5607235142118863) internal successors, (604), 444 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:56,007 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:56,008 INFO L93 Difference]: Finished difference Result 649 states and 872 transitions. [2022-02-20 23:48:56,008 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 872 transitions. [2022-02-20 23:48:56,008 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:56,008 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:56,009 INFO L74 IsIncluded]: Start isIncluded. First operand has 459 states, 387 states have (on average 1.5607235142118863) internal successors, (604), 444 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 649 states. [2022-02-20 23:48:56,010 INFO L87 Difference]: Start difference. First operand has 459 states, 387 states have (on average 1.5607235142118863) internal successors, (604), 444 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 649 states. [2022-02-20 23:48:56,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:56,035 INFO L93 Difference]: Finished difference Result 649 states and 872 transitions. [2022-02-20 23:48:56,035 INFO L276 IsEmpty]: Start isEmpty. Operand 649 states and 872 transitions. [2022-02-20 23:48:56,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:56,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:56,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:56,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:56,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 387 states have (on average 1.5607235142118863) internal successors, (604), 444 states have internal predecessors, (604), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:56,044 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 624 transitions. [2022-02-20 23:48:56,045 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 624 transitions. Word has length 26 [2022-02-20 23:48:56,045 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:56,045 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 624 transitions. [2022-02-20 23:48:56,045 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.4285714285714284) internal successors, (24), 7 states have internal predecessors, (24), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,045 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 624 transitions. [2022-02-20 23:48:56,046 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2022-02-20 23:48:56,046 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:56,046 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:48:56,046 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:48:56,046 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:56,046 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:56,047 INFO L85 PathProgramCache]: Analyzing trace with hash -808600231, now seen corresponding path program 1 times [2022-02-20 23:48:56,047 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:56,047 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [359353463] [2022-02-20 23:48:56,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:56,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:56,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:56,119 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:56,120 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:56,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {41606#true} #res := ~unnamed1~0~LIST_BEG; {41606#true} is VALID [2022-02-20 23:48:56,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {41606#true} assume true; {41606#true} is VALID [2022-02-20 23:48:56,127 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {41606#true} {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #335#return; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,128 INFO L290 TraceCheckUtils]: 0: Hoare triple {41606#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,128 INFO L290 TraceCheckUtils]: 1: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,128 INFO L290 TraceCheckUtils]: 2: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short29#1 := main_~i~0#1 < 3; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,129 INFO L290 TraceCheckUtils]: 3: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,129 INFO L290 TraceCheckUtils]: 4: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,129 INFO L290 TraceCheckUtils]: 5: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short31#1 := main_~y~1#1 < 4; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} main_#t~short36#1 := main_~z~0#1 < 7; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,131 INFO L290 TraceCheckUtils]: 9: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,131 INFO L290 TraceCheckUtils]: 10: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,131 INFO L272 TraceCheckUtils]: 11: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret37#1 := rand_end_point(); {41606#true} is VALID [2022-02-20 23:48:56,132 INFO L290 TraceCheckUtils]: 12: Hoare triple {41606#true} #res := ~unnamed1~0~LIST_BEG; {41606#true} is VALID [2022-02-20 23:48:56,132 INFO L290 TraceCheckUtils]: 13: Hoare triple {41606#true} assume true; {41606#true} is VALID [2022-02-20 23:48:56,132 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {41606#true} {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #335#return; {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:48:56,133 INFO L290 TraceCheckUtils]: 15: Hoare triple {41608#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,133 INFO L290 TraceCheckUtils]: 16: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,134 INFO L290 TraceCheckUtils]: 17: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,134 INFO L290 TraceCheckUtils]: 18: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,134 INFO L290 TraceCheckUtils]: 19: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,135 INFO L290 TraceCheckUtils]: 20: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,135 INFO L290 TraceCheckUtils]: 21: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,136 INFO L290 TraceCheckUtils]: 22: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,136 INFO L290 TraceCheckUtils]: 23: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,136 INFO L290 TraceCheckUtils]: 24: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,137 INFO L290 TraceCheckUtils]: 25: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,137 INFO L290 TraceCheckUtils]: 26: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:56,138 INFO L290 TraceCheckUtils]: 27: Hoare triple {41612#(and (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {41613#(= |ULTIMATE.start_remove_one_#t~mem22#1.offset| 0)} is VALID [2022-02-20 23:48:56,138 INFO L290 TraceCheckUtils]: 28: Hoare triple {41613#(= |ULTIMATE.start_remove_one_#t~mem22#1.offset| 0)} assume !(0 == remove_one_#t~mem22#1.offset); {41607#false} is VALID [2022-02-20 23:48:56,138 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:48:56,139 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:56,139 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [359353463] [2022-02-20 23:48:56,139 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [359353463] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:56,139 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:56,139 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:56,140 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068233001] [2022-02-20 23:48:56,140 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:56,142 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-20 23:48:56,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:56,142 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,160 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:48:56,160 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:56,160 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:56,162 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:56,162 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:56,162 INFO L87 Difference]: Start difference. First operand 459 states and 624 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 5 states have internal predecessors, (27), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:56,678 INFO L93 Difference]: Finished difference Result 530 states and 691 transitions. [2022-02-20 23:48:56,678 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:48:56,678 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 29 [2022-02-20 23:48:56,678 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:56,678 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2022-02-20 23:48:56,680 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,681 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 314 transitions. [2022-02-20 23:48:56,681 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 314 transitions. [2022-02-20 23:48:56,858 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 314 edges. 314 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:56,867 INFO L225 Difference]: With dead ends: 530 [2022-02-20 23:48:56,867 INFO L226 Difference]: Without dead ends: 530 [2022-02-20 23:48:56,868 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 3 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:48:56,868 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 168 mSDsluCounter, 481 mSDsCounter, 0 mSdLazyCounter, 146 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 168 SdHoareTripleChecker+Valid, 676 SdHoareTripleChecker+Invalid, 153 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 146 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:56,868 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [168 Valid, 676 Invalid, 153 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 146 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:56,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 530 states. [2022-02-20 23:48:56,888 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 530 to 459. [2022-02-20 23:48:56,888 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:56,889 INFO L82 GeneralOperation]: Start isEquivalent. First operand 530 states. Second operand has 459 states, 387 states have (on average 1.558139534883721) internal successors, (603), 444 states have internal predecessors, (603), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:56,889 INFO L74 IsIncluded]: Start isIncluded. First operand 530 states. Second operand has 459 states, 387 states have (on average 1.558139534883721) internal successors, (603), 444 states have internal predecessors, (603), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:56,892 INFO L87 Difference]: Start difference. First operand 530 states. Second operand has 459 states, 387 states have (on average 1.558139534883721) internal successors, (603), 444 states have internal predecessors, (603), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:56,903 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:56,903 INFO L93 Difference]: Finished difference Result 530 states and 691 transitions. [2022-02-20 23:48:56,903 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 691 transitions. [2022-02-20 23:48:56,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:56,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:56,904 INFO L74 IsIncluded]: Start isIncluded. First operand has 459 states, 387 states have (on average 1.558139534883721) internal successors, (603), 444 states have internal predecessors, (603), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 530 states. [2022-02-20 23:48:56,904 INFO L87 Difference]: Start difference. First operand has 459 states, 387 states have (on average 1.558139534883721) internal successors, (603), 444 states have internal predecessors, (603), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) Second operand 530 states. [2022-02-20 23:48:56,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:56,915 INFO L93 Difference]: Finished difference Result 530 states and 691 transitions. [2022-02-20 23:48:56,915 INFO L276 IsEmpty]: Start isEmpty. Operand 530 states and 691 transitions. [2022-02-20 23:48:56,917 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:56,917 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:56,917 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:56,917 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:56,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 387 states have (on average 1.558139534883721) internal successors, (603), 444 states have internal predecessors, (603), 10 states have call successors, (10), 5 states have call predecessors, (10), 5 states have return successors, (10), 9 states have call predecessors, (10), 10 states have call successors, (10) [2022-02-20 23:48:56,925 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 623 transitions. [2022-02-20 23:48:56,925 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 623 transitions. Word has length 29 [2022-02-20 23:48:56,925 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:56,925 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 623 transitions. [2022-02-20 23:48:56,926 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), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:56,926 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 623 transitions. [2022-02-20 23:48:56,926 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:48:56,927 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:56,927 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:48:56,927 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:48:56,927 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:56,927 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:56,927 INFO L85 PathProgramCache]: Analyzing trace with hash 703196873, now seen corresponding path program 1 times [2022-02-20 23:48:56,927 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:56,927 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [600756551] [2022-02-20 23:48:56,927 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:56,928 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:56,948 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:57,032 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:57,034 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:57,036 INFO L290 TraceCheckUtils]: 0: Hoare triple {43669#true} #res := ~unnamed1~0~LIST_BEG; {43669#true} is VALID [2022-02-20 23:48:57,036 INFO L290 TraceCheckUtils]: 1: Hoare triple {43669#true} assume true; {43669#true} is VALID [2022-02-20 23:48:57,037 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {43669#true} {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #335#return; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,038 INFO L290 TraceCheckUtils]: 0: Hoare triple {43669#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,038 INFO L290 TraceCheckUtils]: 1: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,039 INFO L290 TraceCheckUtils]: 2: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,039 INFO L290 TraceCheckUtils]: 3: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,040 INFO L290 TraceCheckUtils]: 4: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,040 INFO L290 TraceCheckUtils]: 5: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} main_#t~short31#1 := main_~y~1#1 < 4; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,041 INFO L290 TraceCheckUtils]: 6: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,041 INFO L290 TraceCheckUtils]: 7: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,041 INFO L290 TraceCheckUtils]: 8: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} main_#t~short36#1 := main_~z~0#1 < 7; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,042 INFO L290 TraceCheckUtils]: 9: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,042 INFO L290 TraceCheckUtils]: 10: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,042 INFO L272 TraceCheckUtils]: 11: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} call main_#t~ret37#1 := rand_end_point(); {43669#true} is VALID [2022-02-20 23:48:57,042 INFO L290 TraceCheckUtils]: 12: Hoare triple {43669#true} #res := ~unnamed1~0~LIST_BEG; {43669#true} is VALID [2022-02-20 23:48:57,042 INFO L290 TraceCheckUtils]: 13: Hoare triple {43669#true} assume true; {43669#true} is VALID [2022-02-20 23:48:57,043 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {43669#true} {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #335#return; {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} is VALID [2022-02-20 23:48:57,043 INFO L290 TraceCheckUtils]: 15: Hoare triple {43671#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,044 INFO L290 TraceCheckUtils]: 16: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,044 INFO L290 TraceCheckUtils]: 17: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,045 INFO L290 TraceCheckUtils]: 18: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,045 INFO L290 TraceCheckUtils]: 19: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,046 INFO L290 TraceCheckUtils]: 20: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,046 INFO L290 TraceCheckUtils]: 21: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,046 INFO L290 TraceCheckUtils]: 22: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,047 INFO L290 TraceCheckUtils]: 23: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,047 INFO L290 TraceCheckUtils]: 24: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,048 INFO L290 TraceCheckUtils]: 25: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,048 INFO L290 TraceCheckUtils]: 26: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:57,049 INFO L290 TraceCheckUtils]: 27: Hoare triple {43675#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {43676#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 0))} is VALID [2022-02-20 23:48:57,049 INFO L290 TraceCheckUtils]: 28: Hoare triple {43676#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 0))} assume 0 == remove_one_#t~mem22#1.offset; {43676#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 0))} is VALID [2022-02-20 23:48:57,049 INFO L290 TraceCheckUtils]: 29: Hoare triple {43676#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 0))} assume !(remove_one_#t~mem22#1.base < #StackHeapBarrier); {43670#false} is VALID [2022-02-20 23:48:57,050 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:48:57,050 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:57,051 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [600756551] [2022-02-20 23:48:57,051 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [600756551] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:57,051 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:57,051 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:48:57,051 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1215895756] [2022-02-20 23:48:57,051 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:57,051 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:48:57,051 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:57,052 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,078 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 30 edges. 30 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:57,079 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:48:57,079 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:57,079 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:48:57,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:48:57,079 INFO L87 Difference]: Start difference. First operand 459 states and 623 transitions. Second operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:57,744 INFO L93 Difference]: Finished difference Result 595 states and 780 transitions. [2022-02-20 23:48:57,744 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:48:57,744 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 30 [2022-02-20 23:48:57,744 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:57,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 333 transitions. [2022-02-20 23:48:57,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:57,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 333 transitions. [2022-02-20 23:48:57,748 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 333 transitions. [2022-02-20 23:48:57,988 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:58,001 INFO L225 Difference]: With dead ends: 595 [2022-02-20 23:48:58,001 INFO L226 Difference]: Without dead ends: 595 [2022-02-20 23:48:58,002 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 2 SyntacticMatches, 1 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:48:58,002 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 199 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 199 SdHoareTripleChecker+Valid, 667 SdHoareTripleChecker+Invalid, 194 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:58,002 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [199 Valid, 667 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:48:58,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2022-02-20 23:48:58,007 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 500. [2022-02-20 23:48:58,007 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:58,008 INFO L82 GeneralOperation]: Start isEquivalent. First operand 595 states. Second operand has 500 states, 425 states have (on average 1.5482352941176472) internal successors, (658), 483 states have internal predecessors, (658), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:58,008 INFO L74 IsIncluded]: Start isIncluded. First operand 595 states. Second operand has 500 states, 425 states have (on average 1.5482352941176472) internal successors, (658), 483 states have internal predecessors, (658), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:58,009 INFO L87 Difference]: Start difference. First operand 595 states. Second operand has 500 states, 425 states have (on average 1.5482352941176472) internal successors, (658), 483 states have internal predecessors, (658), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:58,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:58,020 INFO L93 Difference]: Finished difference Result 595 states and 780 transitions. [2022-02-20 23:48:58,020 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 780 transitions. [2022-02-20 23:48:58,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:58,021 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:58,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 500 states, 425 states have (on average 1.5482352941176472) internal successors, (658), 483 states have internal predecessors, (658), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 595 states. [2022-02-20 23:48:58,022 INFO L87 Difference]: Start difference. First operand has 500 states, 425 states have (on average 1.5482352941176472) internal successors, (658), 483 states have internal predecessors, (658), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 595 states. [2022-02-20 23:48:58,034 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:58,035 INFO L93 Difference]: Finished difference Result 595 states and 780 transitions. [2022-02-20 23:48:58,035 INFO L276 IsEmpty]: Start isEmpty. Operand 595 states and 780 transitions. [2022-02-20 23:48:58,035 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:58,035 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:58,036 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:58,036 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:58,036 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 500 states, 425 states have (on average 1.5482352941176472) internal successors, (658), 483 states have internal predecessors, (658), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:58,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 500 states to 500 states and 682 transitions. [2022-02-20 23:48:58,046 INFO L78 Accepts]: Start accepts. Automaton has 500 states and 682 transitions. Word has length 30 [2022-02-20 23:48:58,046 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:58,046 INFO L470 AbstractCegarLoop]: Abstraction has 500 states and 682 transitions. [2022-02-20 23:48:58,046 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.0) internal successors, (28), 5 states have internal predecessors, (28), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,047 INFO L276 IsEmpty]: Start isEmpty. Operand 500 states and 682 transitions. [2022-02-20 23:48:58,047 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:58,047 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:58,047 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] [2022-02-20 23:48:58,047 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:48:58,047 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:58,048 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:58,048 INFO L85 PathProgramCache]: Analyzing trace with hash 2144668882, now seen corresponding path program 1 times [2022-02-20 23:48:58,048 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:58,048 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [168600522] [2022-02-20 23:48:58,048 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:58,048 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:58,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:58,122 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:58,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:58,136 INFO L290 TraceCheckUtils]: 0: Hoare triple {45968#true} #res := ~unnamed1~0~LIST_BEG; {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,137 INFO L290 TraceCheckUtils]: 1: Hoare triple {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,137 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {45968#true} #335#return; {45973#(and (<= |ULTIMATE.start_main_#t~ret37#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret37#1|))} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 0: Hoare triple {45968#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 1: Hoare triple {45968#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 2: Hoare triple {45968#true} main_#t~short29#1 := main_~i~0#1 < 3; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 3: Hoare triple {45968#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 4: Hoare triple {45968#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 5: Hoare triple {45968#true} main_#t~short31#1 := main_~y~1#1 < 4; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 6: Hoare triple {45968#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 7: Hoare triple {45968#true} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {45968#true} is VALID [2022-02-20 23:48:58,138 INFO L290 TraceCheckUtils]: 8: Hoare triple {45968#true} main_#t~short36#1 := main_~z~0#1 < 7; {45968#true} is VALID [2022-02-20 23:48:58,139 INFO L290 TraceCheckUtils]: 9: Hoare triple {45968#true} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {45968#true} is VALID [2022-02-20 23:48:58,139 INFO L290 TraceCheckUtils]: 10: Hoare triple {45968#true} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {45968#true} is VALID [2022-02-20 23:48:58,139 INFO L272 TraceCheckUtils]: 11: Hoare triple {45968#true} call main_#t~ret37#1 := rand_end_point(); {45968#true} is VALID [2022-02-20 23:48:58,139 INFO L290 TraceCheckUtils]: 12: Hoare triple {45968#true} #res := ~unnamed1~0~LIST_BEG; {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,139 INFO L290 TraceCheckUtils]: 13: Hoare triple {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,140 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {45977#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {45968#true} #335#return; {45973#(and (<= |ULTIMATE.start_main_#t~ret37#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret37#1|))} is VALID [2022-02-20 23:48:58,141 INFO L290 TraceCheckUtils]: 15: Hoare triple {45973#(and (<= |ULTIMATE.start_main_#t~ret37#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret37#1|))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,141 INFO L290 TraceCheckUtils]: 16: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,141 INFO L290 TraceCheckUtils]: 17: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,142 INFO L290 TraceCheckUtils]: 18: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,142 INFO L290 TraceCheckUtils]: 19: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,143 INFO L290 TraceCheckUtils]: 20: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,143 INFO L290 TraceCheckUtils]: 21: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,144 INFO L290 TraceCheckUtils]: 22: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,144 INFO L290 TraceCheckUtils]: 23: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:48:58,145 INFO L290 TraceCheckUtils]: 24: Hoare triple {45974#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {45975#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:48:58,145 INFO L290 TraceCheckUtils]: 25: Hoare triple {45975#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,146 INFO L290 TraceCheckUtils]: 26: Hoare triple {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset);havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,146 INFO L290 TraceCheckUtils]: 27: Hoare triple {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite24#1 := ~unnamed2~0~ITEM_NEXT; {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,147 INFO L290 TraceCheckUtils]: 28: Hoare triple {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~next_field~0#1 := remove_one_#t~ite24#1;havoc remove_one_#t~ite24#1; {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,147 INFO L290 TraceCheckUtils]: 29: Hoare triple {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_PREV; {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,148 INFO L290 TraceCheckUtils]: 30: Hoare triple {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~term_field~1#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:48:58,148 INFO L290 TraceCheckUtils]: 31: Hoare triple {45976#(and (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4))) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4) (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (* ~unnamed1~0~LIST_BEG 4))))} assume !(4 + (remove_one_~list#1.offset + 4 * remove_one_~from#1) <= #length[remove_one_~list#1.base] && 0 <= remove_one_~list#1.offset + 4 * remove_one_~from#1); {45969#false} is VALID [2022-02-20 23:48:58,148 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:48:58,148 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:58,149 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [168600522] [2022-02-20 23:48:58,149 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [168600522] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:58,149 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:58,149 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:48:58,149 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1749341380] [2022-02-20 23:48:58,149 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:58,149 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:58,150 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:58,150 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:58,173 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:58,173 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:48:58,173 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:58,174 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:48:58,174 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:48:58,174 INFO L87 Difference]: Start difference. First operand 500 states and 682 transitions. Second operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:59,310 INFO L93 Difference]: Finished difference Result 855 states and 1109 transitions. [2022-02-20 23:48:59,310 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:48:59,310 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:59,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:48:59,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,312 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 439 transitions. [2022-02-20 23:48:59,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 439 transitions. [2022-02-20 23:48:59,315 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 439 transitions. [2022-02-20 23:48:59,628 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 439 edges. 439 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:59,650 INFO L225 Difference]: With dead ends: 855 [2022-02-20 23:48:59,651 INFO L226 Difference]: Without dead ends: 855 [2022-02-20 23:48:59,651 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=42, Invalid=90, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:48:59,651 INFO L933 BasicCegarLoop]: 337 mSDtfsCounter, 514 mSDsluCounter, 1188 mSDsCounter, 0 mSdLazyCounter, 165 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 516 SdHoareTripleChecker+Valid, 1525 SdHoareTripleChecker+Invalid, 180 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 165 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:48:59,652 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [516 Valid, 1525 Invalid, 180 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 165 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:48:59,652 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-02-20 23:48:59,658 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 497. [2022-02-20 23:48:59,658 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:48:59,658 INFO L82 GeneralOperation]: Start isEquivalent. First operand 855 states. Second operand has 497 states, 425 states have (on average 1.5058823529411764) internal successors, (640), 480 states have internal predecessors, (640), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:59,659 INFO L74 IsIncluded]: Start isIncluded. First operand 855 states. Second operand has 497 states, 425 states have (on average 1.5058823529411764) internal successors, (640), 480 states have internal predecessors, (640), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:59,659 INFO L87 Difference]: Start difference. First operand 855 states. Second operand has 497 states, 425 states have (on average 1.5058823529411764) internal successors, (640), 480 states have internal predecessors, (640), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:59,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:59,684 INFO L93 Difference]: Finished difference Result 855 states and 1109 transitions. [2022-02-20 23:48:59,684 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1109 transitions. [2022-02-20 23:48:59,685 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:59,685 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:59,686 INFO L74 IsIncluded]: Start isIncluded. First operand has 497 states, 425 states have (on average 1.5058823529411764) internal successors, (640), 480 states have internal predecessors, (640), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 855 states. [2022-02-20 23:48:59,686 INFO L87 Difference]: Start difference. First operand has 497 states, 425 states have (on average 1.5058823529411764) internal successors, (640), 480 states have internal predecessors, (640), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) Second operand 855 states. [2022-02-20 23:48:59,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:48:59,710 INFO L93 Difference]: Finished difference Result 855 states and 1109 transitions. [2022-02-20 23:48:59,710 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1109 transitions. [2022-02-20 23:48:59,711 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:48:59,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:48:59,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:48:59,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:48:59,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 497 states, 425 states have (on average 1.5058823529411764) internal successors, (640), 480 states have internal predecessors, (640), 12 states have call successors, (12), 6 states have call predecessors, (12), 6 states have return successors, (12), 10 states have call predecessors, (12), 12 states have call successors, (12) [2022-02-20 23:48:59,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 497 states to 497 states and 664 transitions. [2022-02-20 23:48:59,722 INFO L78 Accepts]: Start accepts. Automaton has 497 states and 664 transitions. Word has length 32 [2022-02-20 23:48:59,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:48:59,722 INFO L470 AbstractCegarLoop]: Abstraction has 497 states and 664 transitions. [2022-02-20 23:48:59,722 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,722 INFO L276 IsEmpty]: Start isEmpty. Operand 497 states and 664 transitions. [2022-02-20 23:48:59,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:48:59,722 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:48:59,722 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] [2022-02-20 23:48:59,723 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:48:59,723 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:48:59,723 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:48:59,723 INFO L85 PathProgramCache]: Analyzing trace with hash 1462337803, now seen corresponding path program 1 times [2022-02-20 23:48:59,723 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:48:59,723 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [708096456] [2022-02-20 23:48:59,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:48:59,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:48:59,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:59,815 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:48:59,817 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:48:59,818 INFO L290 TraceCheckUtils]: 0: Hoare triple {49054#true} #res := ~unnamed1~0~LIST_BEG; {49054#true} is VALID [2022-02-20 23:48:59,819 INFO L290 TraceCheckUtils]: 1: Hoare triple {49054#true} assume true; {49054#true} is VALID [2022-02-20 23:48:59,819 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {49054#true} {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #335#return; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {49054#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,820 INFO L290 TraceCheckUtils]: 1: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,821 INFO L290 TraceCheckUtils]: 2: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short29#1 := main_~i~0#1 < 3; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,821 INFO L290 TraceCheckUtils]: 3: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,822 INFO L290 TraceCheckUtils]: 4: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,822 INFO L290 TraceCheckUtils]: 5: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short31#1 := main_~y~1#1 < 4; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,823 INFO L290 TraceCheckUtils]: 6: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,823 INFO L290 TraceCheckUtils]: 7: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,824 INFO L290 TraceCheckUtils]: 8: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} main_#t~short36#1 := main_~z~0#1 < 7; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,824 INFO L290 TraceCheckUtils]: 9: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,824 INFO L290 TraceCheckUtils]: 10: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,825 INFO L272 TraceCheckUtils]: 11: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret37#1 := rand_end_point(); {49054#true} is VALID [2022-02-20 23:48:59,825 INFO L290 TraceCheckUtils]: 12: Hoare triple {49054#true} #res := ~unnamed1~0~LIST_BEG; {49054#true} is VALID [2022-02-20 23:48:59,825 INFO L290 TraceCheckUtils]: 13: Hoare triple {49054#true} assume true; {49054#true} is VALID [2022-02-20 23:48:59,825 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {49054#true} {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #335#return; {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:48:59,826 INFO L290 TraceCheckUtils]: 15: Hoare triple {49056#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,826 INFO L290 TraceCheckUtils]: 16: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,827 INFO L290 TraceCheckUtils]: 17: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,827 INFO L290 TraceCheckUtils]: 18: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,829 INFO L290 TraceCheckUtils]: 21: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,829 INFO L290 TraceCheckUtils]: 22: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,830 INFO L290 TraceCheckUtils]: 23: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,830 INFO L290 TraceCheckUtils]: 24: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,831 INFO L290 TraceCheckUtils]: 25: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,831 INFO L290 TraceCheckUtils]: 26: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} is VALID [2022-02-20 23:48:59,832 INFO L290 TraceCheckUtils]: 27: Hoare triple {49060#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) 0))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {49061#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 3)))} is VALID [2022-02-20 23:48:59,832 INFO L290 TraceCheckUtils]: 28: Hoare triple {49061#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 3)))} assume 0 == remove_one_#t~mem22#1.offset; {49061#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 3)))} is VALID [2022-02-20 23:48:59,833 INFO L290 TraceCheckUtils]: 29: Hoare triple {49061#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 3)))} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {49061#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 3)))} is VALID [2022-02-20 23:48:59,833 INFO L290 TraceCheckUtils]: 30: Hoare triple {49061#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= |ULTIMATE.start_remove_one_#t~mem22#1.base| 3)))} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {49062#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:48:59,833 INFO L290 TraceCheckUtils]: 31: Hoare triple {49062#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {49055#false} is VALID [2022-02-20 23:48:59,834 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:48:59,834 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:48:59,834 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [708096456] [2022-02-20 23:48:59,834 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [708096456] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:48:59,834 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:48:59,834 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:48:59,834 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1786504780] [2022-02-20 23:48:59,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:48:59,835 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:48:59,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:48:59,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:48:59,860 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 32 edges. 32 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:48:59,860 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:48:59,860 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:48:59,861 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:48:59,861 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:48:59,861 INFO L87 Difference]: Start difference. First operand 497 states and 664 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,271 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:01,272 INFO L93 Difference]: Finished difference Result 877 states and 1128 transitions. [2022-02-20 23:49:01,272 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:49:01,272 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 32 [2022-02-20 23:49:01,272 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:01,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 553 transitions. [2022-02-20 23:49:01,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,277 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 553 transitions. [2022-02-20 23:49:01,277 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 553 transitions. [2022-02-20 23:49:01,666 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 553 edges. 553 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:01,691 INFO L225 Difference]: With dead ends: 877 [2022-02-20 23:49:01,692 INFO L226 Difference]: Without dead ends: 877 [2022-02-20 23:49:01,692 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=34, Invalid=56, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:01,692 INFO L933 BasicCegarLoop]: 281 mSDtfsCounter, 428 mSDsluCounter, 795 mSDsCounter, 0 mSdLazyCounter, 567 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 430 SdHoareTripleChecker+Valid, 1076 SdHoareTripleChecker+Invalid, 595 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 567 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:01,693 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [430 Valid, 1076 Invalid, 595 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 567 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:49:01,693 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 877 states. [2022-02-20 23:49:01,699 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 877 to 534. [2022-02-20 23:49:01,699 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:01,700 INFO L82 GeneralOperation]: Start isEquivalent. First operand 877 states. Second operand has 534 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 515 states have internal predecessors, (683), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:01,700 INFO L74 IsIncluded]: Start isIncluded. First operand 877 states. Second operand has 534 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 515 states have internal predecessors, (683), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:01,701 INFO L87 Difference]: Start difference. First operand 877 states. Second operand has 534 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 515 states have internal predecessors, (683), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:01,728 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:01,728 INFO L93 Difference]: Finished difference Result 877 states and 1128 transitions. [2022-02-20 23:49:01,728 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1128 transitions. [2022-02-20 23:49:01,729 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:01,729 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:01,730 INFO L74 IsIncluded]: Start isIncluded. First operand has 534 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 515 states have internal predecessors, (683), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 877 states. [2022-02-20 23:49:01,730 INFO L87 Difference]: Start difference. First operand has 534 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 515 states have internal predecessors, (683), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 877 states. [2022-02-20 23:49:01,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:01,757 INFO L93 Difference]: Finished difference Result 877 states and 1128 transitions. [2022-02-20 23:49:01,757 INFO L276 IsEmpty]: Start isEmpty. Operand 877 states and 1128 transitions. [2022-02-20 23:49:01,758 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:01,758 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:01,758 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:01,758 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:01,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 459 states have (on average 1.4880174291938997) internal successors, (683), 515 states have internal predecessors, (683), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:01,769 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 711 transitions. [2022-02-20 23:49:01,770 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 711 transitions. Word has length 32 [2022-02-20 23:49:01,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:01,770 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 711 transitions. [2022-02-20 23:49:01,770 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,770 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 711 transitions. [2022-02-20 23:49:01,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:49:01,770 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:01,771 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:49:01,771 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:49:01,771 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:01,771 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:01,771 INFO L85 PathProgramCache]: Analyzing trace with hash -1912168099, now seen corresponding path program 1 times [2022-02-20 23:49:01,771 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:01,771 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2102108241] [2022-02-20 23:49:01,772 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:01,772 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:01,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:01,908 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:01,910 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:01,912 INFO L290 TraceCheckUtils]: 0: Hoare triple {52238#true} #res := ~unnamed1~0~LIST_BEG; {52238#true} is VALID [2022-02-20 23:49:01,912 INFO L290 TraceCheckUtils]: 1: Hoare triple {52238#true} assume true; {52238#true} is VALID [2022-02-20 23:49:01,912 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {52238#true} {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #335#return; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,913 INFO L290 TraceCheckUtils]: 0: Hoare triple {52238#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,914 INFO L290 TraceCheckUtils]: 1: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,914 INFO L290 TraceCheckUtils]: 2: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short29#1 := main_~i~0#1 < 3; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,914 INFO L290 TraceCheckUtils]: 3: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,915 INFO L290 TraceCheckUtils]: 4: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,915 INFO L290 TraceCheckUtils]: 5: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short31#1 := main_~y~1#1 < 4; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,916 INFO L290 TraceCheckUtils]: 6: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,916 INFO L290 TraceCheckUtils]: 7: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,916 INFO L290 TraceCheckUtils]: 8: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} main_#t~short36#1 := main_~z~0#1 < 7; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,917 INFO L290 TraceCheckUtils]: 9: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,917 INFO L290 TraceCheckUtils]: 10: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,917 INFO L272 TraceCheckUtils]: 11: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret37#1 := rand_end_point(); {52238#true} is VALID [2022-02-20 23:49:01,917 INFO L290 TraceCheckUtils]: 12: Hoare triple {52238#true} #res := ~unnamed1~0~LIST_BEG; {52238#true} is VALID [2022-02-20 23:49:01,918 INFO L290 TraceCheckUtils]: 13: Hoare triple {52238#true} assume true; {52238#true} is VALID [2022-02-20 23:49:01,918 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {52238#true} {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #335#return; {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:49:01,919 INFO L290 TraceCheckUtils]: 15: Hoare triple {52240#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {52244#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:01,919 INFO L290 TraceCheckUtils]: 16: Hoare triple {52244#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {52245#(and (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:01,920 INFO L290 TraceCheckUtils]: 17: Hoare triple {52245#(and (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {52245#(and (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:01,920 INFO L290 TraceCheckUtils]: 18: Hoare triple {52245#(and (<= 0 (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= |ULTIMATE.start_remove_one_~list#1.offset| |ULTIMATE.start_is_empty_~list#1.offset|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,921 INFO L290 TraceCheckUtils]: 19: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,921 INFO L290 TraceCheckUtils]: 20: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,922 INFO L290 TraceCheckUtils]: 21: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is_empty_#res#1 := is_empty_~no_beg~0#1; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,922 INFO L290 TraceCheckUtils]: 22: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,922 INFO L290 TraceCheckUtils]: 23: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,923 INFO L290 TraceCheckUtils]: 24: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,924 INFO L290 TraceCheckUtils]: 25: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,924 INFO L290 TraceCheckUtils]: 26: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,925 INFO L290 TraceCheckUtils]: 27: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,925 INFO L290 TraceCheckUtils]: 28: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume 0 == remove_one_#t~mem22#1.offset; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,925 INFO L290 TraceCheckUtils]: 29: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:49:01,926 INFO L290 TraceCheckUtils]: 30: Hoare triple {52246#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#length| 3) 8) (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (<= 0 (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))))} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {52247#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 8) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} is VALID [2022-02-20 23:49:01,926 INFO L290 TraceCheckUtils]: 31: Hoare triple {52247#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 8) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {52247#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 8) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} is VALID [2022-02-20 23:49:01,927 INFO L290 TraceCheckUtils]: 32: Hoare triple {52247#(and (<= 0 (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (<= (+ |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.offset| (* ~unnamed1~0~LIST_END 4)) 4) (= |ULTIMATE.start_#Ultimate.C_memset_#amount#1| 8) (= (select |#length| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 8))} assume !(#Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset); {52239#false} is VALID [2022-02-20 23:49:01,927 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:49:01,927 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:01,927 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2102108241] [2022-02-20 23:49:01,928 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2102108241] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:01,928 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:01,928 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:49:01,928 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [444861143] [2022-02-20 23:49:01,928 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:01,928 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:01,928 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:01,929 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:01,955 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 33 edges. 33 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:01,955 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:01,956 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:01,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:01,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:49:01,957 INFO L87 Difference]: Start difference. First operand 534 states and 711 transitions. Second operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:03,147 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:03,148 INFO L93 Difference]: Finished difference Result 667 states and 839 transitions. [2022-02-20 23:49:03,148 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:49:03,148 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 33 [2022-02-20 23:49:03,149 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:03,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 377 transitions. [2022-02-20 23:49:03,151 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:03,152 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 377 transitions. [2022-02-20 23:49:03,152 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 377 transitions. [2022-02-20 23:49:03,387 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 377 edges. 377 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:03,400 INFO L225 Difference]: With dead ends: 667 [2022-02-20 23:49:03,400 INFO L226 Difference]: Without dead ends: 667 [2022-02-20 23:49:03,401 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=57, Invalid=99, Unknown=0, NotChecked=0, Total=156 [2022-02-20 23:49:03,401 INFO L933 BasicCegarLoop]: 216 mSDtfsCounter, 388 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 413 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 388 SdHoareTripleChecker+Valid, 809 SdHoareTripleChecker+Invalid, 424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 413 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:03,401 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [388 Valid, 809 Invalid, 424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 413 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:49:03,402 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 667 states. [2022-02-20 23:49:03,407 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 667 to 534. [2022-02-20 23:49:03,407 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:03,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 667 states. Second operand has 534 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 515 states have internal predecessors, (679), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:03,408 INFO L74 IsIncluded]: Start isIncluded. First operand 667 states. Second operand has 534 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 515 states have internal predecessors, (679), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:03,408 INFO L87 Difference]: Start difference. First operand 667 states. Second operand has 534 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 515 states have internal predecessors, (679), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:03,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:03,423 INFO L93 Difference]: Finished difference Result 667 states and 839 transitions. [2022-02-20 23:49:03,423 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2022-02-20 23:49:03,424 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:03,424 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:03,425 INFO L74 IsIncluded]: Start isIncluded. First operand has 534 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 515 states have internal predecessors, (679), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 667 states. [2022-02-20 23:49:03,425 INFO L87 Difference]: Start difference. First operand has 534 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 515 states have internal predecessors, (679), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 667 states. [2022-02-20 23:49:03,440 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:03,440 INFO L93 Difference]: Finished difference Result 667 states and 839 transitions. [2022-02-20 23:49:03,440 INFO L276 IsEmpty]: Start isEmpty. Operand 667 states and 839 transitions. [2022-02-20 23:49:03,441 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:03,441 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:03,441 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:03,441 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:03,442 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 459 states have (on average 1.4793028322440087) internal successors, (679), 515 states have internal predecessors, (679), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:03,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 707 transitions. [2022-02-20 23:49:03,452 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 707 transitions. Word has length 33 [2022-02-20 23:49:03,452 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:03,453 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 707 transitions. [2022-02-20 23:49:03,453 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 5.166666666666667) internal successors, (31), 7 states have internal predecessors, (31), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:03,453 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 707 transitions. [2022-02-20 23:49:03,453 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:49:03,453 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:03,453 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, 1] [2022-02-20 23:49:03,453 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:49:03,454 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:03,454 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:03,454 INFO L85 PathProgramCache]: Analyzing trace with hash -557500014, now seen corresponding path program 1 times [2022-02-20 23:49:03,454 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:03,454 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [63469334] [2022-02-20 23:49:03,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:03,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:03,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:03,625 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:03,626 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:03,628 INFO L290 TraceCheckUtils]: 0: Hoare triple {54797#true} #res := ~unnamed1~0~LIST_BEG; {54797#true} is VALID [2022-02-20 23:49:03,628 INFO L290 TraceCheckUtils]: 1: Hoare triple {54797#true} assume true; {54797#true} is VALID [2022-02-20 23:49:03,628 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {54797#true} {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #335#return; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,629 INFO L290 TraceCheckUtils]: 0: Hoare triple {54797#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,630 INFO L290 TraceCheckUtils]: 1: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,630 INFO L290 TraceCheckUtils]: 2: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short29#1 := main_~i~0#1 < 3; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,631 INFO L290 TraceCheckUtils]: 3: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,631 INFO L290 TraceCheckUtils]: 4: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,631 INFO L290 TraceCheckUtils]: 5: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short31#1 := main_~y~1#1 < 4; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,632 INFO L290 TraceCheckUtils]: 6: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,632 INFO L290 TraceCheckUtils]: 7: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,633 INFO L290 TraceCheckUtils]: 8: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} main_#t~short36#1 := main_~z~0#1 < 7; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,633 INFO L290 TraceCheckUtils]: 9: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,634 INFO L290 TraceCheckUtils]: 10: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,634 INFO L272 TraceCheckUtils]: 11: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} call main_#t~ret37#1 := rand_end_point(); {54797#true} is VALID [2022-02-20 23:49:03,634 INFO L290 TraceCheckUtils]: 12: Hoare triple {54797#true} #res := ~unnamed1~0~LIST_BEG; {54797#true} is VALID [2022-02-20 23:49:03,634 INFO L290 TraceCheckUtils]: 13: Hoare triple {54797#true} assume true; {54797#true} is VALID [2022-02-20 23:49:03,635 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {54797#true} {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #335#return; {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:49:03,635 INFO L290 TraceCheckUtils]: 15: Hoare triple {54799#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,636 INFO L290 TraceCheckUtils]: 16: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,636 INFO L290 TraceCheckUtils]: 17: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,637 INFO L290 TraceCheckUtils]: 18: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,637 INFO L290 TraceCheckUtils]: 19: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,638 INFO L290 TraceCheckUtils]: 20: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,638 INFO L290 TraceCheckUtils]: 21: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is_empty_#res#1 := is_empty_~no_beg~0#1; {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,639 INFO L290 TraceCheckUtils]: 22: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,639 INFO L290 TraceCheckUtils]: 23: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,640 INFO L290 TraceCheckUtils]: 24: Hoare triple {54803#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_BEG 4))) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {54804#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4))) |ULTIMATE.start_remove_one_#t~mem20#1.offset|) (= |ULTIMATE.start_remove_one_#t~mem20#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:03,640 INFO L290 TraceCheckUtils]: 25: Hoare triple {54804#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4))) |ULTIMATE.start_remove_one_#t~mem20#1.offset|) (= |ULTIMATE.start_remove_one_#t~mem20#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_remove_one_~list#1.base|) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* ~unnamed1~0~LIST_END 4)))) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {54805#(and (= |ULTIMATE.start_remove_one_#t~mem20#1.base| |ULTIMATE.start_remove_one_#t~mem21#1.base|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= |ULTIMATE.start_remove_one_#t~mem21#1.offset| |ULTIMATE.start_remove_one_#t~mem20#1.offset|))} is VALID [2022-02-20 23:49:03,641 INFO L290 TraceCheckUtils]: 26: Hoare triple {54805#(and (= |ULTIMATE.start_remove_one_#t~mem20#1.base| |ULTIMATE.start_remove_one_#t~mem21#1.base|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0) (= |ULTIMATE.start_remove_one_#t~mem21#1.offset| |ULTIMATE.start_remove_one_#t~mem20#1.offset|))} assume !(remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset);havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {54798#false} is VALID [2022-02-20 23:49:03,641 INFO L290 TraceCheckUtils]: 27: Hoare triple {54798#false} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite24#1 := ~unnamed2~0~ITEM_NEXT; {54798#false} is VALID [2022-02-20 23:49:03,641 INFO L290 TraceCheckUtils]: 28: Hoare triple {54798#false} remove_one_~next_field~0#1 := remove_one_#t~ite24#1;havoc remove_one_#t~ite24#1; {54798#false} is VALID [2022-02-20 23:49:03,641 INFO L290 TraceCheckUtils]: 29: Hoare triple {54798#false} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_PREV; {54798#false} is VALID [2022-02-20 23:49:03,641 INFO L290 TraceCheckUtils]: 30: Hoare triple {54798#false} remove_one_~term_field~1#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {54798#false} is VALID [2022-02-20 23:49:03,641 INFO L290 TraceCheckUtils]: 31: Hoare triple {54798#false} SUMMARY for call remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4); srcloc: L720 {54798#false} is VALID [2022-02-20 23:49:03,642 INFO L290 TraceCheckUtils]: 32: Hoare triple {54798#false} remove_one_~item~2#1.base, remove_one_~item~2#1.offset := remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset;havoc remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset; {54798#false} is VALID [2022-02-20 23:49:03,642 INFO L290 TraceCheckUtils]: 33: Hoare triple {54798#false} assume !(1 == #valid[remove_one_~item~2#1.base]); {54798#false} is VALID [2022-02-20 23:49:03,642 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:49:03,642 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:03,642 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [63469334] [2022-02-20 23:49:03,642 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [63469334] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:03,643 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:03,643 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:49:03,643 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1301435726] [2022-02-20 23:49:03,643 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:03,643 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:03,644 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:03,644 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:03,669 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:03,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:03,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:03,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:03,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:03,671 INFO L87 Difference]: Start difference. First operand 534 states and 707 transitions. Second operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,446 INFO L93 Difference]: Finished difference Result 579 states and 753 transitions. [2022-02-20 23:49:04,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:04,446 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:04,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:04,446 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,448 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 280 transitions. [2022-02-20 23:49:04,448 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 280 transitions. [2022-02-20 23:49:04,449 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 280 transitions. [2022-02-20 23:49:04,639 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 280 edges. 280 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:04,650 INFO L225 Difference]: With dead ends: 579 [2022-02-20 23:49:04,650 INFO L226 Difference]: Without dead ends: 579 [2022-02-20 23:49:04,650 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:04,652 INFO L933 BasicCegarLoop]: 202 mSDtfsCounter, 111 mSDsluCounter, 649 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 851 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:04,653 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [111 Valid, 851 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:04,653 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 579 states. [2022-02-20 23:49:04,671 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 579 to 534. [2022-02-20 23:49:04,687 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:04,688 INFO L82 GeneralOperation]: Start isEquivalent. First operand 579 states. Second operand has 534 states, 459 states have (on average 1.477124183006536) internal successors, (678), 515 states have internal predecessors, (678), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:04,688 INFO L74 IsIncluded]: Start isIncluded. First operand 579 states. Second operand has 534 states, 459 states have (on average 1.477124183006536) internal successors, (678), 515 states have internal predecessors, (678), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:04,688 INFO L87 Difference]: Start difference. First operand 579 states. Second operand has 534 states, 459 states have (on average 1.477124183006536) internal successors, (678), 515 states have internal predecessors, (678), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:04,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,700 INFO L93 Difference]: Finished difference Result 579 states and 753 transitions. [2022-02-20 23:49:04,715 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 753 transitions. [2022-02-20 23:49:04,716 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:04,716 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:04,717 INFO L74 IsIncluded]: Start isIncluded. First operand has 534 states, 459 states have (on average 1.477124183006536) internal successors, (678), 515 states have internal predecessors, (678), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 579 states. [2022-02-20 23:49:04,717 INFO L87 Difference]: Start difference. First operand has 534 states, 459 states have (on average 1.477124183006536) internal successors, (678), 515 states have internal predecessors, (678), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 579 states. [2022-02-20 23:49:04,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:04,729 INFO L93 Difference]: Finished difference Result 579 states and 753 transitions. [2022-02-20 23:49:04,729 INFO L276 IsEmpty]: Start isEmpty. Operand 579 states and 753 transitions. [2022-02-20 23:49:04,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:04,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:04,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:04,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:04,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 459 states have (on average 1.477124183006536) internal successors, (678), 515 states have internal predecessors, (678), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:04,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 706 transitions. [2022-02-20 23:49:04,753 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 706 transitions. Word has length 34 [2022-02-20 23:49:04,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:04,753 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 706 transitions. [2022-02-20 23:49:04,753 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 5.333333333333333) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,754 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 706 transitions. [2022-02-20 23:49:04,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:49:04,754 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:04,754 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, 1] [2022-02-20 23:49:04,754 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-20 23:49:04,754 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:04,755 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:04,755 INFO L85 PathProgramCache]: Analyzing trace with hash -1394937876, now seen corresponding path program 1 times [2022-02-20 23:49:04,755 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:04,755 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1774264576] [2022-02-20 23:49:04,755 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:04,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:04,785 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:04,831 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:04,831 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:04,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {57085#true} #res := ~unnamed1~0~LIST_BEG; {57085#true} is VALID [2022-02-20 23:49:04,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {57085#true} assume true; {57085#true} is VALID [2022-02-20 23:49:04,834 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {57085#true} {57085#true} #333#return; {57085#true} is VALID [2022-02-20 23:49:04,834 INFO L290 TraceCheckUtils]: 0: Hoare triple {57085#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {57085#true} is VALID [2022-02-20 23:49:04,834 INFO L290 TraceCheckUtils]: 1: Hoare triple {57085#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 2: Hoare triple {57085#true} main_#t~short29#1 := main_~i~0#1 < 3; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 3: Hoare triple {57085#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 4: Hoare triple {57085#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 5: Hoare triple {57085#true} main_#t~short31#1 := main_~y~1#1 < 4; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 6: Hoare triple {57085#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 7: Hoare triple {57085#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L272 TraceCheckUtils]: 8: Hoare triple {57085#true} call main_#t~ret32#1 := rand_end_point(); {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 9: Hoare triple {57085#true} #res := ~unnamed1~0~LIST_BEG; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 10: Hoare triple {57085#true} assume true; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {57085#true} {57085#true} #333#return; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 12: Hoare triple {57085#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 13: Hoare triple {57085#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 14: Hoare triple {57085#true} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 15: Hoare triple {57085#true} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 16: Hoare triple {57085#true} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {57085#true} is VALID [2022-02-20 23:49:04,835 INFO L290 TraceCheckUtils]: 17: Hoare triple {57085#true} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {57085#true} is VALID [2022-02-20 23:49:04,836 INFO L290 TraceCheckUtils]: 18: Hoare triple {57085#true} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {57085#true} is VALID [2022-02-20 23:49:04,836 INFO L290 TraceCheckUtils]: 19: Hoare triple {57085#true} assume !create_item_#t~short10#1; {57085#true} is VALID [2022-02-20 23:49:04,836 INFO L290 TraceCheckUtils]: 20: Hoare triple {57085#true} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {57085#true} is VALID [2022-02-20 23:49:04,836 INFO L290 TraceCheckUtils]: 21: Hoare triple {57085#true} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {57085#true} is VALID [2022-02-20 23:49:04,836 INFO L290 TraceCheckUtils]: 22: Hoare triple {57085#true} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {57085#true} is VALID [2022-02-20 23:49:04,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {57085#true} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:49:04,837 INFO L290 TraceCheckUtils]: 24: Hoare triple {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:49:04,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:49:04,838 INFO L290 TraceCheckUtils]: 26: Hoare triple {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:49:04,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:49:04,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {57090#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {57091#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} is VALID [2022-02-20 23:49:04,839 INFO L290 TraceCheckUtils]: 29: Hoare triple {57091#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {57091#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} is VALID [2022-02-20 23:49:04,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {57091#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {57091#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} is VALID [2022-02-20 23:49:04,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {57091#(= (select |#valid| |ULTIMATE.start_create_item_~head~0#1.base|) 1)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {57092#(= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1)} is VALID [2022-02-20 23:49:04,840 INFO L290 TraceCheckUtils]: 32: Hoare triple {57092#(= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1)} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {57093#(= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1)} is VALID [2022-02-20 23:49:04,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {57093#(= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1)} assume !(1 == #valid[append_one_~item~1#1.base]); {57086#false} is VALID [2022-02-20 23:49:04,840 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:49:04,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:04,840 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1774264576] [2022-02-20 23:49:04,840 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1774264576] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:04,840 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:04,840 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:04,840 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1186933258] [2022-02-20 23:49:04,840 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:04,841 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:04,841 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:04,841 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:04,859 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:04,859 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:04,859 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:04,859 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:04,859 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:04,860 INFO L87 Difference]: Start difference. First operand 534 states and 706 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,415 INFO L93 Difference]: Finished difference Result 625 states and 808 transitions. [2022-02-20 23:49:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:05,415 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:05,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:05,416 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,417 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 281 transitions. [2022-02-20 23:49:05,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 281 transitions. [2022-02-20 23:49:05,419 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 281 transitions. [2022-02-20 23:49:05,570 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 281 edges. 281 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,582 INFO L225 Difference]: With dead ends: 625 [2022-02-20 23:49:05,582 INFO L226 Difference]: Without dead ends: 625 [2022-02-20 23:49:05,583 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:05,585 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 493 mSDsluCounter, 385 mSDsCounter, 0 mSdLazyCounter, 277 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 493 SdHoareTripleChecker+Valid, 579 SdHoareTripleChecker+Invalid, 286 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 277 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:05,586 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [493 Valid, 579 Invalid, 286 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 277 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:05,589 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 625 states. [2022-02-20 23:49:05,618 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 625 to 533. [2022-02-20 23:49:05,618 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:05,619 INFO L82 GeneralOperation]: Start isEquivalent. First operand 625 states. Second operand has 533 states, 459 states have (on average 1.4727668845315904) internal successors, (676), 514 states have internal predecessors, (676), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:05,619 INFO L74 IsIncluded]: Start isIncluded. First operand 625 states. Second operand has 533 states, 459 states have (on average 1.4727668845315904) internal successors, (676), 514 states have internal predecessors, (676), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:05,620 INFO L87 Difference]: Start difference. First operand 625 states. Second operand has 533 states, 459 states have (on average 1.4727668845315904) internal successors, (676), 514 states have internal predecessors, (676), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:05,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,647 INFO L93 Difference]: Finished difference Result 625 states and 808 transitions. [2022-02-20 23:49:05,647 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 808 transitions. [2022-02-20 23:49:05,660 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,660 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,660 INFO L74 IsIncluded]: Start isIncluded. First operand has 533 states, 459 states have (on average 1.4727668845315904) internal successors, (676), 514 states have internal predecessors, (676), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 625 states. [2022-02-20 23:49:05,661 INFO L87 Difference]: Start difference. First operand has 533 states, 459 states have (on average 1.4727668845315904) internal successors, (676), 514 states have internal predecessors, (676), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 625 states. [2022-02-20 23:49:05,674 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:05,687 INFO L93 Difference]: Finished difference Result 625 states and 808 transitions. [2022-02-20 23:49:05,687 INFO L276 IsEmpty]: Start isEmpty. Operand 625 states and 808 transitions. [2022-02-20 23:49:05,688 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:05,688 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:05,688 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:05,688 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:05,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 533 states, 459 states have (on average 1.4727668845315904) internal successors, (676), 514 states have internal predecessors, (676), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:05,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 533 states to 533 states and 704 transitions. [2022-02-20 23:49:05,707 INFO L78 Accepts]: Start accepts. Automaton has 533 states and 704 transitions. Word has length 34 [2022-02-20 23:49:05,707 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:05,707 INFO L470 AbstractCegarLoop]: Abstraction has 533 states and 704 transitions. [2022-02-20 23:49:05,708 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,708 INFO L276 IsEmpty]: Start isEmpty. Operand 533 states and 704 transitions. [2022-02-20 23:49:05,708 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2022-02-20 23:49:05,708 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:05,708 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, 1] [2022-02-20 23:49:05,708 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-20 23:49:05,708 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:05,709 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:05,709 INFO L85 PathProgramCache]: Analyzing trace with hash -1394937875, now seen corresponding path program 1 times [2022-02-20 23:49:05,709 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:05,709 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [455687546] [2022-02-20 23:49:05,709 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:05,709 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:05,736 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:05,804 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:05,805 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:05,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {59511#true} #res := ~unnamed1~0~LIST_BEG; {59511#true} is VALID [2022-02-20 23:49:05,808 INFO L290 TraceCheckUtils]: 1: Hoare triple {59511#true} assume true; {59511#true} is VALID [2022-02-20 23:49:05,808 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {59511#true} {59511#true} #333#return; {59511#true} is VALID [2022-02-20 23:49:05,808 INFO L290 TraceCheckUtils]: 0: Hoare triple {59511#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 1: Hoare triple {59511#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 2: Hoare triple {59511#true} main_#t~short29#1 := main_~i~0#1 < 3; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 3: Hoare triple {59511#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 4: Hoare triple {59511#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 5: Hoare triple {59511#true} main_#t~short31#1 := main_~y~1#1 < 4; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 6: Hoare triple {59511#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 7: Hoare triple {59511#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L272 TraceCheckUtils]: 8: Hoare triple {59511#true} call main_#t~ret32#1 := rand_end_point(); {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 9: Hoare triple {59511#true} #res := ~unnamed1~0~LIST_BEG; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L290 TraceCheckUtils]: 10: Hoare triple {59511#true} assume true; {59511#true} is VALID [2022-02-20 23:49:05,809 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {59511#true} {59511#true} #333#return; {59511#true} is VALID [2022-02-20 23:49:05,820 INFO L290 TraceCheckUtils]: 12: Hoare triple {59511#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,820 INFO L290 TraceCheckUtils]: 13: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,821 INFO L290 TraceCheckUtils]: 14: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,821 INFO L290 TraceCheckUtils]: 15: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,821 INFO L290 TraceCheckUtils]: 16: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,822 INFO L290 TraceCheckUtils]: 17: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,822 INFO L290 TraceCheckUtils]: 18: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,823 INFO L290 TraceCheckUtils]: 19: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !create_item_#t~short10#1; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,823 INFO L290 TraceCheckUtils]: 20: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,823 INFO L290 TraceCheckUtils]: 21: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,824 INFO L290 TraceCheckUtils]: 22: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,824 INFO L290 TraceCheckUtils]: 23: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,825 INFO L290 TraceCheckUtils]: 24: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,825 INFO L290 TraceCheckUtils]: 25: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,825 INFO L290 TraceCheckUtils]: 26: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,826 INFO L290 TraceCheckUtils]: 27: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,826 INFO L290 TraceCheckUtils]: 28: Hoare triple {59516#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {59517#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,827 INFO L290 TraceCheckUtils]: 29: Hoare triple {59517#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {59517#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,827 INFO L290 TraceCheckUtils]: 30: Hoare triple {59517#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {59517#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} is VALID [2022-02-20 23:49:05,828 INFO L290 TraceCheckUtils]: 31: Hoare triple {59517#(and (= 265 (select |#length| |ULTIMATE.start_create_item_~head~0#1.base|)) (= |ULTIMATE.start_create_item_~head~0#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {59518#(and (= 265 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} is VALID [2022-02-20 23:49:05,828 INFO L290 TraceCheckUtils]: 32: Hoare triple {59518#(and (= 265 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {59519#(and (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= 265 (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|)))} is VALID [2022-02-20 23:49:05,828 INFO L290 TraceCheckUtils]: 33: Hoare triple {59519#(and (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= 265 (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|)))} assume !(4 + (append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV) <= #length[append_one_~item~1#1.base] && 0 <= append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV); {59512#false} is VALID [2022-02-20 23:49:05,829 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:49:05,829 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:05,829 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [455687546] [2022-02-20 23:49:05,829 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [455687546] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:05,829 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:05,829 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:05,829 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956202390] [2022-02-20 23:49:05,830 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:05,830 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:05,830 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:05,830 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:05,856 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 34 edges. 34 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:05,856 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:05,856 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:05,856 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:05,857 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:05,857 INFO L87 Difference]: Start difference. First operand 533 states and 704 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:06,526 INFO L93 Difference]: Finished difference Result 557 states and 705 transitions. [2022-02-20 23:49:06,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:06,526 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 34 [2022-02-20 23:49:06,526 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:06,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,527 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2022-02-20 23:49:06,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 268 transitions. [2022-02-20 23:49:06,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 268 transitions. [2022-02-20 23:49:06,717 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 268 edges. 268 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:06,727 INFO L225 Difference]: With dead ends: 557 [2022-02-20 23:49:06,727 INFO L226 Difference]: Without dead ends: 557 [2022-02-20 23:49:06,727 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=45, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:06,728 INFO L933 BasicCegarLoop]: 206 mSDtfsCounter, 523 mSDsluCounter, 386 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 523 SdHoareTripleChecker+Valid, 592 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:06,728 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [523 Valid, 592 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:49:06,728 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 557 states. [2022-02-20 23:49:06,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 557 to 532. [2022-02-20 23:49:06,744 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:06,745 INFO L82 GeneralOperation]: Start isEquivalent. First operand 557 states. Second operand has 532 states, 459 states have (on average 1.4684095860566448) internal successors, (674), 513 states have internal predecessors, (674), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:06,745 INFO L74 IsIncluded]: Start isIncluded. First operand 557 states. Second operand has 532 states, 459 states have (on average 1.4684095860566448) internal successors, (674), 513 states have internal predecessors, (674), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:06,745 INFO L87 Difference]: Start difference. First operand 557 states. Second operand has 532 states, 459 states have (on average 1.4684095860566448) internal successors, (674), 513 states have internal predecessors, (674), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:06,756 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:06,756 INFO L93 Difference]: Finished difference Result 557 states and 705 transitions. [2022-02-20 23:49:06,756 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 705 transitions. [2022-02-20 23:49:06,756 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:06,757 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:06,757 INFO L74 IsIncluded]: Start isIncluded. First operand has 532 states, 459 states have (on average 1.4684095860566448) internal successors, (674), 513 states have internal predecessors, (674), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 557 states. [2022-02-20 23:49:06,757 INFO L87 Difference]: Start difference. First operand has 532 states, 459 states have (on average 1.4684095860566448) internal successors, (674), 513 states have internal predecessors, (674), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 557 states. [2022-02-20 23:49:06,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:06,768 INFO L93 Difference]: Finished difference Result 557 states and 705 transitions. [2022-02-20 23:49:06,769 INFO L276 IsEmpty]: Start isEmpty. Operand 557 states and 705 transitions. [2022-02-20 23:49:06,769 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:06,769 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:06,769 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:06,769 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:06,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 532 states, 459 states have (on average 1.4684095860566448) internal successors, (674), 513 states have internal predecessors, (674), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:06,780 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 532 states to 532 states and 702 transitions. [2022-02-20 23:49:06,780 INFO L78 Accepts]: Start accepts. Automaton has 532 states and 702 transitions. Word has length 34 [2022-02-20 23:49:06,780 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:06,781 INFO L470 AbstractCegarLoop]: Abstraction has 532 states and 702 transitions. [2022-02-20 23:49:06,781 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 6 states have internal predecessors, (32), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,781 INFO L276 IsEmpty]: Start isEmpty. Operand 532 states and 702 transitions. [2022-02-20 23:49:06,781 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:49:06,781 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:06,781 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, 1, 1, 1] [2022-02-20 23:49:06,782 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-20 23:49:06,782 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:06,782 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:06,782 INFO L85 PathProgramCache]: Analyzing trace with hash -505498803, now seen corresponding path program 1 times [2022-02-20 23:49:06,782 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:06,782 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2083360634] [2022-02-20 23:49:06,783 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:06,783 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:06,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:06,827 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:06,828 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:06,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {61732#true} #res := ~unnamed1~0~LIST_BEG; {61732#true} is VALID [2022-02-20 23:49:06,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {61732#true} assume true; {61732#true} is VALID [2022-02-20 23:49:06,830 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {61732#true} {61732#true} #333#return; {61732#true} is VALID [2022-02-20 23:49:06,830 INFO L290 TraceCheckUtils]: 0: Hoare triple {61732#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {61732#true} is VALID [2022-02-20 23:49:06,830 INFO L290 TraceCheckUtils]: 1: Hoare triple {61732#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {61732#true} is VALID [2022-02-20 23:49:06,830 INFO L290 TraceCheckUtils]: 2: Hoare triple {61732#true} main_#t~short29#1 := main_~i~0#1 < 3; {61732#true} is VALID [2022-02-20 23:49:06,830 INFO L290 TraceCheckUtils]: 3: Hoare triple {61732#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L290 TraceCheckUtils]: 4: Hoare triple {61732#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {61732#true} main_#t~short31#1 := main_~y~1#1 < 4; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {61732#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {61732#true} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L272 TraceCheckUtils]: 8: Hoare triple {61732#true} call main_#t~ret32#1 := rand_end_point(); {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L290 TraceCheckUtils]: 9: Hoare triple {61732#true} #res := ~unnamed1~0~LIST_BEG; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L290 TraceCheckUtils]: 10: Hoare triple {61732#true} assume true; {61732#true} is VALID [2022-02-20 23:49:06,831 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {61732#true} {61732#true} #333#return; {61732#true} is VALID [2022-02-20 23:49:06,832 INFO L290 TraceCheckUtils]: 12: Hoare triple {61732#true} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:49:06,832 INFO L290 TraceCheckUtils]: 13: Hoare triple {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:49:06,833 INFO L290 TraceCheckUtils]: 14: Hoare triple {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:49:06,833 INFO L290 TraceCheckUtils]: 15: Hoare triple {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:49:06,833 INFO L290 TraceCheckUtils]: 16: Hoare triple {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:49:06,834 INFO L290 TraceCheckUtils]: 17: Hoare triple {61737#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,834 INFO L290 TraceCheckUtils]: 18: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,834 INFO L290 TraceCheckUtils]: 19: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !create_item_#t~short10#1; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,835 INFO L290 TraceCheckUtils]: 20: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,835 INFO L290 TraceCheckUtils]: 21: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,835 INFO L290 TraceCheckUtils]: 22: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,836 INFO L290 TraceCheckUtils]: 23: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,836 INFO L290 TraceCheckUtils]: 24: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,837 INFO L290 TraceCheckUtils]: 25: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,837 INFO L290 TraceCheckUtils]: 26: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,838 INFO L290 TraceCheckUtils]: 27: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,838 INFO L290 TraceCheckUtils]: 28: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,838 INFO L290 TraceCheckUtils]: 29: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} is VALID [2022-02-20 23:49:06,839 INFO L290 TraceCheckUtils]: 30: Hoare triple {61738#(and (= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:49:06,839 INFO L290 TraceCheckUtils]: 31: Hoare triple {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:49:06,839 INFO L290 TraceCheckUtils]: 32: Hoare triple {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:49:06,840 INFO L290 TraceCheckUtils]: 33: Hoare triple {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:49:06,840 INFO L290 TraceCheckUtils]: 34: Hoare triple {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} assume 0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset;havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:49:06,840 INFO L290 TraceCheckUtils]: 35: Hoare triple {61739#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} assume !(1 == #valid[append_one_~list#1.base]); {61733#false} is VALID [2022-02-20 23:49:06,840 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:49:06,840 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:06,841 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2083360634] [2022-02-20 23:49:06,841 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2083360634] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:06,841 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:06,841 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:06,841 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [299844597] [2022-02-20 23:49:06,841 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:06,841 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:49:06,842 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:06,842 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:06,863 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:06,864 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:06,864 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:06,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:06,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:06,865 INFO L87 Difference]: Start difference. First operand 532 states and 702 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,517 INFO L93 Difference]: Finished difference Result 926 states and 1168 transitions. [2022-02-20 23:49:07,517 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:07,518 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:49:07,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:07,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-02-20 23:49:07,520 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,522 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 548 transitions. [2022-02-20 23:49:07,522 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 548 transitions. [2022-02-20 23:49:07,742 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 548 edges. 548 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:07,768 INFO L225 Difference]: With dead ends: 926 [2022-02-20 23:49:07,768 INFO L226 Difference]: Without dead ends: 926 [2022-02-20 23:49:07,769 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:07,769 INFO L933 BasicCegarLoop]: 253 mSDtfsCounter, 531 mSDsluCounter, 397 mSDsCounter, 0 mSdLazyCounter, 262 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 537 SdHoareTripleChecker+Valid, 650 SdHoareTripleChecker+Invalid, 273 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 262 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:07,769 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [537 Valid, 650 Invalid, 273 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 262 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:07,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 926 states. [2022-02-20 23:49:07,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 926 to 529. [2022-02-20 23:49:07,776 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:07,777 INFO L82 GeneralOperation]: Start isEquivalent. First operand 926 states. Second operand has 529 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 510 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:07,777 INFO L74 IsIncluded]: Start isIncluded. First operand 926 states. Second operand has 529 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 510 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:07,777 INFO L87 Difference]: Start difference. First operand 926 states. Second operand has 529 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 510 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,821 INFO L93 Difference]: Finished difference Result 926 states and 1168 transitions. [2022-02-20 23:49:07,822 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1168 transitions. [2022-02-20 23:49:07,823 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:07,823 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:07,823 INFO L74 IsIncluded]: Start isIncluded. First operand has 529 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 510 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 926 states. [2022-02-20 23:49:07,824 INFO L87 Difference]: Start difference. First operand has 529 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 510 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 926 states. [2022-02-20 23:49:07,851 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:07,852 INFO L93 Difference]: Finished difference Result 926 states and 1168 transitions. [2022-02-20 23:49:07,852 INFO L276 IsEmpty]: Start isEmpty. Operand 926 states and 1168 transitions. [2022-02-20 23:49:07,853 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:07,853 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:07,853 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:07,853 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:07,853 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 529 states, 459 states have (on average 1.4553376906318083) internal successors, (668), 510 states have internal predecessors, (668), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:07,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 529 states to 529 states and 696 transitions. [2022-02-20 23:49:07,864 INFO L78 Accepts]: Start accepts. Automaton has 529 states and 696 transitions. Word has length 36 [2022-02-20 23:49:07,865 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:07,865 INFO L470 AbstractCegarLoop]: Abstraction has 529 states and 696 transitions. [2022-02-20 23:49:07,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:07,865 INFO L276 IsEmpty]: Start isEmpty. Operand 529 states and 696 transitions. [2022-02-20 23:49:07,866 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:49:07,866 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:07,866 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:07,866 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-20 23:49:07,866 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:07,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:07,867 INFO L85 PathProgramCache]: Analyzing trace with hash -505498802, now seen corresponding path program 1 times [2022-02-20 23:49:07,867 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:07,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1866556282] [2022-02-20 23:49:07,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:07,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:07,898 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,980 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:07,982 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:07,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {65049#true} #res := ~unnamed1~0~LIST_BEG; {65049#true} is VALID [2022-02-20 23:49:07,988 INFO L290 TraceCheckUtils]: 1: Hoare triple {65049#true} assume true; {65049#true} is VALID [2022-02-20 23:49:07,989 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {65049#true} {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #333#return; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,989 INFO L290 TraceCheckUtils]: 0: Hoare triple {65049#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,990 INFO L290 TraceCheckUtils]: 1: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,990 INFO L290 TraceCheckUtils]: 2: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,990 INFO L290 TraceCheckUtils]: 3: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,991 INFO L290 TraceCheckUtils]: 5: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short31#1 := main_~y~1#1 < 4; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,991 INFO L290 TraceCheckUtils]: 6: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,992 INFO L272 TraceCheckUtils]: 8: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {65049#true} is VALID [2022-02-20 23:49:07,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {65049#true} #res := ~unnamed1~0~LIST_BEG; {65049#true} is VALID [2022-02-20 23:49:07,992 INFO L290 TraceCheckUtils]: 10: Hoare triple {65049#true} assume true; {65049#true} is VALID [2022-02-20 23:49:07,992 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {65049#true} {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #333#return; {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:07,993 INFO L290 TraceCheckUtils]: 12: Hoare triple {65051#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:07,994 INFO L290 TraceCheckUtils]: 13: Hoare triple {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:07,994 INFO L290 TraceCheckUtils]: 14: Hoare triple {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:07,994 INFO L290 TraceCheckUtils]: 15: Hoare triple {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:07,995 INFO L290 TraceCheckUtils]: 16: Hoare triple {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:49:07,995 INFO L290 TraceCheckUtils]: 17: Hoare triple {65055#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,996 INFO L290 TraceCheckUtils]: 18: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,996 INFO L290 TraceCheckUtils]: 19: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} assume !create_item_#t~short10#1; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,997 INFO L290 TraceCheckUtils]: 20: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,997 INFO L290 TraceCheckUtils]: 21: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,997 INFO L290 TraceCheckUtils]: 22: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,998 INFO L290 TraceCheckUtils]: 23: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,998 INFO L290 TraceCheckUtils]: 24: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,999 INFO L290 TraceCheckUtils]: 25: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:07,999 INFO L290 TraceCheckUtils]: 26: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:08,000 INFO L290 TraceCheckUtils]: 27: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:08,000 INFO L290 TraceCheckUtils]: 28: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:08,001 INFO L290 TraceCheckUtils]: 29: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} is VALID [2022-02-20 23:49:08,001 INFO L290 TraceCheckUtils]: 30: Hoare triple {65056#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|)))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} is VALID [2022-02-20 23:49:08,002 INFO L290 TraceCheckUtils]: 31: Hoare triple {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} is VALID [2022-02-20 23:49:08,002 INFO L290 TraceCheckUtils]: 32: Hoare triple {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} is VALID [2022-02-20 23:49:08,002 INFO L290 TraceCheckUtils]: 33: Hoare triple {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} is VALID [2022-02-20 23:49:08,003 INFO L290 TraceCheckUtils]: 34: Hoare triple {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} assume 0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset;havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} is VALID [2022-02-20 23:49:08,003 INFO L290 TraceCheckUtils]: 35: Hoare triple {65057#(and (<= (+ |ULTIMATE.start_append_one_~list#1.offset| 4) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) (<= 0 |ULTIMATE.start_append_one_~list#1.offset|))} assume !(4 + (append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {65050#false} is VALID [2022-02-20 23:49:08,006 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:49:08,006 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:08,006 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1866556282] [2022-02-20 23:49:08,006 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1866556282] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:08,006 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:08,006 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:08,006 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2034898279] [2022-02-20 23:49:08,006 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:08,007 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:49:08,007 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:08,007 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:08,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:08,033 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:08,033 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:08,033 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:08,034 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:08,034 INFO L87 Difference]: Start difference. First operand 529 states and 696 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:08,953 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:08,953 INFO L93 Difference]: Finished difference Result 765 states and 959 transitions. [2022-02-20 23:49:08,954 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:49:08,954 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:49:08,954 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:08,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:08,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2022-02-20 23:49:08,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:08,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 427 transitions. [2022-02-20 23:49:08,958 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 427 transitions. [2022-02-20 23:49:09,276 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 427 edges. 427 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:09,293 INFO L225 Difference]: With dead ends: 765 [2022-02-20 23:49:09,293 INFO L226 Difference]: Without dead ends: 765 [2022-02-20 23:49:09,293 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=26, Invalid=46, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:09,294 INFO L933 BasicCegarLoop]: 254 mSDtfsCounter, 770 mSDsluCounter, 374 mSDsCounter, 0 mSdLazyCounter, 218 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 770 SdHoareTripleChecker+Valid, 628 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 218 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:09,294 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [770 Valid, 628 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 218 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:09,294 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 765 states. [2022-02-20 23:49:09,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 765 to 528. [2022-02-20 23:49:09,299 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:09,299 INFO L82 GeneralOperation]: Start isEquivalent. First operand 765 states. Second operand has 528 states, 459 states have (on average 1.4509803921568627) internal successors, (666), 509 states have internal predecessors, (666), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:09,300 INFO L74 IsIncluded]: Start isIncluded. First operand 765 states. Second operand has 528 states, 459 states have (on average 1.4509803921568627) internal successors, (666), 509 states have internal predecessors, (666), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:09,300 INFO L87 Difference]: Start difference. First operand 765 states. Second operand has 528 states, 459 states have (on average 1.4509803921568627) internal successors, (666), 509 states have internal predecessors, (666), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:09,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:09,318 INFO L93 Difference]: Finished difference Result 765 states and 959 transitions. [2022-02-20 23:49:09,318 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 959 transitions. [2022-02-20 23:49:09,319 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:09,319 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:09,320 INFO L74 IsIncluded]: Start isIncluded. First operand has 528 states, 459 states have (on average 1.4509803921568627) internal successors, (666), 509 states have internal predecessors, (666), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 765 states. [2022-02-20 23:49:09,321 INFO L87 Difference]: Start difference. First operand has 528 states, 459 states have (on average 1.4509803921568627) internal successors, (666), 509 states have internal predecessors, (666), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 765 states. [2022-02-20 23:49:09,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:09,339 INFO L93 Difference]: Finished difference Result 765 states and 959 transitions. [2022-02-20 23:49:09,339 INFO L276 IsEmpty]: Start isEmpty. Operand 765 states and 959 transitions. [2022-02-20 23:49:09,340 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:09,340 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:09,340 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:09,340 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:09,341 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 459 states have (on average 1.4509803921568627) internal successors, (666), 509 states have internal predecessors, (666), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:09,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 694 transitions. [2022-02-20 23:49:09,351 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 694 transitions. Word has length 36 [2022-02-20 23:49:09,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:09,351 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 694 transitions. [2022-02-20 23:49:09,351 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 6 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:09,351 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 694 transitions. [2022-02-20 23:49:09,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2022-02-20 23:49:09,352 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:09,352 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, 1, 1, 1] [2022-02-20 23:49:09,352 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-20 23:49:09,352 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:09,352 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:09,352 INFO L85 PathProgramCache]: Analyzing trace with hash -505498641, now seen corresponding path program 1 times [2022-02-20 23:49:09,352 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:09,353 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [724741267] [2022-02-20 23:49:09,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:09,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:09,382 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:09,485 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:09,486 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:09,488 INFO L290 TraceCheckUtils]: 0: Hoare triple {67889#true} #res := ~unnamed1~0~LIST_BEG; {67889#true} is VALID [2022-02-20 23:49:09,488 INFO L290 TraceCheckUtils]: 1: Hoare triple {67889#true} assume true; {67889#true} is VALID [2022-02-20 23:49:09,489 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {67889#true} {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #333#return; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,489 INFO L290 TraceCheckUtils]: 0: Hoare triple {67889#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,490 INFO L290 TraceCheckUtils]: 1: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,490 INFO L290 TraceCheckUtils]: 2: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short29#1 := main_~i~0#1 < 3; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,491 INFO L290 TraceCheckUtils]: 3: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,491 INFO L290 TraceCheckUtils]: 4: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,492 INFO L290 TraceCheckUtils]: 5: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} main_#t~short31#1 := main_~y~1#1 < 4; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,492 INFO L290 TraceCheckUtils]: 6: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,492 INFO L290 TraceCheckUtils]: 7: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,493 INFO L272 TraceCheckUtils]: 8: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {67889#true} is VALID [2022-02-20 23:49:09,493 INFO L290 TraceCheckUtils]: 9: Hoare triple {67889#true} #res := ~unnamed1~0~LIST_BEG; {67889#true} is VALID [2022-02-20 23:49:09,493 INFO L290 TraceCheckUtils]: 10: Hoare triple {67889#true} assume true; {67889#true} is VALID [2022-02-20 23:49:09,493 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {67889#true} {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #333#return; {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:49:09,494 INFO L290 TraceCheckUtils]: 12: Hoare triple {67891#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,495 INFO L290 TraceCheckUtils]: 13: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,495 INFO L290 TraceCheckUtils]: 14: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,496 INFO L290 TraceCheckUtils]: 15: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,496 INFO L290 TraceCheckUtils]: 16: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,497 INFO L290 TraceCheckUtils]: 17: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,497 INFO L290 TraceCheckUtils]: 18: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,498 INFO L290 TraceCheckUtils]: 19: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !create_item_#t~short10#1; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,498 INFO L290 TraceCheckUtils]: 20: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,499 INFO L290 TraceCheckUtils]: 22: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,500 INFO L290 TraceCheckUtils]: 25: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,502 INFO L290 TraceCheckUtils]: 28: Hoare triple {67895#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|)) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,503 INFO L290 TraceCheckUtils]: 30: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,503 INFO L290 TraceCheckUtils]: 31: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,504 INFO L290 TraceCheckUtils]: 32: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,504 INFO L290 TraceCheckUtils]: 33: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,504 INFO L290 TraceCheckUtils]: 34: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset);havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} is VALID [2022-02-20 23:49:09,505 INFO L290 TraceCheckUtils]: 35: Hoare triple {67896#(and (<= 0 |ULTIMATE.start_append_one_~list#1.offset|) (<= |ULTIMATE.start_append_one_~list#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) 8))} assume !(4 + (append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT) <= #length[append_one_~list#1.base] && 0 <= append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT); {67890#false} is VALID [2022-02-20 23:49:09,506 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:49:09,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:09,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [724741267] [2022-02-20 23:49:09,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [724741267] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:09,506 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:09,506 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:09,506 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018465718] [2022-02-20 23:49:09,507 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:09,507 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:49:09,507 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:09,507 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:09,531 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 36 edges. 36 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:09,531 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:49:09,531 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:09,532 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:49:09,532 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:49:09,532 INFO L87 Difference]: Start difference. First operand 528 states and 694 transitions. Second operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:10,391 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:10,391 INFO L93 Difference]: Finished difference Result 683 states and 837 transitions. [2022-02-20 23:49:10,391 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:49:10,391 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 36 [2022-02-20 23:49:10,392 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:10,392 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:10,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-02-20 23:49:10,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:10,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 474 transitions. [2022-02-20 23:49:10,396 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 474 transitions. [2022-02-20 23:49:10,732 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 474 edges. 474 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:10,745 INFO L225 Difference]: With dead ends: 683 [2022-02-20 23:49:10,746 INFO L226 Difference]: Without dead ends: 683 [2022-02-20 23:49:10,746 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:10,746 INFO L933 BasicCegarLoop]: 184 mSDtfsCounter, 387 mSDsluCounter, 383 mSDsCounter, 0 mSdLazyCounter, 303 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 389 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 312 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 303 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:10,746 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [389 Valid, 567 Invalid, 312 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 303 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:10,747 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 683 states. [2022-02-20 23:49:10,752 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 683 to 528. [2022-02-20 23:49:10,752 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:10,752 INFO L82 GeneralOperation]: Start isEquivalent. First operand 683 states. Second operand has 528 states, 459 states have (on average 1.446623093681917) internal successors, (664), 509 states have internal predecessors, (664), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:10,753 INFO L74 IsIncluded]: Start isIncluded. First operand 683 states. Second operand has 528 states, 459 states have (on average 1.446623093681917) internal successors, (664), 509 states have internal predecessors, (664), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:10,753 INFO L87 Difference]: Start difference. First operand 683 states. Second operand has 528 states, 459 states have (on average 1.446623093681917) internal successors, (664), 509 states have internal predecessors, (664), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:10,772 INFO L93 Difference]: Finished difference Result 683 states and 837 transitions. [2022-02-20 23:49:10,772 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 837 transitions. [2022-02-20 23:49:10,773 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:10,773 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:10,774 INFO L74 IsIncluded]: Start isIncluded. First operand has 528 states, 459 states have (on average 1.446623093681917) internal successors, (664), 509 states have internal predecessors, (664), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 683 states. [2022-02-20 23:49:10,774 INFO L87 Difference]: Start difference. First operand has 528 states, 459 states have (on average 1.446623093681917) internal successors, (664), 509 states have internal predecessors, (664), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) Second operand 683 states. [2022-02-20 23:49:10,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:10,791 INFO L93 Difference]: Finished difference Result 683 states and 837 transitions. [2022-02-20 23:49:10,791 INFO L276 IsEmpty]: Start isEmpty. Operand 683 states and 837 transitions. [2022-02-20 23:49:10,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:10,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:10,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:10,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:10,793 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 459 states have (on average 1.446623093681917) internal successors, (664), 509 states have internal predecessors, (664), 14 states have call successors, (14), 7 states have call predecessors, (14), 7 states have return successors, (14), 11 states have call predecessors, (14), 14 states have call successors, (14) [2022-02-20 23:49:10,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 692 transitions. [2022-02-20 23:49:10,805 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 692 transitions. Word has length 36 [2022-02-20 23:49:10,805 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:10,805 INFO L470 AbstractCegarLoop]: Abstraction has 528 states and 692 transitions. [2022-02-20 23:49:10,805 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.5) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:10,805 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 692 transitions. [2022-02-20 23:49:10,806 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2022-02-20 23:49:10,806 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:10,806 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:10,806 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-20 23:49:10,806 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:10,807 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:10,807 INFO L85 PathProgramCache]: Analyzing trace with hash -2111288145, now seen corresponding path program 1 times [2022-02-20 23:49:10,807 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:10,807 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1836487633] [2022-02-20 23:49:10,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:10,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:10,824 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:10,857 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:10,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:10,860 INFO L290 TraceCheckUtils]: 0: Hoare triple {70478#true} #res := ~unnamed1~0~LIST_BEG; {70478#true} is VALID [2022-02-20 23:49:10,860 INFO L290 TraceCheckUtils]: 1: Hoare triple {70478#true} assume true; {70478#true} is VALID [2022-02-20 23:49:10,860 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70478#true} {70478#true} #335#return; {70478#true} is VALID [2022-02-20 23:49:10,860 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 40 [2022-02-20 23:49:10,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:10,863 INFO L290 TraceCheckUtils]: 0: Hoare triple {70478#true} #res := ~unnamed1~0~LIST_BEG; {70478#true} is VALID [2022-02-20 23:49:10,863 INFO L290 TraceCheckUtils]: 1: Hoare triple {70478#true} assume true; {70478#true} is VALID [2022-02-20 23:49:10,863 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {70478#true} {70486#(= (select |#valid| |~#list~0.base|) 1)} #335#return; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 0: Hoare triple {70478#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {70478#true} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 1: Hoare triple {70478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {70478#true} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 2: Hoare triple {70478#true} main_#t~short29#1 := main_~i~0#1 < 3; {70478#true} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 3: Hoare triple {70478#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {70478#true} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 4: Hoare triple {70478#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {70478#true} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 5: Hoare triple {70478#true} main_#t~short31#1 := main_~y~1#1 < 4; {70478#true} is VALID [2022-02-20 23:49:10,864 INFO L290 TraceCheckUtils]: 6: Hoare triple {70478#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L290 TraceCheckUtils]: 7: Hoare triple {70478#true} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L290 TraceCheckUtils]: 8: Hoare triple {70478#true} main_#t~short36#1 := main_~z~0#1 < 7; {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L290 TraceCheckUtils]: 9: Hoare triple {70478#true} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L290 TraceCheckUtils]: 10: Hoare triple {70478#true} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L272 TraceCheckUtils]: 11: Hoare triple {70478#true} call main_#t~ret37#1 := rand_end_point(); {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L290 TraceCheckUtils]: 12: Hoare triple {70478#true} #res := ~unnamed1~0~LIST_BEG; {70478#true} is VALID [2022-02-20 23:49:10,865 INFO L290 TraceCheckUtils]: 13: Hoare triple {70478#true} assume true; {70478#true} is VALID [2022-02-20 23:49:10,866 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {70478#true} {70478#true} #335#return; {70478#true} is VALID [2022-02-20 23:49:10,866 INFO L290 TraceCheckUtils]: 15: Hoare triple {70478#true} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,867 INFO L290 TraceCheckUtils]: 16: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,867 INFO L290 TraceCheckUtils]: 17: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,868 INFO L290 TraceCheckUtils]: 18: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,868 INFO L290 TraceCheckUtils]: 19: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,868 INFO L290 TraceCheckUtils]: 20: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,869 INFO L290 TraceCheckUtils]: 21: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,869 INFO L290 TraceCheckUtils]: 22: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,870 INFO L290 TraceCheckUtils]: 23: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,870 INFO L290 TraceCheckUtils]: 24: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,871 INFO L290 TraceCheckUtils]: 25: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,871 INFO L290 TraceCheckUtils]: 26: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,872 INFO L290 TraceCheckUtils]: 27: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,872 INFO L290 TraceCheckUtils]: 28: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem22#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,872 INFO L290 TraceCheckUtils]: 29: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,873 INFO L290 TraceCheckUtils]: 30: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {70484#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:10,873 INFO L290 TraceCheckUtils]: 31: Hoare triple {70484#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {70485#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:49:10,874 INFO L290 TraceCheckUtils]: 32: Hoare triple {70485#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {70485#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:49:10,874 INFO L290 TraceCheckUtils]: 33: Hoare triple {70485#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {70485#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} is VALID [2022-02-20 23:49:10,875 INFO L290 TraceCheckUtils]: 34: Hoare triple {70485#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,875 INFO L290 TraceCheckUtils]: 35: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,875 INFO L290 TraceCheckUtils]: 36: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume !(main_~length~0#1 > 0); {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,876 INFO L290 TraceCheckUtils]: 37: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} main_#t~short36#1 := main_~z~0#1 < 7; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,876 INFO L290 TraceCheckUtils]: 38: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,876 INFO L290 TraceCheckUtils]: 39: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,877 INFO L272 TraceCheckUtils]: 40: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} call main_#t~ret37#1 := rand_end_point(); {70478#true} is VALID [2022-02-20 23:49:10,877 INFO L290 TraceCheckUtils]: 41: Hoare triple {70478#true} #res := ~unnamed1~0~LIST_BEG; {70478#true} is VALID [2022-02-20 23:49:10,877 INFO L290 TraceCheckUtils]: 42: Hoare triple {70478#true} assume true; {70478#true} is VALID [2022-02-20 23:49:10,877 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70478#true} {70486#(= (select |#valid| |~#list~0.base|) 1)} #335#return; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:10,878 INFO L290 TraceCheckUtils]: 44: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {70490#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} is VALID [2022-02-20 23:49:10,878 INFO L290 TraceCheckUtils]: 45: Hoare triple {70490#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} assume !(1 == #valid[is_empty_~list#1.base]); {70479#false} is VALID [2022-02-20 23:49:10,879 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:10,879 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:10,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1836487633] [2022-02-20 23:49:10,879 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1836487633] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:10,879 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1892958288] [2022-02-20 23:49:10,880 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:10,880 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:10,880 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:10,881 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:49:10,911 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:49:10,973 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:10,975 INFO L263 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:49:10,997 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:11,002 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:11,286 INFO L290 TraceCheckUtils]: 0: Hoare triple {70478#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,286 INFO L290 TraceCheckUtils]: 1: Hoare triple {70494#(= 3 |~#list~0.base|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,287 INFO L290 TraceCheckUtils]: 2: Hoare triple {70494#(= 3 |~#list~0.base|)} main_#t~short29#1 := main_~i~0#1 < 3; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,287 INFO L290 TraceCheckUtils]: 3: Hoare triple {70494#(= 3 |~#list~0.base|)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,287 INFO L290 TraceCheckUtils]: 4: Hoare triple {70494#(= 3 |~#list~0.base|)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,287 INFO L290 TraceCheckUtils]: 5: Hoare triple {70494#(= 3 |~#list~0.base|)} main_#t~short31#1 := main_~y~1#1 < 4; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,288 INFO L290 TraceCheckUtils]: 6: Hoare triple {70494#(= 3 |~#list~0.base|)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,288 INFO L290 TraceCheckUtils]: 7: Hoare triple {70494#(= 3 |~#list~0.base|)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,288 INFO L290 TraceCheckUtils]: 8: Hoare triple {70494#(= 3 |~#list~0.base|)} main_#t~short36#1 := main_~z~0#1 < 7; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,289 INFO L290 TraceCheckUtils]: 9: Hoare triple {70494#(= 3 |~#list~0.base|)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,289 INFO L290 TraceCheckUtils]: 10: Hoare triple {70494#(= 3 |~#list~0.base|)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,289 INFO L272 TraceCheckUtils]: 11: Hoare triple {70494#(= 3 |~#list~0.base|)} call main_#t~ret37#1 := rand_end_point(); {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,289 INFO L290 TraceCheckUtils]: 12: Hoare triple {70494#(= 3 |~#list~0.base|)} #res := ~unnamed1~0~LIST_BEG; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,290 INFO L290 TraceCheckUtils]: 13: Hoare triple {70494#(= 3 |~#list~0.base|)} assume true; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,290 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {70494#(= 3 |~#list~0.base|)} {70494#(= 3 |~#list~0.base|)} #335#return; {70494#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:49:11,291 INFO L290 TraceCheckUtils]: 15: Hoare triple {70494#(= 3 |~#list~0.base|)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,291 INFO L290 TraceCheckUtils]: 16: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,292 INFO L290 TraceCheckUtils]: 17: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,292 INFO L290 TraceCheckUtils]: 18: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,292 INFO L290 TraceCheckUtils]: 19: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,293 INFO L290 TraceCheckUtils]: 20: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,293 INFO L290 TraceCheckUtils]: 21: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,294 INFO L290 TraceCheckUtils]: 22: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,294 INFO L290 TraceCheckUtils]: 23: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,294 INFO L290 TraceCheckUtils]: 24: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,295 INFO L290 TraceCheckUtils]: 25: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,295 INFO L290 TraceCheckUtils]: 26: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,296 INFO L290 TraceCheckUtils]: 27: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,296 INFO L290 TraceCheckUtils]: 28: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 0 == remove_one_#t~mem22#1.offset; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,296 INFO L290 TraceCheckUtils]: 29: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,297 INFO L290 TraceCheckUtils]: 30: Hoare triple {70540#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {70586#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,297 INFO L290 TraceCheckUtils]: 31: Hoare triple {70586#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,298 INFO L290 TraceCheckUtils]: 32: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,298 INFO L290 TraceCheckUtils]: 33: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,298 INFO L290 TraceCheckUtils]: 34: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,299 INFO L290 TraceCheckUtils]: 35: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,299 INFO L290 TraceCheckUtils]: 36: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !(main_~length~0#1 > 0); {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,299 INFO L290 TraceCheckUtils]: 37: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} main_#t~short36#1 := main_~z~0#1 < 7; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,300 INFO L290 TraceCheckUtils]: 38: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,300 INFO L290 TraceCheckUtils]: 39: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,300 INFO L272 TraceCheckUtils]: 40: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} call main_#t~ret37#1 := rand_end_point(); {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,301 INFO L290 TraceCheckUtils]: 41: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} #res := ~unnamed1~0~LIST_BEG; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,301 INFO L290 TraceCheckUtils]: 42: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume true; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,302 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} #335#return; {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:49:11,302 INFO L290 TraceCheckUtils]: 44: Hoare triple {70590#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {70630#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:49:11,302 INFO L290 TraceCheckUtils]: 45: Hoare triple {70630#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| 3) 1))} assume !(1 == #valid[is_empty_~list#1.base]); {70479#false} is VALID [2022-02-20 23:49:11,303 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:11,303 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:11,371 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:49:11,371 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 12 treesize of output 11 [2022-02-20 23:49:11,457 INFO L290 TraceCheckUtils]: 45: Hoare triple {70490#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} assume !(1 == #valid[is_empty_~list#1.base]); {70479#false} is VALID [2022-02-20 23:49:11,457 INFO L290 TraceCheckUtils]: 44: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {70490#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} is VALID [2022-02-20 23:49:11,458 INFO L284 TraceCheckUtils]: 43: Hoare quadruple {70478#true} {70486#(= (select |#valid| |~#list~0.base|) 1)} #335#return; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,458 INFO L290 TraceCheckUtils]: 42: Hoare triple {70478#true} assume true; {70478#true} is VALID [2022-02-20 23:49:11,458 INFO L290 TraceCheckUtils]: 41: Hoare triple {70478#true} #res := ~unnamed1~0~LIST_BEG; {70478#true} is VALID [2022-02-20 23:49:11,458 INFO L272 TraceCheckUtils]: 40: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} call main_#t~ret37#1 := rand_end_point(); {70478#true} is VALID [2022-02-20 23:49:11,459 INFO L290 TraceCheckUtils]: 39: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,459 INFO L290 TraceCheckUtils]: 38: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,459 INFO L290 TraceCheckUtils]: 37: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} main_#t~short36#1 := main_~z~0#1 < 7; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,459 INFO L290 TraceCheckUtils]: 36: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume !(main_~length~0#1 > 0); {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,460 INFO L290 TraceCheckUtils]: 35: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,460 INFO L290 TraceCheckUtils]: 34: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,460 INFO L290 TraceCheckUtils]: 33: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,460 INFO L290 TraceCheckUtils]: 32: Hoare triple {70486#(= (select |#valid| |~#list~0.base|) 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,461 INFO L290 TraceCheckUtils]: 31: Hoare triple {70484#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {70486#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:49:11,461 INFO L290 TraceCheckUtils]: 30: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {70484#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,462 INFO L290 TraceCheckUtils]: 29: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,462 INFO L290 TraceCheckUtils]: 28: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem22#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,462 INFO L290 TraceCheckUtils]: 27: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,463 INFO L290 TraceCheckUtils]: 26: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,463 INFO L290 TraceCheckUtils]: 25: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,464 INFO L290 TraceCheckUtils]: 24: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,464 INFO L290 TraceCheckUtils]: 22: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,465 INFO L290 TraceCheckUtils]: 21: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,465 INFO L290 TraceCheckUtils]: 20: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,465 INFO L290 TraceCheckUtils]: 19: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,466 INFO L290 TraceCheckUtils]: 18: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,466 INFO L290 TraceCheckUtils]: 17: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,466 INFO L290 TraceCheckUtils]: 16: Hoare triple {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,467 INFO L290 TraceCheckUtils]: 15: Hoare triple {70478#true} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {70483#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:49:11,467 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {70478#true} {70478#true} #335#return; {70478#true} is VALID [2022-02-20 23:49:11,467 INFO L290 TraceCheckUtils]: 13: Hoare triple {70478#true} assume true; {70478#true} is VALID [2022-02-20 23:49:11,467 INFO L290 TraceCheckUtils]: 12: Hoare triple {70478#true} #res := ~unnamed1~0~LIST_BEG; {70478#true} is VALID [2022-02-20 23:49:11,467 INFO L272 TraceCheckUtils]: 11: Hoare triple {70478#true} call main_#t~ret37#1 := rand_end_point(); {70478#true} is VALID [2022-02-20 23:49:11,467 INFO L290 TraceCheckUtils]: 10: Hoare triple {70478#true} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 9: Hoare triple {70478#true} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 8: Hoare triple {70478#true} main_#t~short36#1 := main_~z~0#1 < 7; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 7: Hoare triple {70478#true} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 6: Hoare triple {70478#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 5: Hoare triple {70478#true} main_#t~short31#1 := main_~y~1#1 < 4; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 4: Hoare triple {70478#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {70478#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 2: Hoare triple {70478#true} main_#t~short29#1 := main_~i~0#1 < 3; {70478#true} is VALID [2022-02-20 23:49:11,468 INFO L290 TraceCheckUtils]: 1: Hoare triple {70478#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {70478#true} is VALID [2022-02-20 23:49:11,469 INFO L290 TraceCheckUtils]: 0: Hoare triple {70478#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {70478#true} is VALID [2022-02-20 23:49:11,469 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:11,469 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1892958288] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:11,469 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:11,469 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-20 23:49:11,469 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [583560008] [2022-02-20 23:49:11,470 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:11,470 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-02-20 23:49:11,470 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:11,470 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:11,544 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 94 edges. 94 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:11,544 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:49:11,544 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:11,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:49:11,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:11,545 INFO L87 Difference]: Start difference. First operand 528 states and 692 transitions. Second operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:14,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:14,124 INFO L93 Difference]: Finished difference Result 1659 states and 2022 transitions. [2022-02-20 23:49:14,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:49:14,124 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) Word has length 46 [2022-02-20 23:49:14,124 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:14,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:14,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1163 transitions. [2022-02-20 23:49:14,129 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:14,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1163 transitions. [2022-02-20 23:49:14,134 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1163 transitions. [2022-02-20 23:49:14,887 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1163 edges. 1163 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:14,968 INFO L225 Difference]: With dead ends: 1659 [2022-02-20 23:49:14,968 INFO L226 Difference]: Without dead ends: 1659 [2022-02-20 23:49:14,969 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 96 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 63 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=131, Invalid=289, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:49:14,970 INFO L933 BasicCegarLoop]: 290 mSDtfsCounter, 2311 mSDsluCounter, 1000 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 111 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2313 SdHoareTripleChecker+Valid, 1290 SdHoareTripleChecker+Invalid, 864 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 111 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:14,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2313 Valid, 1290 Invalid, 864 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [111 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 23:49:14,976 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1659 states. [2022-02-20 23:49:14,985 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1659 to 628. [2022-02-20 23:49:14,986 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:14,986 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1659 states. Second operand has 628 states, 556 states have (on average 1.3974820143884892) internal successors, (777), 602 states have internal predecessors, (777), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:14,987 INFO L74 IsIncluded]: Start isIncluded. First operand 1659 states. Second operand has 628 states, 556 states have (on average 1.3974820143884892) internal successors, (777), 602 states have internal predecessors, (777), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:14,987 INFO L87 Difference]: Start difference. First operand 1659 states. Second operand has 628 states, 556 states have (on average 1.3974820143884892) internal successors, (777), 602 states have internal predecessors, (777), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:15,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,083 INFO L93 Difference]: Finished difference Result 1659 states and 2022 transitions. [2022-02-20 23:49:15,084 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2022 transitions. [2022-02-20 23:49:15,085 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:15,086 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:15,086 INFO L74 IsIncluded]: Start isIncluded. First operand has 628 states, 556 states have (on average 1.3974820143884892) internal successors, (777), 602 states have internal predecessors, (777), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) Second operand 1659 states. [2022-02-20 23:49:15,087 INFO L87 Difference]: Start difference. First operand has 628 states, 556 states have (on average 1.3974820143884892) internal successors, (777), 602 states have internal predecessors, (777), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) Second operand 1659 states. [2022-02-20 23:49:15,199 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:15,199 INFO L93 Difference]: Finished difference Result 1659 states and 2022 transitions. [2022-02-20 23:49:15,199 INFO L276 IsEmpty]: Start isEmpty. Operand 1659 states and 2022 transitions. [2022-02-20 23:49:15,201 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:15,201 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:15,201 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:15,201 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:15,202 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 628 states, 556 states have (on average 1.3974820143884892) internal successors, (777), 602 states have internal predecessors, (777), 20 states have call successors, (20), 10 states have call predecessors, (20), 10 states have return successors, (20), 15 states have call predecessors, (20), 20 states have call successors, (20) [2022-02-20 23:49:15,217 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 628 states to 628 states and 817 transitions. [2022-02-20 23:49:15,217 INFO L78 Accepts]: Start accepts. Automaton has 628 states and 817 transitions. Word has length 46 [2022-02-20 23:49:15,217 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:15,217 INFO L470 AbstractCegarLoop]: Abstraction has 628 states and 817 transitions. [2022-02-20 23:49:15,218 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.818181818181818) internal successors, (86), 12 states have internal predecessors, (86), 4 states have call successors, (4), 3 states have call predecessors, (4), 3 states have return successors, (4), 4 states have call predecessors, (4), 4 states have call successors, (4) [2022-02-20 23:49:15,218 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 817 transitions. [2022-02-20 23:49:15,218 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:49:15,218 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:15,218 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:15,242 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:15,439 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,SelfDestructingSolverStorable34 [2022-02-20 23:49:15,439 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:15,440 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:15,440 INFO L85 PathProgramCache]: Analyzing trace with hash 1830908708, now seen corresponding path program 1 times [2022-02-20 23:49:15,440 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:15,440 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [995788382] [2022-02-20 23:49:15,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:15,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:15,462 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,487 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:15,489 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,491 INFO L290 TraceCheckUtils]: 0: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,491 INFO L290 TraceCheckUtils]: 1: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,491 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76397#true} {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} #333#return; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 23:49:15,492 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,494 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {76397#true} {76398#false} #335#return; {76398#false} is VALID [2022-02-20 23:49:15,494 INFO L290 TraceCheckUtils]: 0: Hoare triple {76397#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {76397#true} is VALID [2022-02-20 23:49:15,494 INFO L290 TraceCheckUtils]: 1: Hoare triple {76397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,495 INFO L290 TraceCheckUtils]: 3: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,495 INFO L290 TraceCheckUtils]: 4: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,495 INFO L290 TraceCheckUtils]: 5: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,496 INFO L290 TraceCheckUtils]: 6: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,496 INFO L272 TraceCheckUtils]: 8: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} call main_#t~ret32#1 := rand_end_point(); {76397#true} is VALID [2022-02-20 23:49:15,496 INFO L290 TraceCheckUtils]: 9: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,496 INFO L290 TraceCheckUtils]: 10: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,497 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76397#true} {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} #333#return; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,498 INFO L290 TraceCheckUtils]: 14: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,498 INFO L290 TraceCheckUtils]: 15: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,498 INFO L290 TraceCheckUtils]: 17: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !create_item_#t~short10#1; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,499 INFO L290 TraceCheckUtils]: 20: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,499 INFO L290 TraceCheckUtils]: 21: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,500 INFO L290 TraceCheckUtils]: 22: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,500 INFO L290 TraceCheckUtils]: 23: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,500 INFO L290 TraceCheckUtils]: 24: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,501 INFO L290 TraceCheckUtils]: 25: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,501 INFO L290 TraceCheckUtils]: 26: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,501 INFO L290 TraceCheckUtils]: 27: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,501 INFO L290 TraceCheckUtils]: 28: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,502 INFO L290 TraceCheckUtils]: 29: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,502 INFO L290 TraceCheckUtils]: 30: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,502 INFO L290 TraceCheckUtils]: 31: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,502 INFO L290 TraceCheckUtils]: 32: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,503 INFO L290 TraceCheckUtils]: 33: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,503 INFO L290 TraceCheckUtils]: 34: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !(0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset);havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,503 INFO L290 TraceCheckUtils]: 35: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L704-2 {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,504 INFO L290 TraceCheckUtils]: 36: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,504 INFO L290 TraceCheckUtils]: 37: Hoare triple {76399#(= |ULTIMATE.start_main_~y~1#1| 0)} assume { :end_inline_append_one } true;havoc main_#t~ret32#1;main_#t~post33#1 := main_~y~1#1;main_~y~1#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;main_#t~post34#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {76403#(<= |ULTIMATE.start_main_~y~1#1| 1)} is VALID [2022-02-20 23:49:15,504 INFO L290 TraceCheckUtils]: 38: Hoare triple {76403#(<= |ULTIMATE.start_main_~y~1#1| 1)} main_#t~short31#1 := main_~y~1#1 < 4; {76404#|ULTIMATE.start_main_#t~short31#1|} is VALID [2022-02-20 23:49:15,505 INFO L290 TraceCheckUtils]: 39: Hoare triple {76404#|ULTIMATE.start_main_#t~short31#1|} assume !main_#t~short31#1; {76398#false} is VALID [2022-02-20 23:49:15,505 INFO L290 TraceCheckUtils]: 40: Hoare triple {76398#false} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {76398#false} is VALID [2022-02-20 23:49:15,505 INFO L290 TraceCheckUtils]: 41: Hoare triple {76398#false} main_#t~short36#1 := main_~z~0#1 < 7; {76398#false} is VALID [2022-02-20 23:49:15,505 INFO L290 TraceCheckUtils]: 42: Hoare triple {76398#false} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {76398#false} is VALID [2022-02-20 23:49:15,505 INFO L290 TraceCheckUtils]: 43: Hoare triple {76398#false} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {76398#false} is VALID [2022-02-20 23:49:15,505 INFO L272 TraceCheckUtils]: 44: Hoare triple {76398#false} call main_#t~ret37#1 := rand_end_point(); {76397#true} is VALID [2022-02-20 23:49:15,505 INFO L290 TraceCheckUtils]: 45: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,506 INFO L290 TraceCheckUtils]: 46: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,506 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {76397#true} {76398#false} #335#return; {76398#false} is VALID [2022-02-20 23:49:15,506 INFO L290 TraceCheckUtils]: 48: Hoare triple {76398#false} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {76398#false} is VALID [2022-02-20 23:49:15,506 INFO L290 TraceCheckUtils]: 49: Hoare triple {76398#false} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {76398#false} is VALID [2022-02-20 23:49:15,506 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:15,506 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:15,506 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [995788382] [2022-02-20 23:49:15,506 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [995788382] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:15,507 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2039152563] [2022-02-20 23:49:15,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:15,507 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:15,507 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:15,508 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:49:15,509 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:49:15,606 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,608 INFO L263 TraceCheckSpWp]: Trace formula consists of 293 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:15,622 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:15,624 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:15,785 INFO L290 TraceCheckUtils]: 0: Hoare triple {76397#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {76397#true} is VALID [2022-02-20 23:49:15,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {76397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,787 INFO L290 TraceCheckUtils]: 3: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,787 INFO L290 TraceCheckUtils]: 4: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,787 INFO L290 TraceCheckUtils]: 5: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,788 INFO L290 TraceCheckUtils]: 7: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,788 INFO L272 TraceCheckUtils]: 8: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} call main_#t~ret32#1 := rand_end_point(); {76397#true} is VALID [2022-02-20 23:49:15,788 INFO L290 TraceCheckUtils]: 9: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,788 INFO L290 TraceCheckUtils]: 10: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,789 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76397#true} {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} #333#return; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,789 INFO L290 TraceCheckUtils]: 12: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,790 INFO L290 TraceCheckUtils]: 15: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,790 INFO L290 TraceCheckUtils]: 16: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,790 INFO L290 TraceCheckUtils]: 17: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,791 INFO L290 TraceCheckUtils]: 18: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,791 INFO L290 TraceCheckUtils]: 19: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !create_item_#t~short10#1; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,791 INFO L290 TraceCheckUtils]: 20: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,792 INFO L290 TraceCheckUtils]: 21: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,792 INFO L290 TraceCheckUtils]: 22: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,792 INFO L290 TraceCheckUtils]: 23: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,792 INFO L290 TraceCheckUtils]: 24: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,793 INFO L290 TraceCheckUtils]: 25: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,793 INFO L290 TraceCheckUtils]: 26: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,793 INFO L290 TraceCheckUtils]: 27: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,794 INFO L290 TraceCheckUtils]: 28: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,794 INFO L290 TraceCheckUtils]: 29: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,794 INFO L290 TraceCheckUtils]: 30: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,795 INFO L290 TraceCheckUtils]: 31: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,795 INFO L290 TraceCheckUtils]: 32: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,795 INFO L290 TraceCheckUtils]: 33: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,795 INFO L290 TraceCheckUtils]: 34: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !(0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset);havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,796 INFO L290 TraceCheckUtils]: 35: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L704-2 {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,796 INFO L290 TraceCheckUtils]: 36: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} is VALID [2022-02-20 23:49:15,797 INFO L290 TraceCheckUtils]: 37: Hoare triple {76414#(<= |ULTIMATE.start_main_~y~1#1| 0)} assume { :end_inline_append_one } true;havoc main_#t~ret32#1;main_#t~post33#1 := main_~y~1#1;main_~y~1#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;main_#t~post34#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {76403#(<= |ULTIMATE.start_main_~y~1#1| 1)} is VALID [2022-02-20 23:49:15,797 INFO L290 TraceCheckUtils]: 38: Hoare triple {76403#(<= |ULTIMATE.start_main_~y~1#1| 1)} main_#t~short31#1 := main_~y~1#1 < 4; {76404#|ULTIMATE.start_main_#t~short31#1|} is VALID [2022-02-20 23:49:15,797 INFO L290 TraceCheckUtils]: 39: Hoare triple {76404#|ULTIMATE.start_main_#t~short31#1|} assume !main_#t~short31#1; {76398#false} is VALID [2022-02-20 23:49:15,797 INFO L290 TraceCheckUtils]: 40: Hoare triple {76398#false} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L290 TraceCheckUtils]: 41: Hoare triple {76398#false} main_#t~short36#1 := main_~z~0#1 < 7; {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L290 TraceCheckUtils]: 42: Hoare triple {76398#false} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L290 TraceCheckUtils]: 43: Hoare triple {76398#false} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L272 TraceCheckUtils]: 44: Hoare triple {76398#false} call main_#t~ret37#1 := rand_end_point(); {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L290 TraceCheckUtils]: 45: Hoare triple {76398#false} #res := ~unnamed1~0~LIST_BEG; {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L290 TraceCheckUtils]: 46: Hoare triple {76398#false} assume true; {76398#false} is VALID [2022-02-20 23:49:15,798 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {76398#false} {76398#false} #335#return; {76398#false} is VALID [2022-02-20 23:49:15,799 INFO L290 TraceCheckUtils]: 48: Hoare triple {76398#false} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {76398#false} is VALID [2022-02-20 23:49:15,799 INFO L290 TraceCheckUtils]: 49: Hoare triple {76398#false} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {76398#false} is VALID [2022-02-20 23:49:15,799 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:15,799 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:15,950 INFO L290 TraceCheckUtils]: 49: Hoare triple {76398#false} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {76398#false} is VALID [2022-02-20 23:49:15,950 INFO L290 TraceCheckUtils]: 48: Hoare triple {76398#false} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {76398#false} is VALID [2022-02-20 23:49:15,950 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {76397#true} {76398#false} #335#return; {76398#false} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 46: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 45: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,951 INFO L272 TraceCheckUtils]: 44: Hoare triple {76398#false} call main_#t~ret37#1 := rand_end_point(); {76397#true} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 43: Hoare triple {76398#false} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {76398#false} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 42: Hoare triple {76398#false} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {76398#false} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 41: Hoare triple {76398#false} main_#t~short36#1 := main_~z~0#1 < 7; {76398#false} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 40: Hoare triple {76398#false} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {76398#false} is VALID [2022-02-20 23:49:15,951 INFO L290 TraceCheckUtils]: 39: Hoare triple {76404#|ULTIMATE.start_main_#t~short31#1|} assume !main_#t~short31#1; {76398#false} is VALID [2022-02-20 23:49:15,952 INFO L290 TraceCheckUtils]: 38: Hoare triple {76592#(< |ULTIMATE.start_main_~y~1#1| 4)} main_#t~short31#1 := main_~y~1#1 < 4; {76404#|ULTIMATE.start_main_#t~short31#1|} is VALID [2022-02-20 23:49:15,952 INFO L290 TraceCheckUtils]: 37: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume { :end_inline_append_one } true;havoc main_#t~ret32#1;main_#t~post33#1 := main_~y~1#1;main_~y~1#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;main_#t~post34#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {76592#(< |ULTIMATE.start_main_~y~1#1| 4)} is VALID [2022-02-20 23:49:15,953 INFO L290 TraceCheckUtils]: 36: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,953 INFO L290 TraceCheckUtils]: 35: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L704-2 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,953 INFO L290 TraceCheckUtils]: 34: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !(0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset);havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,953 INFO L290 TraceCheckUtils]: 33: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,954 INFO L290 TraceCheckUtils]: 32: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,954 INFO L290 TraceCheckUtils]: 31: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,954 INFO L290 TraceCheckUtils]: 30: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,954 INFO L290 TraceCheckUtils]: 29: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,955 INFO L290 TraceCheckUtils]: 28: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,955 INFO L290 TraceCheckUtils]: 27: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,955 INFO L290 TraceCheckUtils]: 26: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,955 INFO L290 TraceCheckUtils]: 25: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,956 INFO L290 TraceCheckUtils]: 24: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,956 INFO L290 TraceCheckUtils]: 23: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,956 INFO L290 TraceCheckUtils]: 22: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,956 INFO L290 TraceCheckUtils]: 21: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,957 INFO L290 TraceCheckUtils]: 20: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,957 INFO L290 TraceCheckUtils]: 19: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !create_item_#t~short10#1; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,957 INFO L290 TraceCheckUtils]: 18: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,957 INFO L290 TraceCheckUtils]: 17: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,958 INFO L290 TraceCheckUtils]: 16: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,958 INFO L290 TraceCheckUtils]: 14: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,958 INFO L290 TraceCheckUtils]: 13: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,959 INFO L290 TraceCheckUtils]: 12: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,959 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {76397#true} {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} #333#return; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,959 INFO L290 TraceCheckUtils]: 10: Hoare triple {76397#true} assume true; {76397#true} is VALID [2022-02-20 23:49:15,959 INFO L290 TraceCheckUtils]: 9: Hoare triple {76397#true} #res := ~unnamed1~0~LIST_BEG; {76397#true} is VALID [2022-02-20 23:49:15,960 INFO L272 TraceCheckUtils]: 8: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} call main_#t~ret32#1 := rand_end_point(); {76397#true} is VALID [2022-02-20 23:49:15,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,960 INFO L290 TraceCheckUtils]: 6: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,960 INFO L290 TraceCheckUtils]: 5: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} main_#t~short31#1 := main_~y~1#1 < 4; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} main_#t~short29#1 := main_~i~0#1 < 3; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {76397#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {76596#(< |ULTIMATE.start_main_~y~1#1| 3)} is VALID [2022-02-20 23:49:15,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {76397#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {76397#true} is VALID [2022-02-20 23:49:15,962 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:15,962 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2039152563] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:15,962 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:15,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 23:49:15,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [331813588] [2022-02-20 23:49:15,962 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:15,963 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2022-02-20 23:49:15,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:15,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:16,037 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:49:16,037 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:49:16,038 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:16,038 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:49:16,038 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:16,038 INFO L87 Difference]: Start difference. First operand 628 states and 817 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:16,904 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:16,904 INFO L93 Difference]: Finished difference Result 1810 states and 2379 transitions. [2022-02-20 23:49:16,904 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:49:16,904 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) Word has length 50 [2022-02-20 23:49:16,904 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:16,905 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:16,908 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions. [2022-02-20 23:49:16,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:16,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 709 transitions. [2022-02-20 23:49:16,911 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 709 transitions. [2022-02-20 23:49:17,355 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 709 edges. 709 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:17,484 INFO L225 Difference]: With dead ends: 1810 [2022-02-20 23:49:17,484 INFO L226 Difference]: Without dead ends: 1810 [2022-02-20 23:49:17,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:17,485 INFO L933 BasicCegarLoop]: 204 mSDtfsCounter, 979 mSDsluCounter, 844 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 985 SdHoareTripleChecker+Valid, 1048 SdHoareTripleChecker+Invalid, 67 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:17,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [985 Valid, 1048 Invalid, 67 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:17,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1810 states. [2022-02-20 23:49:17,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1810 to 1180. [2022-02-20 23:49:17,498 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:17,499 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1810 states. Second operand has 1180 states, 1099 states have (on average 1.4222020018198362) internal successors, (1563), 1145 states have internal predecessors, (1563), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:17,500 INFO L74 IsIncluded]: Start isIncluded. First operand 1810 states. Second operand has 1180 states, 1099 states have (on average 1.4222020018198362) internal successors, (1563), 1145 states have internal predecessors, (1563), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:17,500 INFO L87 Difference]: Start difference. First operand 1810 states. Second operand has 1180 states, 1099 states have (on average 1.4222020018198362) internal successors, (1563), 1145 states have internal predecessors, (1563), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:17,602 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:17,603 INFO L93 Difference]: Finished difference Result 1810 states and 2379 transitions. [2022-02-20 23:49:17,603 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2379 transitions. [2022-02-20 23:49:17,605 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:17,605 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:17,606 INFO L74 IsIncluded]: Start isIncluded. First operand has 1180 states, 1099 states have (on average 1.4222020018198362) internal successors, (1563), 1145 states have internal predecessors, (1563), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) Second operand 1810 states. [2022-02-20 23:49:17,607 INFO L87 Difference]: Start difference. First operand has 1180 states, 1099 states have (on average 1.4222020018198362) internal successors, (1563), 1145 states have internal predecessors, (1563), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) Second operand 1810 states. [2022-02-20 23:49:17,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:17,710 INFO L93 Difference]: Finished difference Result 1810 states and 2379 transitions. [2022-02-20 23:49:17,710 INFO L276 IsEmpty]: Start isEmpty. Operand 1810 states and 2379 transitions. [2022-02-20 23:49:17,712 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:17,712 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:17,712 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:17,712 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:17,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1180 states, 1099 states have (on average 1.4222020018198362) internal successors, (1563), 1145 states have internal predecessors, (1563), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:17,763 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1180 states to 1180 states and 1621 transitions. [2022-02-20 23:49:17,763 INFO L78 Accepts]: Start accepts. Automaton has 1180 states and 1621 transitions. Word has length 50 [2022-02-20 23:49:17,763 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:17,763 INFO L470 AbstractCegarLoop]: Abstraction has 1180 states and 1621 transitions. [2022-02-20 23:49:17,764 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 4 states have call successors, (5), 2 states have call predecessors, (5), 2 states have return successors, (5), 4 states have call predecessors, (5), 4 states have call successors, (5) [2022-02-20 23:49:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 1180 states and 1621 transitions. [2022-02-20 23:49:17,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:49:17,764 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:17,764 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:17,784 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:49:17,982 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,SelfDestructingSolverStorable35 [2022-02-20 23:49:17,982 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:17,982 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:17,982 INFO L85 PathProgramCache]: Analyzing trace with hash 1129844130, now seen corresponding path program 1 times [2022-02-20 23:49:17,982 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:17,982 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [260718934] [2022-02-20 23:49:17,982 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:17,982 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:18,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:18,102 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:18,107 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:18,110 INFO L290 TraceCheckUtils]: 0: Hoare triple {83325#true} #res := ~unnamed1~0~LIST_BEG; {83325#true} is VALID [2022-02-20 23:49:18,111 INFO L290 TraceCheckUtils]: 1: Hoare triple {83325#true} assume true; {83325#true} is VALID [2022-02-20 23:49:18,111 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83325#true} {83327#(<= 0 |~#list~0.offset|)} #333#return; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,111 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 44 [2022-02-20 23:49:18,112 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:18,114 INFO L290 TraceCheckUtils]: 0: Hoare triple {83325#true} #res := ~unnamed1~0~LIST_BEG; {83325#true} is VALID [2022-02-20 23:49:18,114 INFO L290 TraceCheckUtils]: 1: Hoare triple {83325#true} assume true; {83325#true} is VALID [2022-02-20 23:49:18,114 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {83325#true} {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} #335#return; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,115 INFO L290 TraceCheckUtils]: 0: Hoare triple {83325#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,115 INFO L290 TraceCheckUtils]: 1: Hoare triple {83327#(<= 0 |~#list~0.offset|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,116 INFO L290 TraceCheckUtils]: 2: Hoare triple {83327#(<= 0 |~#list~0.offset|)} main_#t~short29#1 := main_~i~0#1 < 3; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,116 INFO L290 TraceCheckUtils]: 3: Hoare triple {83327#(<= 0 |~#list~0.offset|)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,116 INFO L290 TraceCheckUtils]: 4: Hoare triple {83327#(<= 0 |~#list~0.offset|)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,116 INFO L290 TraceCheckUtils]: 5: Hoare triple {83327#(<= 0 |~#list~0.offset|)} main_#t~short31#1 := main_~y~1#1 < 4; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,117 INFO L290 TraceCheckUtils]: 6: Hoare triple {83327#(<= 0 |~#list~0.offset|)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,117 INFO L290 TraceCheckUtils]: 7: Hoare triple {83327#(<= 0 |~#list~0.offset|)} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,117 INFO L272 TraceCheckUtils]: 8: Hoare triple {83327#(<= 0 |~#list~0.offset|)} call main_#t~ret32#1 := rand_end_point(); {83325#true} is VALID [2022-02-20 23:49:18,117 INFO L290 TraceCheckUtils]: 9: Hoare triple {83325#true} #res := ~unnamed1~0~LIST_BEG; {83325#true} is VALID [2022-02-20 23:49:18,117 INFO L290 TraceCheckUtils]: 10: Hoare triple {83325#true} assume true; {83325#true} is VALID [2022-02-20 23:49:18,118 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {83325#true} {83327#(<= 0 |~#list~0.offset|)} #333#return; {83327#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:18,118 INFO L290 TraceCheckUtils]: 12: Hoare triple {83327#(<= 0 |~#list~0.offset|)} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,119 INFO L290 TraceCheckUtils]: 13: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,119 INFO L290 TraceCheckUtils]: 14: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,119 INFO L290 TraceCheckUtils]: 15: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,120 INFO L290 TraceCheckUtils]: 16: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,120 INFO L290 TraceCheckUtils]: 17: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,121 INFO L290 TraceCheckUtils]: 18: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,121 INFO L290 TraceCheckUtils]: 19: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !create_item_#t~short10#1; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,121 INFO L290 TraceCheckUtils]: 20: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,122 INFO L290 TraceCheckUtils]: 21: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,122 INFO L290 TraceCheckUtils]: 22: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,123 INFO L290 TraceCheckUtils]: 23: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,123 INFO L290 TraceCheckUtils]: 24: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,124 INFO L290 TraceCheckUtils]: 25: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,124 INFO L290 TraceCheckUtils]: 26: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,125 INFO L290 TraceCheckUtils]: 27: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,125 INFO L290 TraceCheckUtils]: 28: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,125 INFO L290 TraceCheckUtils]: 29: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,126 INFO L290 TraceCheckUtils]: 30: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,126 INFO L290 TraceCheckUtils]: 31: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,127 INFO L290 TraceCheckUtils]: 32: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,127 INFO L290 TraceCheckUtils]: 33: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,127 INFO L290 TraceCheckUtils]: 34: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset);havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,128 INFO L290 TraceCheckUtils]: 35: Hoare triple {83331#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L704-2 {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,128 INFO L290 TraceCheckUtils]: 36: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,129 INFO L290 TraceCheckUtils]: 37: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume { :end_inline_append_one } true;havoc main_#t~ret32#1;main_#t~post33#1 := main_~y~1#1;main_~y~1#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;main_#t~post34#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,129 INFO L290 TraceCheckUtils]: 38: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} main_#t~short31#1 := main_~y~1#1 < 4; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,129 INFO L290 TraceCheckUtils]: 39: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,130 INFO L290 TraceCheckUtils]: 40: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,130 INFO L290 TraceCheckUtils]: 41: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} main_#t~short36#1 := main_~z~0#1 < 7; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,131 INFO L290 TraceCheckUtils]: 42: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,131 INFO L290 TraceCheckUtils]: 43: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,131 INFO L272 TraceCheckUtils]: 44: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} call main_#t~ret37#1 := rand_end_point(); {83325#true} is VALID [2022-02-20 23:49:18,131 INFO L290 TraceCheckUtils]: 45: Hoare triple {83325#true} #res := ~unnamed1~0~LIST_BEG; {83325#true} is VALID [2022-02-20 23:49:18,131 INFO L290 TraceCheckUtils]: 46: Hoare triple {83325#true} assume true; {83325#true} is VALID [2022-02-20 23:49:18,132 INFO L284 TraceCheckUtils]: 47: Hoare quadruple {83325#true} {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} #335#return; {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:18,132 INFO L290 TraceCheckUtils]: 48: Hoare triple {83332#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {83336#(and (<= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed2~0~ITEM_NEXT 4) 4) (select |#length| |ULTIMATE.start_is_empty_~list#1.base|)) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} is VALID [2022-02-20 23:49:18,133 INFO L290 TraceCheckUtils]: 49: Hoare triple {83336#(and (<= (+ |ULTIMATE.start_is_empty_~list#1.offset| (* ~unnamed2~0~ITEM_NEXT 4) 4) (select |#length| |ULTIMATE.start_is_empty_~list#1.base|)) (<= 0 |ULTIMATE.start_is_empty_~list#1.offset|))} assume !(4 + (is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG) <= #length[is_empty_~list#1.base] && 0 <= is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG); {83326#false} is VALID [2022-02-20 23:49:18,133 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:18,133 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:18,133 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [260718934] [2022-02-20 23:49:18,134 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [260718934] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:18,134 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:18,134 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:49:18,134 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1562777999] [2022-02-20 23:49:18,134 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:18,136 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:49:18,136 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:18,136 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:18,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 48 edges. 48 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:18,170 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:49:18,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:18,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:49:18,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:49:18,172 INFO L87 Difference]: Start difference. First operand 1180 states and 1621 transitions. Second operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:18,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:18,880 INFO L93 Difference]: Finished difference Result 1280 states and 1724 transitions. [2022-02-20 23:49:18,880 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:49:18,880 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2022-02-20 23:49:18,880 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:18,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:18,882 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2022-02-20 23:49:18,882 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:18,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 313 transitions. [2022-02-20 23:49:18,883 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 313 transitions. [2022-02-20 23:49:19,157 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 313 edges. 313 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:19,205 INFO L225 Difference]: With dead ends: 1280 [2022-02-20 23:49:19,205 INFO L226 Difference]: Without dead ends: 1280 [2022-02-20 23:49:19,205 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=29, Invalid=43, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:49:19,206 INFO L933 BasicCegarLoop]: 242 mSDtfsCounter, 368 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 173 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 429 SdHoareTripleChecker+Invalid, 187 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 173 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:19,206 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [368 Valid, 429 Invalid, 187 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 173 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:49:19,207 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1280 states. [2022-02-20 23:49:19,217 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1280 to 1177. [2022-02-20 23:49:19,217 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:19,218 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1280 states. Second operand has 1177 states, 1099 states have (on average 1.4094631483166515) internal successors, (1549), 1142 states have internal predecessors, (1549), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:19,219 INFO L74 IsIncluded]: Start isIncluded. First operand 1280 states. Second operand has 1177 states, 1099 states have (on average 1.4094631483166515) internal successors, (1549), 1142 states have internal predecessors, (1549), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:19,220 INFO L87 Difference]: Start difference. First operand 1280 states. Second operand has 1177 states, 1099 states have (on average 1.4094631483166515) internal successors, (1549), 1142 states have internal predecessors, (1549), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:19,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:19,267 INFO L93 Difference]: Finished difference Result 1280 states and 1724 transitions. [2022-02-20 23:49:19,267 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1724 transitions. [2022-02-20 23:49:19,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:19,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:19,269 INFO L74 IsIncluded]: Start isIncluded. First operand has 1177 states, 1099 states have (on average 1.4094631483166515) internal successors, (1549), 1142 states have internal predecessors, (1549), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) Second operand 1280 states. [2022-02-20 23:49:19,270 INFO L87 Difference]: Start difference. First operand has 1177 states, 1099 states have (on average 1.4094631483166515) internal successors, (1549), 1142 states have internal predecessors, (1549), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) Second operand 1280 states. [2022-02-20 23:49:19,318 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:19,319 INFO L93 Difference]: Finished difference Result 1280 states and 1724 transitions. [2022-02-20 23:49:19,319 INFO L276 IsEmpty]: Start isEmpty. Operand 1280 states and 1724 transitions. [2022-02-20 23:49:19,320 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:19,320 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:19,320 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:19,320 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:19,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1177 states, 1099 states have (on average 1.4094631483166515) internal successors, (1549), 1142 states have internal predecessors, (1549), 29 states have call successors, (29), 10 states have call predecessors, (29), 10 states have return successors, (29), 24 states have call predecessors, (29), 29 states have call successors, (29) [2022-02-20 23:49:19,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1177 states to 1177 states and 1607 transitions. [2022-02-20 23:49:19,364 INFO L78 Accepts]: Start accepts. Automaton has 1177 states and 1607 transitions. Word has length 50 [2022-02-20 23:49:19,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:19,364 INFO L470 AbstractCegarLoop]: Abstraction has 1177 states and 1607 transitions. [2022-02-20 23:49:19,364 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 8.8) internal successors, (44), 6 states have internal predecessors, (44), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 23:49:19,364 INFO L276 IsEmpty]: Start isEmpty. Operand 1177 states and 1607 transitions. [2022-02-20 23:49:19,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:49:19,365 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:19,365 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:19,365 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-20 23:49:19,365 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:19,365 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:19,366 INFO L85 PathProgramCache]: Analyzing trace with hash -642104005, now seen corresponding path program 1 times [2022-02-20 23:49:19,366 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:19,366 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1616215844] [2022-02-20 23:49:19,366 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:19,366 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:19,383 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:19,402 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:19,403 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:19,407 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#true} #res := ~unnamed1~0~LIST_BEG; {88362#true} is VALID [2022-02-20 23:49:19,407 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 23:49:19,407 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {88362#true} {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} #335#return; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,408 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {88362#true} is VALID [2022-02-20 23:49:19,408 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,408 INFO L290 TraceCheckUtils]: 2: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,408 INFO L290 TraceCheckUtils]: 3: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,409 INFO L290 TraceCheckUtils]: 4: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,409 INFO L290 TraceCheckUtils]: 5: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,410 INFO L290 TraceCheckUtils]: 6: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,410 INFO L290 TraceCheckUtils]: 7: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,410 INFO L290 TraceCheckUtils]: 8: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} main_#t~short36#1 := main_~z~0#1 < 7; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,410 INFO L290 TraceCheckUtils]: 9: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,411 INFO L290 TraceCheckUtils]: 10: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,411 INFO L272 TraceCheckUtils]: 11: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} call main_#t~ret37#1 := rand_end_point(); {88362#true} is VALID [2022-02-20 23:49:19,411 INFO L290 TraceCheckUtils]: 12: Hoare triple {88362#true} #res := ~unnamed1~0~LIST_BEG; {88362#true} is VALID [2022-02-20 23:49:19,411 INFO L290 TraceCheckUtils]: 13: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 23:49:19,411 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {88362#true} {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} #335#return; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,412 INFO L290 TraceCheckUtils]: 15: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,412 INFO L290 TraceCheckUtils]: 16: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,412 INFO L290 TraceCheckUtils]: 17: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,412 INFO L290 TraceCheckUtils]: 18: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,413 INFO L290 TraceCheckUtils]: 19: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,413 INFO L290 TraceCheckUtils]: 20: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,413 INFO L290 TraceCheckUtils]: 21: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is_empty_#res#1 := is_empty_~no_beg~0#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,413 INFO L290 TraceCheckUtils]: 22: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,414 INFO L290 TraceCheckUtils]: 23: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,414 INFO L290 TraceCheckUtils]: 24: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,414 INFO L290 TraceCheckUtils]: 25: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,415 INFO L290 TraceCheckUtils]: 26: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,415 INFO L290 TraceCheckUtils]: 27: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,415 INFO L290 TraceCheckUtils]: 28: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume 0 == remove_one_#t~mem22#1.offset; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,415 INFO L290 TraceCheckUtils]: 29: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,416 INFO L290 TraceCheckUtils]: 30: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,416 INFO L290 TraceCheckUtils]: 31: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,416 INFO L290 TraceCheckUtils]: 32: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,416 INFO L290 TraceCheckUtils]: 33: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,417 INFO L290 TraceCheckUtils]: 34: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,417 INFO L290 TraceCheckUtils]: 35: Hoare triple {88364#(= |ULTIMATE.start_main_~z~0#1| 0)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} is VALID [2022-02-20 23:49:19,417 INFO L290 TraceCheckUtils]: 36: Hoare triple {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} assume !(main_~length~0#1 > 0); {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} is VALID [2022-02-20 23:49:19,418 INFO L290 TraceCheckUtils]: 37: Hoare triple {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} main_#t~short36#1 := main_~z~0#1 < 7; {88369#|ULTIMATE.start_main_#t~short36#1|} is VALID [2022-02-20 23:49:19,418 INFO L290 TraceCheckUtils]: 38: Hoare triple {88369#|ULTIMATE.start_main_#t~short36#1|} assume !main_#t~short36#1; {88363#false} is VALID [2022-02-20 23:49:19,418 INFO L290 TraceCheckUtils]: 39: Hoare triple {88363#false} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {88363#false} is VALID [2022-02-20 23:49:19,418 INFO L290 TraceCheckUtils]: 40: Hoare triple {88363#false} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {88363#false} is VALID [2022-02-20 23:49:19,418 INFO L290 TraceCheckUtils]: 41: Hoare triple {88363#false} main_#t~short29#1 := main_~i~0#1 < 3; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 42: Hoare triple {88363#false} assume !main_#t~short29#1; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 43: Hoare triple {88363#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 44: Hoare triple {88363#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 45: Hoare triple {88363#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 46: Hoare triple {88363#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 47: Hoare triple {88363#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 48: Hoare triple {88363#false} assume !(main_~length~0#1 > 0); {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 49: Hoare triple {88363#false} main_#res#1 := 0; {88363#false} is VALID [2022-02-20 23:49:19,419 INFO L290 TraceCheckUtils]: 50: Hoare triple {88363#false} assume !(#valid == main_old_#valid#1); {88363#false} is VALID [2022-02-20 23:49:19,420 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:19,420 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:19,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1616215844] [2022-02-20 23:49:19,420 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1616215844] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:19,420 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [844267923] [2022-02-20 23:49:19,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:19,420 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:19,420 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:19,421 INFO L229 MonitoredProcess]: Starting monitored process 4 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:49:19,422 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2022-02-20 23:49:19,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:19,502 INFO L263 TraceCheckSpWp]: Trace formula consists of 218 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:19,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:19,513 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:19,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {88362#true} is VALID [2022-02-20 23:49:19,644 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,645 INFO L290 TraceCheckUtils]: 3: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,645 INFO L290 TraceCheckUtils]: 4: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,645 INFO L290 TraceCheckUtils]: 5: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,646 INFO L290 TraceCheckUtils]: 7: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,646 INFO L290 TraceCheckUtils]: 8: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} main_#t~short36#1 := main_~z~0#1 < 7; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,646 INFO L290 TraceCheckUtils]: 9: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,647 INFO L290 TraceCheckUtils]: 10: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,647 INFO L272 TraceCheckUtils]: 11: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} call main_#t~ret37#1 := rand_end_point(); {88362#true} is VALID [2022-02-20 23:49:19,647 INFO L290 TraceCheckUtils]: 12: Hoare triple {88362#true} #res := ~unnamed1~0~LIST_BEG; {88362#true} is VALID [2022-02-20 23:49:19,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 23:49:19,647 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {88362#true} {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} #335#return; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,648 INFO L290 TraceCheckUtils]: 15: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,648 INFO L290 TraceCheckUtils]: 16: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,648 INFO L290 TraceCheckUtils]: 17: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,649 INFO L290 TraceCheckUtils]: 18: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,649 INFO L290 TraceCheckUtils]: 19: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,649 INFO L290 TraceCheckUtils]: 20: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,649 INFO L290 TraceCheckUtils]: 21: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is_empty_#res#1 := is_empty_~no_beg~0#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,650 INFO L290 TraceCheckUtils]: 22: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,650 INFO L290 TraceCheckUtils]: 23: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,650 INFO L290 TraceCheckUtils]: 24: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,651 INFO L290 TraceCheckUtils]: 25: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,651 INFO L290 TraceCheckUtils]: 26: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,651 INFO L290 TraceCheckUtils]: 27: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,651 INFO L290 TraceCheckUtils]: 28: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume 0 == remove_one_#t~mem22#1.offset; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,652 INFO L290 TraceCheckUtils]: 29: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,652 INFO L290 TraceCheckUtils]: 30: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,652 INFO L290 TraceCheckUtils]: 31: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,652 INFO L290 TraceCheckUtils]: 32: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,653 INFO L290 TraceCheckUtils]: 33: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,653 INFO L290 TraceCheckUtils]: 34: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} is VALID [2022-02-20 23:49:19,661 INFO L290 TraceCheckUtils]: 35: Hoare triple {88376#(<= |ULTIMATE.start_main_~z~0#1| 0)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} is VALID [2022-02-20 23:49:19,662 INFO L290 TraceCheckUtils]: 36: Hoare triple {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} assume !(main_~length~0#1 > 0); {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} is VALID [2022-02-20 23:49:19,662 INFO L290 TraceCheckUtils]: 37: Hoare triple {88368#(<= |ULTIMATE.start_main_~z~0#1| 1)} main_#t~short36#1 := main_~z~0#1 < 7; {88369#|ULTIMATE.start_main_#t~short36#1|} is VALID [2022-02-20 23:49:19,662 INFO L290 TraceCheckUtils]: 38: Hoare triple {88369#|ULTIMATE.start_main_#t~short36#1|} assume !main_#t~short36#1; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 39: Hoare triple {88363#false} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 40: Hoare triple {88363#false} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 41: Hoare triple {88363#false} main_#t~short29#1 := main_~i~0#1 < 3; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 42: Hoare triple {88363#false} assume !main_#t~short29#1; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 43: Hoare triple {88363#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 44: Hoare triple {88363#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 45: Hoare triple {88363#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 46: Hoare triple {88363#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 47: Hoare triple {88363#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {88363#false} is VALID [2022-02-20 23:49:19,663 INFO L290 TraceCheckUtils]: 48: Hoare triple {88363#false} assume !(main_~length~0#1 > 0); {88363#false} is VALID [2022-02-20 23:49:19,664 INFO L290 TraceCheckUtils]: 49: Hoare triple {88363#false} main_#res#1 := 0; {88363#false} is VALID [2022-02-20 23:49:19,664 INFO L290 TraceCheckUtils]: 50: Hoare triple {88363#false} assume !(#valid == main_old_#valid#1); {88363#false} is VALID [2022-02-20 23:49:19,664 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:19,664 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:19,807 INFO L290 TraceCheckUtils]: 50: Hoare triple {88363#false} assume !(#valid == main_old_#valid#1); {88363#false} is VALID [2022-02-20 23:49:19,807 INFO L290 TraceCheckUtils]: 49: Hoare triple {88363#false} main_#res#1 := 0; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 48: Hoare triple {88363#false} assume !(main_~length~0#1 > 0); {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 47: Hoare triple {88363#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 46: Hoare triple {88363#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 45: Hoare triple {88363#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 44: Hoare triple {88363#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 43: Hoare triple {88363#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 42: Hoare triple {88363#false} assume !main_#t~short29#1; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 41: Hoare triple {88363#false} main_#t~short29#1 := main_~i~0#1 < 3; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 40: Hoare triple {88363#false} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {88363#false} is VALID [2022-02-20 23:49:19,808 INFO L290 TraceCheckUtils]: 39: Hoare triple {88363#false} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {88363#false} is VALID [2022-02-20 23:49:19,809 INFO L290 TraceCheckUtils]: 38: Hoare triple {88369#|ULTIMATE.start_main_#t~short36#1|} assume !main_#t~short36#1; {88363#false} is VALID [2022-02-20 23:49:19,809 INFO L290 TraceCheckUtils]: 37: Hoare triple {88563#(< |ULTIMATE.start_main_~z~0#1| 7)} main_#t~short36#1 := main_~z~0#1 < 7; {88369#|ULTIMATE.start_main_#t~short36#1|} is VALID [2022-02-20 23:49:19,809 INFO L290 TraceCheckUtils]: 36: Hoare triple {88563#(< |ULTIMATE.start_main_~z~0#1| 7)} assume !(main_~length~0#1 > 0); {88563#(< |ULTIMATE.start_main_~z~0#1| 7)} is VALID [2022-02-20 23:49:19,810 INFO L290 TraceCheckUtils]: 35: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {88563#(< |ULTIMATE.start_main_~z~0#1| 7)} is VALID [2022-02-20 23:49:19,810 INFO L290 TraceCheckUtils]: 34: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,810 INFO L290 TraceCheckUtils]: 33: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,811 INFO L290 TraceCheckUtils]: 32: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,811 INFO L290 TraceCheckUtils]: 31: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,811 INFO L290 TraceCheckUtils]: 30: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,811 INFO L290 TraceCheckUtils]: 29: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,812 INFO L290 TraceCheckUtils]: 28: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume 0 == remove_one_#t~mem22#1.offset; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,812 INFO L290 TraceCheckUtils]: 27: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,812 INFO L290 TraceCheckUtils]: 26: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,812 INFO L290 TraceCheckUtils]: 25: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,813 INFO L290 TraceCheckUtils]: 24: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,813 INFO L290 TraceCheckUtils]: 23: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,827 INFO L290 TraceCheckUtils]: 22: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,827 INFO L290 TraceCheckUtils]: 21: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is_empty_#res#1 := is_empty_~no_beg~0#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,828 INFO L290 TraceCheckUtils]: 20: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,828 INFO L290 TraceCheckUtils]: 19: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,828 INFO L290 TraceCheckUtils]: 18: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,829 INFO L290 TraceCheckUtils]: 17: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,829 INFO L290 TraceCheckUtils]: 16: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,829 INFO L290 TraceCheckUtils]: 15: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,830 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {88362#true} {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} #335#return; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,830 INFO L290 TraceCheckUtils]: 13: Hoare triple {88362#true} assume true; {88362#true} is VALID [2022-02-20 23:49:19,830 INFO L290 TraceCheckUtils]: 12: Hoare triple {88362#true} #res := ~unnamed1~0~LIST_BEG; {88362#true} is VALID [2022-02-20 23:49:19,830 INFO L272 TraceCheckUtils]: 11: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} call main_#t~ret37#1 := rand_end_point(); {88362#true} is VALID [2022-02-20 23:49:19,830 INFO L290 TraceCheckUtils]: 10: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,830 INFO L290 TraceCheckUtils]: 9: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,831 INFO L290 TraceCheckUtils]: 8: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} main_#t~short36#1 := main_~z~0#1 < 7; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,831 INFO L290 TraceCheckUtils]: 7: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,831 INFO L290 TraceCheckUtils]: 6: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,831 INFO L290 TraceCheckUtils]: 5: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} main_#t~short31#1 := main_~y~1#1 < 4; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,832 INFO L290 TraceCheckUtils]: 4: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,832 INFO L290 TraceCheckUtils]: 3: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,832 INFO L290 TraceCheckUtils]: 2: Hoare triple {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} main_#t~short29#1 := main_~i~0#1 < 3; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,833 INFO L290 TraceCheckUtils]: 1: Hoare triple {88362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {88570#(< |ULTIMATE.start_main_~z~0#1| 6)} is VALID [2022-02-20 23:49:19,833 INFO L290 TraceCheckUtils]: 0: Hoare triple {88362#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {88362#true} is VALID [2022-02-20 23:49:19,833 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 4 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:19,833 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [844267923] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:19,833 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:19,833 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 8 [2022-02-20 23:49:19,833 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363183392] [2022-02-20 23:49:19,834 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:19,835 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-02-20 23:49:19,835 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:19,835 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:19,894 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:49:19,894 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:49:19,894 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:19,894 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:49:19,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:49:19,895 INFO L87 Difference]: Start difference. First operand 1177 states and 1607 transitions. Second operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:20,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:20,486 INFO L93 Difference]: Finished difference Result 2251 states and 2962 transitions. [2022-02-20 23:49:20,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:49:20,487 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-02-20 23:49:20,487 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:20,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:20,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 437 transitions. [2022-02-20 23:49:20,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:20,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 437 transitions. [2022-02-20 23:49:20,491 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 437 transitions. [2022-02-20 23:49:20,768 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 437 edges. 437 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:20,924 INFO L225 Difference]: With dead ends: 2251 [2022-02-20 23:49:20,925 INFO L226 Difference]: Without dead ends: 2251 [2022-02-20 23:49:20,925 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 101 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 13 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=52, Invalid=80, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:49:20,925 INFO L933 BasicCegarLoop]: 197 mSDtfsCounter, 589 mSDsluCounter, 456 mSDsCounter, 0 mSdLazyCounter, 25 mSolverCounterSat, 26 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 592 SdHoareTripleChecker+Valid, 653 SdHoareTripleChecker+Invalid, 51 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 26 IncrementalHoareTripleChecker+Valid, 25 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:20,926 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [592 Valid, 653 Invalid, 51 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [26 Valid, 25 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:20,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2251 states. [2022-02-20 23:49:20,950 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2251 to 1926. [2022-02-20 23:49:20,950 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:20,952 INFO L82 GeneralOperation]: Start isEquivalent. First operand 2251 states. Second operand has 1926 states, 1818 states have (on average 1.3778877887788779) internal successors, (2505), 1861 states have internal predecessors, (2505), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 23:49:20,954 INFO L74 IsIncluded]: Start isIncluded. First operand 2251 states. Second operand has 1926 states, 1818 states have (on average 1.3778877887788779) internal successors, (2505), 1861 states have internal predecessors, (2505), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 23:49:20,955 INFO L87 Difference]: Start difference. First operand 2251 states. Second operand has 1926 states, 1818 states have (on average 1.3778877887788779) internal successors, (2505), 1861 states have internal predecessors, (2505), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 23:49:21,138 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:21,139 INFO L93 Difference]: Finished difference Result 2251 states and 2962 transitions. [2022-02-20 23:49:21,139 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2962 transitions. [2022-02-20 23:49:21,141 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:21,141 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:21,143 INFO L74 IsIncluded]: Start isIncluded. First operand has 1926 states, 1818 states have (on average 1.3778877887788779) internal successors, (2505), 1861 states have internal predecessors, (2505), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) Second operand 2251 states. [2022-02-20 23:49:21,144 INFO L87 Difference]: Start difference. First operand has 1926 states, 1818 states have (on average 1.3778877887788779) internal successors, (2505), 1861 states have internal predecessors, (2505), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) Second operand 2251 states. [2022-02-20 23:49:21,293 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:21,293 INFO L93 Difference]: Finished difference Result 2251 states and 2962 transitions. [2022-02-20 23:49:21,294 INFO L276 IsEmpty]: Start isEmpty. Operand 2251 states and 2962 transitions. [2022-02-20 23:49:21,296 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:21,296 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:21,296 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:21,296 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:21,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 1926 states, 1818 states have (on average 1.3778877887788779) internal successors, (2505), 1861 states have internal predecessors, (2505), 59 states have call successors, (59), 10 states have call predecessors, (59), 10 states have return successors, (59), 54 states have call predecessors, (59), 59 states have call successors, (59) [2022-02-20 23:49:21,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1926 states to 1926 states and 2623 transitions. [2022-02-20 23:49:21,418 INFO L78 Accepts]: Start accepts. Automaton has 1926 states and 2623 transitions. Word has length 51 [2022-02-20 23:49:21,418 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:21,418 INFO L470 AbstractCegarLoop]: Abstraction has 1926 states and 2623 transitions. [2022-02-20 23:49:21,418 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 14.125) internal successors, (113), 8 states have internal predecessors, (113), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:21,419 INFO L276 IsEmpty]: Start isEmpty. Operand 1926 states and 2623 transitions. [2022-02-20 23:49:21,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:49:21,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:21,419 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:21,436 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:21,636 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:21,636 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:21,636 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:21,636 INFO L85 PathProgramCache]: Analyzing trace with hash -55297991, now seen corresponding path program 1 times [2022-02-20 23:49:21,636 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:21,637 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [733275694] [2022-02-20 23:49:21,637 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:21,637 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:21,654 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:21,672 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:21,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:21,675 INFO L290 TraceCheckUtils]: 0: Hoare triple {97362#true} #res := ~unnamed1~0~LIST_BEG; {97362#true} is VALID [2022-02-20 23:49:21,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {97362#true} assume true; {97362#true} is VALID [2022-02-20 23:49:21,676 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {97362#true} {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} #335#return; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,676 INFO L290 TraceCheckUtils]: 0: Hoare triple {97362#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {97362#true} is VALID [2022-02-20 23:49:21,676 INFO L290 TraceCheckUtils]: 1: Hoare triple {97362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,676 INFO L290 TraceCheckUtils]: 2: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,677 INFO L290 TraceCheckUtils]: 3: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,677 INFO L290 TraceCheckUtils]: 4: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,677 INFO L290 TraceCheckUtils]: 5: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,678 INFO L290 TraceCheckUtils]: 7: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,678 INFO L290 TraceCheckUtils]: 8: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short36#1 := main_~z~0#1 < 7; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,678 INFO L290 TraceCheckUtils]: 9: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,679 INFO L290 TraceCheckUtils]: 10: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,679 INFO L272 TraceCheckUtils]: 11: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~ret37#1 := rand_end_point(); {97362#true} is VALID [2022-02-20 23:49:21,679 INFO L290 TraceCheckUtils]: 12: Hoare triple {97362#true} #res := ~unnamed1~0~LIST_BEG; {97362#true} is VALID [2022-02-20 23:49:21,679 INFO L290 TraceCheckUtils]: 13: Hoare triple {97362#true} assume true; {97362#true} is VALID [2022-02-20 23:49:21,679 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {97362#true} {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} #335#return; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,680 INFO L290 TraceCheckUtils]: 15: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,681 INFO L290 TraceCheckUtils]: 21: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is_empty_#res#1 := is_empty_~no_beg~0#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,681 INFO L290 TraceCheckUtils]: 22: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,682 INFO L290 TraceCheckUtils]: 23: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,682 INFO L290 TraceCheckUtils]: 24: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,682 INFO L290 TraceCheckUtils]: 25: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,683 INFO L290 TraceCheckUtils]: 26: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,683 INFO L290 TraceCheckUtils]: 27: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,689 INFO L290 TraceCheckUtils]: 28: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == remove_one_#t~mem22#1.offset; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,690 INFO L290 TraceCheckUtils]: 29: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,690 INFO L290 TraceCheckUtils]: 30: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,690 INFO L290 TraceCheckUtils]: 31: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,691 INFO L290 TraceCheckUtils]: 32: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,691 INFO L290 TraceCheckUtils]: 33: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,691 INFO L290 TraceCheckUtils]: 34: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,691 INFO L290 TraceCheckUtils]: 35: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,692 INFO L290 TraceCheckUtils]: 36: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~length~0#1 > 0); {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,692 INFO L290 TraceCheckUtils]: 37: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short36#1 := main_~z~0#1 < 7; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,692 INFO L290 TraceCheckUtils]: 38: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,693 INFO L290 TraceCheckUtils]: 39: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:21,693 INFO L290 TraceCheckUtils]: 40: Hoare triple {97364#(= |ULTIMATE.start_main_~i~0#1| 0)} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:21,693 INFO L290 TraceCheckUtils]: 41: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short29#1 := main_~i~0#1 < 3; {97369#|ULTIMATE.start_main_#t~short29#1|} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 42: Hoare triple {97369#|ULTIMATE.start_main_#t~short29#1|} assume !main_#t~short29#1; {97363#false} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 43: Hoare triple {97363#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {97363#false} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 44: Hoare triple {97363#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {97363#false} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 45: Hoare triple {97363#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {97363#false} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 46: Hoare triple {97363#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {97363#false} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 47: Hoare triple {97363#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {97363#false} is VALID [2022-02-20 23:49:21,694 INFO L290 TraceCheckUtils]: 48: Hoare triple {97363#false} assume !(main_~length~0#1 > 0); {97363#false} is VALID [2022-02-20 23:49:21,704 INFO L290 TraceCheckUtils]: 49: Hoare triple {97363#false} main_#res#1 := 0; {97363#false} is VALID [2022-02-20 23:49:21,704 INFO L290 TraceCheckUtils]: 50: Hoare triple {97363#false} assume !(#valid == main_old_#valid#1); {97363#false} is VALID [2022-02-20 23:49:21,705 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:21,705 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:21,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [733275694] [2022-02-20 23:49:21,705 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [733275694] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:49:21,705 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1792987707] [2022-02-20 23:49:21,705 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:21,705 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:49:21,705 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:49:21,724 INFO L229 MonitoredProcess]: Starting monitored process 5 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:49:21,781 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2022-02-20 23:49:21,834 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:21,835 INFO L263 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 23:49:21,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:21,850 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:49:22,025 INFO L290 TraceCheckUtils]: 0: Hoare triple {97362#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {97362#true} is VALID [2022-02-20 23:49:22,025 INFO L290 TraceCheckUtils]: 1: Hoare triple {97362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,026 INFO L290 TraceCheckUtils]: 2: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short29#1 := main_~i~0#1 < 3; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,026 INFO L290 TraceCheckUtils]: 3: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,026 INFO L290 TraceCheckUtils]: 4: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,027 INFO L290 TraceCheckUtils]: 5: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short31#1 := main_~y~1#1 < 4; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,027 INFO L290 TraceCheckUtils]: 6: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,027 INFO L290 TraceCheckUtils]: 7: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,028 INFO L290 TraceCheckUtils]: 8: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short36#1 := main_~z~0#1 < 7; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,028 INFO L290 TraceCheckUtils]: 9: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,028 INFO L290 TraceCheckUtils]: 10: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,028 INFO L272 TraceCheckUtils]: 11: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} call main_#t~ret37#1 := rand_end_point(); {97362#true} is VALID [2022-02-20 23:49:22,028 INFO L290 TraceCheckUtils]: 12: Hoare triple {97362#true} #res := ~unnamed1~0~LIST_BEG; {97362#true} is VALID [2022-02-20 23:49:22,028 INFO L290 TraceCheckUtils]: 13: Hoare triple {97362#true} assume true; {97362#true} is VALID [2022-02-20 23:49:22,029 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {97362#true} {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} #335#return; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,029 INFO L290 TraceCheckUtils]: 15: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,029 INFO L290 TraceCheckUtils]: 16: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,030 INFO L290 TraceCheckUtils]: 17: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,030 INFO L290 TraceCheckUtils]: 18: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,030 INFO L290 TraceCheckUtils]: 19: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,031 INFO L290 TraceCheckUtils]: 20: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,031 INFO L290 TraceCheckUtils]: 21: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is_empty_#res#1 := is_empty_~no_beg~0#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,031 INFO L290 TraceCheckUtils]: 22: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,032 INFO L290 TraceCheckUtils]: 23: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,032 INFO L290 TraceCheckUtils]: 24: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,032 INFO L290 TraceCheckUtils]: 25: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,032 INFO L290 TraceCheckUtils]: 26: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,033 INFO L290 TraceCheckUtils]: 27: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,033 INFO L290 TraceCheckUtils]: 28: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == remove_one_#t~mem22#1.offset; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,033 INFO L290 TraceCheckUtils]: 29: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,034 INFO L290 TraceCheckUtils]: 30: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,034 INFO L290 TraceCheckUtils]: 31: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,034 INFO L290 TraceCheckUtils]: 32: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,035 INFO L290 TraceCheckUtils]: 34: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !(main_~length~0#1 > 0); {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,036 INFO L290 TraceCheckUtils]: 37: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_#t~short36#1 := main_~z~0#1 < 7; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,036 INFO L290 TraceCheckUtils]: 38: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,036 INFO L290 TraceCheckUtils]: 39: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} is VALID [2022-02-20 23:49:22,037 INFO L290 TraceCheckUtils]: 40: Hoare triple {97376#(<= |ULTIMATE.start_main_~i~0#1| 0)} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,037 INFO L290 TraceCheckUtils]: 41: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short29#1 := main_~i~0#1 < 3; {97369#|ULTIMATE.start_main_#t~short29#1|} is VALID [2022-02-20 23:49:22,037 INFO L290 TraceCheckUtils]: 42: Hoare triple {97369#|ULTIMATE.start_main_#t~short29#1|} assume !main_#t~short29#1; {97363#false} is VALID [2022-02-20 23:49:22,037 INFO L290 TraceCheckUtils]: 43: Hoare triple {97363#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 44: Hoare triple {97363#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 45: Hoare triple {97363#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 46: Hoare triple {97363#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 47: Hoare triple {97363#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 48: Hoare triple {97363#false} assume !(main_~length~0#1 > 0); {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 49: Hoare triple {97363#false} main_#res#1 := 0; {97363#false} is VALID [2022-02-20 23:49:22,038 INFO L290 TraceCheckUtils]: 50: Hoare triple {97363#false} assume !(#valid == main_old_#valid#1); {97363#false} is VALID [2022-02-20 23:49:22,039 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:22,039 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:49:22,216 INFO L290 TraceCheckUtils]: 50: Hoare triple {97363#false} assume !(#valid == main_old_#valid#1); {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 49: Hoare triple {97363#false} main_#res#1 := 0; {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 48: Hoare triple {97363#false} assume !(main_~length~0#1 > 0); {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 47: Hoare triple {97363#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 46: Hoare triple {97363#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 45: Hoare triple {97363#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 44: Hoare triple {97363#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {97363#false} is VALID [2022-02-20 23:49:22,217 INFO L290 TraceCheckUtils]: 43: Hoare triple {97363#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {97363#false} is VALID [2022-02-20 23:49:22,218 INFO L290 TraceCheckUtils]: 42: Hoare triple {97369#|ULTIMATE.start_main_#t~short29#1|} assume !main_#t~short29#1; {97363#false} is VALID [2022-02-20 23:49:22,218 INFO L290 TraceCheckUtils]: 41: Hoare triple {97551#(< |ULTIMATE.start_main_~i~0#1| 3)} main_#t~short29#1 := main_~i~0#1 < 3; {97369#|ULTIMATE.start_main_#t~short29#1|} is VALID [2022-02-20 23:49:22,218 INFO L290 TraceCheckUtils]: 40: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {97551#(< |ULTIMATE.start_main_~i~0#1| 3)} is VALID [2022-02-20 23:49:22,219 INFO L290 TraceCheckUtils]: 39: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,219 INFO L290 TraceCheckUtils]: 38: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,219 INFO L290 TraceCheckUtils]: 37: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short36#1 := main_~z~0#1 < 7; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,220 INFO L290 TraceCheckUtils]: 36: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(main_~length~0#1 > 0); {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,220 INFO L290 TraceCheckUtils]: 35: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,220 INFO L290 TraceCheckUtils]: 34: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,221 INFO L290 TraceCheckUtils]: 33: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,221 INFO L290 TraceCheckUtils]: 32: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,221 INFO L290 TraceCheckUtils]: 31: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,221 INFO L290 TraceCheckUtils]: 30: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,222 INFO L290 TraceCheckUtils]: 29: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,222 INFO L290 TraceCheckUtils]: 28: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume 0 == remove_one_#t~mem22#1.offset; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,222 INFO L290 TraceCheckUtils]: 27: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,223 INFO L290 TraceCheckUtils]: 26: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,223 INFO L290 TraceCheckUtils]: 25: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,223 INFO L290 TraceCheckUtils]: 24: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,223 INFO L290 TraceCheckUtils]: 23: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,224 INFO L290 TraceCheckUtils]: 22: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,224 INFO L290 TraceCheckUtils]: 21: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is_empty_#res#1 := is_empty_~no_beg~0#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,224 INFO L290 TraceCheckUtils]: 20: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,225 INFO L290 TraceCheckUtils]: 18: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,225 INFO L290 TraceCheckUtils]: 17: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,226 INFO L290 TraceCheckUtils]: 15: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,226 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {97362#true} {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} #335#return; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,226 INFO L290 TraceCheckUtils]: 13: Hoare triple {97362#true} assume true; {97362#true} is VALID [2022-02-20 23:49:22,226 INFO L290 TraceCheckUtils]: 12: Hoare triple {97362#true} #res := ~unnamed1~0~LIST_BEG; {97362#true} is VALID [2022-02-20 23:49:22,227 INFO L272 TraceCheckUtils]: 11: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} call main_#t~ret37#1 := rand_end_point(); {97362#true} is VALID [2022-02-20 23:49:22,227 INFO L290 TraceCheckUtils]: 10: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,227 INFO L290 TraceCheckUtils]: 9: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,227 INFO L290 TraceCheckUtils]: 8: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short36#1 := main_~z~0#1 < 7; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,228 INFO L290 TraceCheckUtils]: 7: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,228 INFO L290 TraceCheckUtils]: 6: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,228 INFO L290 TraceCheckUtils]: 5: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short31#1 := main_~y~1#1 < 4; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,229 INFO L290 TraceCheckUtils]: 4: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,229 INFO L290 TraceCheckUtils]: 3: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,229 INFO L290 TraceCheckUtils]: 2: Hoare triple {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} main_#t~short29#1 := main_~i~0#1 < 3; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,229 INFO L290 TraceCheckUtils]: 1: Hoare triple {97362#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {97368#(<= |ULTIMATE.start_main_~i~0#1| 1)} is VALID [2022-02-20 23:49:22,230 INFO L290 TraceCheckUtils]: 0: Hoare triple {97362#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {97362#true} is VALID [2022-02-20 23:49:22,230 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 23:49:22,230 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1792987707] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:49:22,230 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:49:22,230 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 7 [2022-02-20 23:49:22,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1280960331] [2022-02-20 23:49:22,231 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:49:22,232 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-02-20 23:49:22,232 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:22,232 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:22,335 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:49:22,335 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:49:22,335 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:22,335 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:49:22,335 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:49:22,336 INFO L87 Difference]: Start difference. First operand 1926 states and 2623 transitions. Second operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:24,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:24,483 INFO L93 Difference]: Finished difference Result 6791 states and 9240 transitions. [2022-02-20 23:49:24,484 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:49:24,484 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Word has length 51 [2022-02-20 23:49:24,484 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:24,484 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:24,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 616 transitions. [2022-02-20 23:49:24,487 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:24,489 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 616 transitions. [2022-02-20 23:49:24,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 616 transitions. [2022-02-20 23:49:24,848 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 616 edges. 616 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:26,303 INFO L225 Difference]: With dead ends: 6791 [2022-02-20 23:49:26,303 INFO L226 Difference]: Without dead ends: 6791 [2022-02-20 23:49:26,303 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 101 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:26,304 INFO L933 BasicCegarLoop]: 261 mSDtfsCounter, 563 mSDsluCounter, 851 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 567 SdHoareTripleChecker+Valid, 1112 SdHoareTripleChecker+Invalid, 32 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:26,304 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [567 Valid, 1112 Invalid, 32 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:26,307 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 6791 states. [2022-02-20 23:49:26,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 6791 to 4827. [2022-02-20 23:49:26,348 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:26,353 INFO L82 GeneralOperation]: Start isEquivalent. First operand 6791 states. Second operand has 4827 states, 4629 states have (on average 1.3687621516526247) internal successors, (6336), 4677 states have internal predecessors, (6336), 149 states have call successors, (149), 10 states have call predecessors, (149), 10 states have return successors, (149), 139 states have call predecessors, (149), 149 states have call successors, (149) [2022-02-20 23:49:26,357 INFO L74 IsIncluded]: Start isIncluded. First operand 6791 states. Second operand has 4827 states, 4629 states have (on average 1.3687621516526247) internal successors, (6336), 4677 states have internal predecessors, (6336), 149 states have call successors, (149), 10 states have call predecessors, (149), 10 states have return successors, (149), 139 states have call predecessors, (149), 149 states have call successors, (149) [2022-02-20 23:49:26,361 INFO L87 Difference]: Start difference. First operand 6791 states. Second operand has 4827 states, 4629 states have (on average 1.3687621516526247) internal successors, (6336), 4677 states have internal predecessors, (6336), 149 states have call successors, (149), 10 states have call predecessors, (149), 10 states have return successors, (149), 139 states have call predecessors, (149), 149 states have call successors, (149) [2022-02-20 23:49:27,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:27,897 INFO L93 Difference]: Finished difference Result 6791 states and 9240 transitions. [2022-02-20 23:49:27,897 INFO L276 IsEmpty]: Start isEmpty. Operand 6791 states and 9240 transitions. [2022-02-20 23:49:27,904 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:27,904 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:27,908 INFO L74 IsIncluded]: Start isIncluded. First operand has 4827 states, 4629 states have (on average 1.3687621516526247) internal successors, (6336), 4677 states have internal predecessors, (6336), 149 states have call successors, (149), 10 states have call predecessors, (149), 10 states have return successors, (149), 139 states have call predecessors, (149), 149 states have call successors, (149) Second operand 6791 states. [2022-02-20 23:49:27,913 INFO L87 Difference]: Start difference. First operand has 4827 states, 4629 states have (on average 1.3687621516526247) internal successors, (6336), 4677 states have internal predecessors, (6336), 149 states have call successors, (149), 10 states have call predecessors, (149), 10 states have return successors, (149), 139 states have call predecessors, (149), 149 states have call successors, (149) Second operand 6791 states. [2022-02-20 23:49:29,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:29,517 INFO L93 Difference]: Finished difference Result 6791 states and 9240 transitions. [2022-02-20 23:49:29,517 INFO L276 IsEmpty]: Start isEmpty. Operand 6791 states and 9240 transitions. [2022-02-20 23:49:29,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:29,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:29,524 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:29,524 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:29,529 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4827 states, 4629 states have (on average 1.3687621516526247) internal successors, (6336), 4677 states have internal predecessors, (6336), 149 states have call successors, (149), 10 states have call predecessors, (149), 10 states have return successors, (149), 139 states have call predecessors, (149), 149 states have call successors, (149) [2022-02-20 23:49:30,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4827 states to 4827 states and 6634 transitions. [2022-02-20 23:49:30,336 INFO L78 Accepts]: Start accepts. Automaton has 4827 states and 6634 transitions. Word has length 51 [2022-02-20 23:49:30,336 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:30,336 INFO L470 AbstractCegarLoop]: Abstraction has 4827 states and 6634 transitions. [2022-02-20 23:49:30,336 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 16.571428571428573) internal successors, (116), 7 states have internal predecessors, (116), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 23:49:30,336 INFO L276 IsEmpty]: Start isEmpty. Operand 4827 states and 6634 transitions. [2022-02-20 23:49:30,337 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:49:30,337 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:30,337 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:30,354 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2022-02-20 23:49:30,537 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2022-02-20 23:49:30,538 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr66ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:30,538 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:30,538 INFO L85 PathProgramCache]: Analyzing trace with hash -735356361, now seen corresponding path program 1 times [2022-02-20 23:49:30,538 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:30,538 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [717743444] [2022-02-20 23:49:30,538 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:30,539 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:30,559 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,577 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 11 [2022-02-20 23:49:30,578 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:30,579 INFO L290 TraceCheckUtils]: 0: Hoare triple {122880#true} #res := ~unnamed1~0~LIST_BEG; {122880#true} is VALID [2022-02-20 23:49:30,579 INFO L290 TraceCheckUtils]: 1: Hoare triple {122880#true} assume true; {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {122880#true} {122880#true} #335#return; {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L290 TraceCheckUtils]: 0: Hoare triple {122880#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L290 TraceCheckUtils]: 1: Hoare triple {122880#true} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L290 TraceCheckUtils]: 2: Hoare triple {122880#true} main_#t~short29#1 := main_~i~0#1 < 3; {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L290 TraceCheckUtils]: 3: Hoare triple {122880#true} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L290 TraceCheckUtils]: 4: Hoare triple {122880#true} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {122880#true} is VALID [2022-02-20 23:49:30,580 INFO L290 TraceCheckUtils]: 5: Hoare triple {122880#true} main_#t~short31#1 := main_~y~1#1 < 4; {122880#true} is VALID [2022-02-20 23:49:30,599 INFO L290 TraceCheckUtils]: 6: Hoare triple {122880#true} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {122880#true} is VALID [2022-02-20 23:49:30,599 INFO L290 TraceCheckUtils]: 7: Hoare triple {122880#true} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {122880#true} is VALID [2022-02-20 23:49:30,599 INFO L290 TraceCheckUtils]: 8: Hoare triple {122880#true} main_#t~short36#1 := main_~z~0#1 < 7; {122880#true} is VALID [2022-02-20 23:49:30,599 INFO L290 TraceCheckUtils]: 9: Hoare triple {122880#true} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {122880#true} is VALID [2022-02-20 23:49:30,599 INFO L290 TraceCheckUtils]: 10: Hoare triple {122880#true} assume !!main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L272 TraceCheckUtils]: 11: Hoare triple {122880#true} call main_#t~ret37#1 := rand_end_point(); {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L290 TraceCheckUtils]: 12: Hoare triple {122880#true} #res := ~unnamed1~0~LIST_BEG; {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L290 TraceCheckUtils]: 13: Hoare triple {122880#true} assume true; {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L284 TraceCheckUtils]: 14: Hoare quadruple {122880#true} {122880#true} #335#return; {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L290 TraceCheckUtils]: 15: Hoare triple {122880#true} assume -2147483648 <= main_#t~ret37#1 && main_#t~ret37#1 <= 2147483647;assume { :begin_inline_remove_one } true;remove_one_#in~list#1.base, remove_one_#in~list#1.offset, remove_one_#in~from#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret37#1;havoc remove_one_#t~ret19#1, remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset, remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset, remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset, remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset, remove_one_#t~ite24#1, remove_one_#t~ite25#1, remove_one_#t~mem26#1.base, remove_one_#t~mem26#1.offset, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_~list#1.base, remove_one_~list#1.offset, remove_one_~from#1, remove_one_~next_field~0#1, remove_one_~term_field~1#1, remove_one_~item~2#1.base, remove_one_~item~2#1.offset, remove_one_~next~0#1.base, remove_one_~next~0#1.offset;remove_one_~list#1.base, remove_one_~list#1.offset := remove_one_#in~list#1.base, remove_one_#in~list#1.offset;remove_one_~from#1 := remove_one_#in~from#1;assume { :begin_inline_is_empty } true;is_empty_#in~list#1.base, is_empty_#in~list#1.offset := remove_one_~list#1.base, remove_one_~list#1.offset;havoc is_empty_#res#1;havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset, is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset, is_empty_~list#1.base, is_empty_~list#1.offset, is_empty_~no_beg~0#1, is_empty_~no_end~0#1;is_empty_~list#1.base, is_empty_~list#1.offset := is_empty_#in~list#1.base, is_empty_#in~list#1.offset; {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L290 TraceCheckUtils]: 16: Hoare triple {122880#true} SUMMARY for call is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L659 {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L290 TraceCheckUtils]: 17: Hoare triple {122880#true} is_empty_~no_beg~0#1 := (if is_empty_#t~mem3#1.base == 0 && is_empty_#t~mem3#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem3#1.base, is_empty_#t~mem3#1.offset; {122880#true} is VALID [2022-02-20 23:49:30,600 INFO L290 TraceCheckUtils]: 18: Hoare triple {122880#true} SUMMARY for call is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset := read~$Pointer$(is_empty_~list#1.base, is_empty_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L660 {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 19: Hoare triple {122880#true} is_empty_~no_end~0#1 := (if is_empty_#t~mem4#1.base == 0 && is_empty_#t~mem4#1.offset == 0 then 1 else 0);havoc is_empty_#t~mem4#1.base, is_empty_#t~mem4#1.offset; {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 20: Hoare triple {122880#true} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 21: Hoare triple {122880#true} is_empty_#res#1 := is_empty_~no_beg~0#1; {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 22: Hoare triple {122880#true} remove_one_#t~ret19#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret19#1 && remove_one_#t~ret19#1 <= 2147483647; {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 23: Hoare triple {122880#true} assume !(0 != remove_one_#t~ret19#1);havoc remove_one_#t~ret19#1; {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 24: Hoare triple {122880#true} SUMMARY for call remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L713 {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 25: Hoare triple {122880#true} SUMMARY for call remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L713-1 {122880#true} is VALID [2022-02-20 23:49:30,601 INFO L290 TraceCheckUtils]: 26: Hoare triple {122880#true} assume remove_one_#t~mem20#1.base == remove_one_#t~mem21#1.base && remove_one_#t~mem20#1.offset == remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem20#1.base, remove_one_#t~mem20#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset; {122880#true} is VALID [2022-02-20 23:49:30,602 INFO L290 TraceCheckUtils]: 27: Hoare triple {122880#true} SUMMARY for call remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L714 {122880#true} is VALID [2022-02-20 23:49:30,602 INFO L290 TraceCheckUtils]: 28: Hoare triple {122880#true} assume 0 == remove_one_#t~mem22#1.offset; {122880#true} is VALID [2022-02-20 23:49:30,602 INFO L290 TraceCheckUtils]: 29: Hoare triple {122880#true} assume remove_one_#t~mem22#1.base < #StackHeapBarrier; {122880#true} is VALID [2022-02-20 23:49:30,602 INFO L290 TraceCheckUtils]: 30: Hoare triple {122880#true} assume 0 == remove_one_#t~mem22#1.base || 1 == #valid[remove_one_#t~mem22#1.base];call ULTIMATE.dealloc(remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset;assume { :begin_inline_#Ultimate.C_memset } true;#Ultimate.C_memset_#ptr#1.base, #Ultimate.C_memset_#ptr#1.offset, #Ultimate.C_memset_#value#1, #Ultimate.C_memset_#amount#1 := remove_one_~list#1.base, remove_one_~list#1.offset, 0, 8; {122885#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} is VALID [2022-02-20 23:49:30,603 INFO L290 TraceCheckUtils]: 31: Hoare triple {122885#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {122885#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} is VALID [2022-02-20 23:49:30,603 INFO L290 TraceCheckUtils]: 32: Hoare triple {122885#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base];assume #Ultimate.C_memset_#amount#1 + #Ultimate.C_memset_#ptr#1.offset <= #length[#Ultimate.C_memset_#ptr#1.base] && 0 <= #Ultimate.C_memset_#ptr#1.offset;havoc #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;havoc #Ultimate.C_memset_#t~loopctr46#1;#Ultimate.C_memset_#t~loopctr46#1 := 0; {122886#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr46#1| 0) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 33: Hoare triple {122886#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr46#1| 0) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} assume !(#Ultimate.C_memset_#t~loopctr46#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {122881#false} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 34: Hoare triple {122881#false} assume #Ultimate.C_memset_#res#1.base == #Ultimate.C_memset_#ptr#1.base && #Ultimate.C_memset_#res#1.offset == #Ultimate.C_memset_#ptr#1.offset;remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset := #Ultimate.C_memset_#res#1.base, #Ultimate.C_memset_#res#1.offset;assume { :end_inline_#Ultimate.C_memset } true;havoc remove_one_#t~memset~res23#1.base, remove_one_#t~memset~res23#1.offset; {122881#false} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 35: Hoare triple {122881#false} assume { :end_inline_remove_one } true;havoc main_#t~ret37#1;main_#t~post38#1 := main_~z~0#1;main_~z~0#1 := 1 + main_#t~post38#1;havoc main_#t~post38#1; {122881#false} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 36: Hoare triple {122881#false} assume !(main_~length~0#1 > 0); {122881#false} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 37: Hoare triple {122881#false} main_#t~short36#1 := main_~z~0#1 < 7; {122881#false} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 38: Hoare triple {122881#false} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {122881#false} is VALID [2022-02-20 23:49:30,604 INFO L290 TraceCheckUtils]: 39: Hoare triple {122881#false} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 40: Hoare triple {122881#false} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 41: Hoare triple {122881#false} main_#t~short29#1 := main_~i~0#1 < 3; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 42: Hoare triple {122881#false} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 43: Hoare triple {122881#false} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 44: Hoare triple {122881#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 45: Hoare triple {122881#false} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 46: Hoare triple {122881#false} SUMMARY for call main_#t~mem42#1.base, main_#t~mem42#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L759-2 {122881#false} is VALID [2022-02-20 23:49:30,605 INFO L290 TraceCheckUtils]: 47: Hoare triple {122881#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem42#1.base, main_#t~mem42#1.offset;havoc main_#t~mem42#1.base, main_#t~mem42#1.offset; {122881#false} is VALID [2022-02-20 23:49:30,606 INFO L290 TraceCheckUtils]: 48: Hoare triple {122881#false} assume !(main_~length~0#1 > 0); {122881#false} is VALID [2022-02-20 23:49:30,606 INFO L290 TraceCheckUtils]: 49: Hoare triple {122881#false} main_#res#1 := 0; {122881#false} is VALID [2022-02-20 23:49:30,606 INFO L290 TraceCheckUtils]: 50: Hoare triple {122881#false} assume !(#valid == main_old_#valid#1); {122881#false} is VALID [2022-02-20 23:49:30,606 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:30,606 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:30,606 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [717743444] [2022-02-20 23:49:30,606 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [717743444] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:30,607 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:30,607 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:49:30,607 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [855376227] [2022-02-20 23:49:30,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:30,607 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-02-20 23:49:30,608 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:30,608 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:30,637 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:49:30,638 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:49:30,638 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:30,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:49:30,638 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:49:30,638 INFO L87 Difference]: Start difference. First operand 4827 states and 6634 transitions. Second operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:31,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:31,857 INFO L93 Difference]: Finished difference Result 5546 states and 7718 transitions. [2022-02-20 23:49:31,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:49:31,858 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-02-20 23:49:31,858 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:49:31,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:31,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2022-02-20 23:49:31,860 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:31,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 317 transitions. [2022-02-20 23:49:31,861 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 317 transitions. [2022-02-20 23:49:32,060 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 317 edges. 317 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:49:32,967 INFO L225 Difference]: With dead ends: 5546 [2022-02-20 23:49:32,967 INFO L226 Difference]: Without dead ends: 5546 [2022-02-20 23:49:32,967 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 4 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:49:32,968 INFO L933 BasicCegarLoop]: 277 mSDtfsCounter, 153 mSDsluCounter, 307 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 584 SdHoareTripleChecker+Invalid, 12 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:49:32,968 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [155 Valid, 584 Invalid, 12 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:49:32,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5546 states. [2022-02-20 23:49:33,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5546 to 4588. [2022-02-20 23:49:33,009 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:49:33,014 INFO L82 GeneralOperation]: Start isEquivalent. First operand 5546 states. Second operand has 4588 states, 4404 states have (on average 1.3771571298819256) internal successors, (6065), 4452 states have internal predecessors, (6065), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 126 states have call predecessors, (136), 136 states have call successors, (136) [2022-02-20 23:49:33,018 INFO L74 IsIncluded]: Start isIncluded. First operand 5546 states. Second operand has 4588 states, 4404 states have (on average 1.3771571298819256) internal successors, (6065), 4452 states have internal predecessors, (6065), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 126 states have call predecessors, (136), 136 states have call successors, (136) [2022-02-20 23:49:33,022 INFO L87 Difference]: Start difference. First operand 5546 states. Second operand has 4588 states, 4404 states have (on average 1.3771571298819256) internal successors, (6065), 4452 states have internal predecessors, (6065), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 126 states have call predecessors, (136), 136 states have call successors, (136) [2022-02-20 23:49:33,916 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:33,917 INFO L93 Difference]: Finished difference Result 5546 states and 7718 transitions. [2022-02-20 23:49:33,917 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 7718 transitions. [2022-02-20 23:49:33,922 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:33,922 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:33,926 INFO L74 IsIncluded]: Start isIncluded. First operand has 4588 states, 4404 states have (on average 1.3771571298819256) internal successors, (6065), 4452 states have internal predecessors, (6065), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 126 states have call predecessors, (136), 136 states have call successors, (136) Second operand 5546 states. [2022-02-20 23:49:33,930 INFO L87 Difference]: Start difference. First operand has 4588 states, 4404 states have (on average 1.3771571298819256) internal successors, (6065), 4452 states have internal predecessors, (6065), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 126 states have call predecessors, (136), 136 states have call successors, (136) Second operand 5546 states. [2022-02-20 23:49:34,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:49:34,841 INFO L93 Difference]: Finished difference Result 5546 states and 7718 transitions. [2022-02-20 23:49:34,841 INFO L276 IsEmpty]: Start isEmpty. Operand 5546 states and 7718 transitions. [2022-02-20 23:49:34,846 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:49:34,846 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:49:34,846 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:49:34,846 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:49:34,851 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4588 states, 4404 states have (on average 1.3771571298819256) internal successors, (6065), 4452 states have internal predecessors, (6065), 136 states have call successors, (136), 9 states have call predecessors, (136), 9 states have return successors, (136), 126 states have call predecessors, (136), 136 states have call successors, (136) [2022-02-20 23:49:35,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4588 states to 4588 states and 6337 transitions. [2022-02-20 23:49:35,543 INFO L78 Accepts]: Start accepts. Automaton has 4588 states and 6337 transitions. Word has length 51 [2022-02-20 23:49:35,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:49:35,543 INFO L470 AbstractCegarLoop]: Abstraction has 4588 states and 6337 transitions. [2022-02-20 23:49:35,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 12.25) internal successors, (49), 4 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:35,543 INFO L276 IsEmpty]: Start isEmpty. Operand 4588 states and 6337 transitions. [2022-02-20 23:49:35,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 52 [2022-02-20 23:49:35,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:49:35,544 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:49:35,544 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-20 23:49:35,544 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 63 more)] === [2022-02-20 23:49:35,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:49:35,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1366525278, now seen corresponding path program 1 times [2022-02-20 23:49:35,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:49:35,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1615854755] [2022-02-20 23:49:35,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:49:35,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:49:35,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:35,746 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:49:35,748 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:49:35,762 INFO L290 TraceCheckUtils]: 0: Hoare triple {144115#true} #res := ~unnamed1~0~LIST_BEG; {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:35,762 INFO L290 TraceCheckUtils]: 1: Hoare triple {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:35,763 INFO L284 TraceCheckUtils]: 2: Hoare quadruple {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {144117#(<= 0 |~#list~0.offset|)} #333#return; {144121#(and (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} is VALID [2022-02-20 23:49:35,764 INFO L290 TraceCheckUtils]: 0: Hoare triple {144115#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);~#list~0.base, ~#list~0.offset := 3, 0;call #Ultimate.allocInit(8, 3);call write~init~$Pointer$(0, 0, ~#list~0.base, ~#list~0.offset, 4);call write~init~$Pointer$(0, 0, ~#list~0.base, 4 + ~#list~0.offset, 4); {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,764 INFO L290 TraceCheckUtils]: 1: Hoare triple {144117#(<= 0 |~#list~0.offset|)} assume { :end_inline_ULTIMATE.init } true;main_old_#valid#1 := #valid;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret32#1, main_#t~post33#1, main_#t~post34#1, main_#t~nondet30#1, main_#t~short31#1, main_#t~ret37#1, main_#t~post38#1, main_#t~post39#1, main_#t~nondet35#1, main_#t~short36#1, main_#t~post40#1, main_#t~nondet28#1, main_#t~short29#1, main_#t~nondet41#1, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~post44#1, main_~next~1#1.base, main_~next~1#1.offset, main_~i~0#1, main_~y~1#1, main_~z~0#1, main_~length~0#1, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset;main_~i~0#1 := 0;main_~y~1#1 := 0;main_~z~0#1 := 0;main_~length~0#1 := 0; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,765 INFO L290 TraceCheckUtils]: 2: Hoare triple {144117#(<= 0 |~#list~0.offset|)} main_#t~short29#1 := main_~i~0#1 < 3; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,765 INFO L290 TraceCheckUtils]: 3: Hoare triple {144117#(<= 0 |~#list~0.offset|)} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,765 INFO L290 TraceCheckUtils]: 4: Hoare triple {144117#(<= 0 |~#list~0.offset|)} assume !!main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,766 INFO L290 TraceCheckUtils]: 5: Hoare triple {144117#(<= 0 |~#list~0.offset|)} main_#t~short31#1 := main_~y~1#1 < 4; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,766 INFO L290 TraceCheckUtils]: 6: Hoare triple {144117#(<= 0 |~#list~0.offset|)} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,766 INFO L290 TraceCheckUtils]: 7: Hoare triple {144117#(<= 0 |~#list~0.offset|)} assume !!main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {144117#(<= 0 |~#list~0.offset|)} is VALID [2022-02-20 23:49:35,766 INFO L272 TraceCheckUtils]: 8: Hoare triple {144117#(<= 0 |~#list~0.offset|)} call main_#t~ret32#1 := rand_end_point(); {144115#true} is VALID [2022-02-20 23:49:35,767 INFO L290 TraceCheckUtils]: 9: Hoare triple {144115#true} #res := ~unnamed1~0~LIST_BEG; {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:35,767 INFO L290 TraceCheckUtils]: 10: Hoare triple {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:49:35,768 INFO L284 TraceCheckUtils]: 11: Hoare quadruple {144127#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {144117#(<= 0 |~#list~0.offset|)} #333#return; {144121#(and (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} is VALID [2022-02-20 23:49:35,769 INFO L290 TraceCheckUtils]: 12: Hoare triple {144121#(and (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} assume -2147483648 <= main_#t~ret32#1 && main_#t~ret32#1 <= 2147483647;assume { :begin_inline_append_one } true;append_one_#in~list#1.base, append_one_#in~list#1.offset, append_one_#in~to#1 := ~#list~0.base, ~#list~0.offset, main_#t~ret32#1;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset, append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_~list#1.base, append_one_~list#1.offset, append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset, append_one_~item~1#1.base, append_one_~item~1#1.offset;append_one_~list#1.base, append_one_~list#1.offset := append_one_#in~list#1.base, append_one_#in~list#1.offset;append_one_~to#1 := append_one_#in~to#1;append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset := append_one_~list#1.base, append_one_~list#1.offset + 4 * append_one_~to#1;assume { :begin_inline_create_item } true;create_item_#in~at#1, create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset := append_one_~to#1, append_one_~cursor~0#1.base, append_one_~cursor~0#1.offset;havoc create_item_#res#1.base, create_item_#res#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset, create_item_#t~switch6#1, create_item_#t~mem11#1.base, create_item_#t~mem11#1.offset, create_item_#t~post12#1, create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset, create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset, create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset, create_item_#t~short10#1, create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset, create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_~at#1, create_item_~cursor#1.base, create_item_~cursor#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~term_field~0#1, create_item_~link_field~0#1, create_item_~y~0#1, create_item_~h~0#1, create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~head~0#1.base, create_item_~head~0#1.offset;create_item_~at#1 := create_item_#in~at#1;create_item_~cursor#1.base, create_item_~cursor#1.offset := create_item_#in~cursor#1.base, create_item_#in~cursor#1.offset;call create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset := #Ultimate.allocOnHeap(265);create_item_~item~0#1.base, create_item_~item~0#1.offset := create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset;havoc create_item_#t~malloc5#1.base, create_item_#t~malloc5#1.offset; {144122#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |ULTIMATE.start_create_item_~at#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* |ULTIMATE.start_create_item_~at#1| 4))) (= (+ (* (- 1) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:35,769 INFO L290 TraceCheckUtils]: 13: Hoare triple {144122#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |ULTIMATE.start_create_item_~at#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* |ULTIMATE.start_create_item_~at#1| 4))) (= (+ (* (- 1) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|) 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {144122#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |ULTIMATE.start_create_item_~at#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* |ULTIMATE.start_create_item_~at#1| 4))) (= (+ (* (- 1) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:49:35,770 INFO L290 TraceCheckUtils]: 14: Hoare triple {144122#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (<= |ULTIMATE.start_create_item_~at#1| ~unnamed1~0~LIST_BEG) (<= (* ~unnamed1~0~LIST_BEG 4) (+ |~#list~0.offset| (* |ULTIMATE.start_create_item_~at#1| 4))) (= (+ (* (- 1) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|) 0))} havoc create_item_~term_field~0#1;havoc create_item_~link_field~0#1;create_item_#t~switch6#1 := create_item_~at#1 == ~unnamed1~0~LIST_BEG; {144123#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= (+ (* (- 1) (select |#length| |~#list~0.base|)) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) 0) (= (+ (* (- 1) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|) 0) (<= 0 |~#list~0.offset|)))} is VALID [2022-02-20 23:49:35,770 INFO L290 TraceCheckUtils]: 15: Hoare triple {144123#(or (not |ULTIMATE.start_create_item_#t~switch6#1|) (and (= (+ (* (- 1) (select |#length| |~#list~0.base|)) (select |#length| |ULTIMATE.start_append_one_~list#1.base|)) 0) (= (+ (* (- 1) |ULTIMATE.start_append_one_~list#1.offset|) |~#list~0.offset|) 0) (<= 0 |~#list~0.offset|)))} assume create_item_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,771 INFO L290 TraceCheckUtils]: 16: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} havoc create_item_#t~switch6#1;create_item_~y~0#1 := 1;create_item_~h~0#1 := 2; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,771 INFO L290 TraceCheckUtils]: 17: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L686-2 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,772 INFO L290 TraceCheckUtils]: 18: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,772 INFO L290 TraceCheckUtils]: 19: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !create_item_#t~short10#1; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,773 INFO L290 TraceCheckUtils]: 20: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_#t~short10#1 && 0 != create_item_~y~0#1);havoc create_item_#t~mem8#1.base, create_item_#t~mem8#1.offset;havoc create_item_#t~mem7#1.base, create_item_#t~mem7#1.offset;havoc create_item_#t~mem9#1.base, create_item_#t~mem9#1.offset;havoc create_item_#t~short10#1; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,773 INFO L290 TraceCheckUtils]: 21: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L683-9 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,774 INFO L290 TraceCheckUtils]: 22: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset;havoc create_item_#t~mem13#1.base, create_item_#t~mem13#1.offset; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,774 INFO L290 TraceCheckUtils]: 23: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_~link~0#1.base, create_item_~link~0#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~link_field~0#1, 4); srcloc: L691 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,775 INFO L290 TraceCheckUtils]: 24: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset := 0, 0; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,776 INFO L290 TraceCheckUtils]: 25: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L692-3 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,776 INFO L290 TraceCheckUtils]: 26: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} havoc create_item_#t~ite15#1.base, create_item_#t~ite15#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,777 INFO L290 TraceCheckUtils]: 27: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~int(0, create_item_~item~0#1.base, 8 + create_item_~item~0#1.offset, 1); srcloc: L693 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,777 INFO L290 TraceCheckUtils]: 28: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_~head~0#1.base, create_item_~head~0#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,777 INFO L290 TraceCheckUtils]: 29: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,778 INFO L290 TraceCheckUtils]: 30: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call write~$Pointer$(create_item_~head~0#1.base, create_item_~head~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L695-1 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,778 INFO L290 TraceCheckUtils]: 31: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~head~0#1.base, create_item_~head~0#1.offset; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,779 INFO L290 TraceCheckUtils]: 32: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset := create_item_#res#1.base, create_item_#res#1.offset;assume { :end_inline_create_item } true;append_one_~item~1#1.base, append_one_~item~1#1.offset := append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset;havoc append_one_#t~ret16#1.base, append_one_#t~ret16#1.offset; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,779 INFO L290 TraceCheckUtils]: 33: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L704 {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,780 INFO L290 TraceCheckUtils]: 34: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem17#1.base && 0 == append_one_#t~mem17#1.offset);havoc append_one_#t~mem17#1.base, append_one_#t~mem17#1.offset; {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,780 INFO L290 TraceCheckUtils]: 35: Hoare triple {144124#(and (= (select |#length| |ULTIMATE.start_append_one_~list#1.base|) (select |#length| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| |~#list~0.offset|) (<= 0 |~#list~0.offset|))} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L704-2 {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,781 INFO L290 TraceCheckUtils]: 36: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !(0 == append_one_#t~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,781 INFO L290 TraceCheckUtils]: 37: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume { :end_inline_append_one } true;havoc main_#t~ret32#1;main_#t~post33#1 := main_~y~1#1;main_~y~1#1 := 1 + main_#t~post33#1;havoc main_#t~post33#1;main_#t~post34#1 := main_~length~0#1;main_~length~0#1 := 1 + main_#t~post34#1;havoc main_#t~post34#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,782 INFO L290 TraceCheckUtils]: 38: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} main_#t~short31#1 := main_~y~1#1 < 4; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,782 INFO L290 TraceCheckUtils]: 39: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume main_#t~short31#1;assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647;main_#t~short31#1 := 0 != main_#t~nondet30#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,783 INFO L290 TraceCheckUtils]: 40: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !main_#t~short31#1;havoc main_#t~nondet30#1;havoc main_#t~short31#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,783 INFO L290 TraceCheckUtils]: 41: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} main_#t~short36#1 := main_~z~0#1 < 7; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,784 INFO L290 TraceCheckUtils]: 42: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume main_#t~short36#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647;main_#t~short36#1 := 0 != main_#t~nondet35#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,784 INFO L290 TraceCheckUtils]: 43: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !main_#t~short36#1;havoc main_#t~nondet35#1;havoc main_#t~short36#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,784 INFO L290 TraceCheckUtils]: 44: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} main_~y~1#1 := 0;main_~z~0#1 := 0;main_#t~post40#1 := main_~i~0#1;main_~i~0#1 := 1 + main_#t~post40#1;havoc main_#t~post40#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,785 INFO L290 TraceCheckUtils]: 45: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} main_#t~short29#1 := main_~i~0#1 < 3; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,786 INFO L290 TraceCheckUtils]: 46: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume main_#t~short29#1;assume -2147483648 <= main_#t~nondet28#1 && main_#t~nondet28#1 <= 2147483647;main_#t~short29#1 := 0 != main_#t~nondet28#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,786 INFO L290 TraceCheckUtils]: 47: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume !main_#t~short29#1;havoc main_#t~nondet28#1;havoc main_#t~short29#1; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,786 INFO L290 TraceCheckUtils]: 48: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet41#1 && main_#t~nondet41#1 <= 2147483647; {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} is VALID [2022-02-20 23:49:35,787 INFO L290 TraceCheckUtils]: 49: Hoare triple {144125#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) |~#list~0.offset| 4) (select |#length| |~#list~0.base|)) (<= 0 |~#list~0.offset|))} assume 0 != main_#t~nondet41#1;havoc main_#t~nondet41#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {144126#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} is VALID [2022-02-20 23:49:35,787 INFO L290 TraceCheckUtils]: 50: Hoare triple {144126#(and (<= (+ (* ~unnamed2~0~ITEM_NEXT 4) (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset| 4) (+ (select |#length| |~#list~0.base|) (* ~unnamed1~0~LIST_BEG 4))) (<= (* ~unnamed1~0~LIST_BEG 4) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)))} assume !(4 + (~#list~0.offset + 4 * main_~end_point~0#1) <= #length[~#list~0.base] && 0 <= ~#list~0.offset + 4 * main_~end_point~0#1); {144116#false} is VALID [2022-02-20 23:49:35,788 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:49:35,788 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:49:35,788 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1615854755] [2022-02-20 23:49:35,788 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1615854755] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:49:35,788 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:49:35,788 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:49:35,789 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353564761] [2022-02-20 23:49:35,789 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:49:35,789 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 51 [2022-02-20 23:49:35,789 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:49:35,789 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:49:35,829 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:49:35,830 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:49:35,830 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:49:35,830 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:49:35,830 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=66, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:49:35,830 INFO L87 Difference]: Start difference. First operand 4588 states and 6337 transitions. Second operand has 10 states, 9 states have (on average 5.444444444444445) internal successors, (49), 8 states have internal predecessors, (49), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1)