./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/memsafety/test-0218.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 03d7b7b3 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/memsafety/test-0218.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 d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 23:44:59,908 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 23:44:59,910 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 23:44:59,930 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 23:44:59,931 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 23:44:59,932 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 23:44:59,932 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 23:44:59,933 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 23:44:59,934 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 23:44:59,935 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 23:44:59,936 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 23:44:59,939 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 23:44:59,939 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 23:44:59,944 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 23:44:59,946 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 23:44:59,948 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 23:44:59,948 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 23:44:59,950 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 23:44:59,952 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 23:44:59,953 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 23:44:59,956 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 23:44:59,957 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 23:44:59,958 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 23:44:59,958 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 23:44:59,960 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 23:44:59,963 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 23:44:59,963 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 23:44:59,964 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 23:44:59,964 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 23:44:59,965 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 23:44:59,965 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 23:44:59,966 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 23:44:59,967 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 23:44:59,968 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 23:44:59,968 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 23:44:59,969 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 23:44:59,969 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 23:44:59,969 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 23:44:59,969 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 23:44:59,970 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 23:44:59,970 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 23:44:59,971 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:44:59,989 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 23:44:59,990 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 23:44:59,990 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 23:44:59,990 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 23:44:59,990 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 23:44:59,991 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 23:44:59,991 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 23:44:59,991 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 23:44:59,991 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 23:44:59,991 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 23:44:59,992 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 23:44:59,992 INFO L138 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2022-02-20 23:44:59,992 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * Bitprecise bitfields=true [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 23:44:59,993 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 23:44:59,994 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 23:44:59,994 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 23:44:59,994 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 23:44:59,994 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 23:44:59,994 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 23:44:59,994 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:44:59,994 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 23:44:59,995 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 23:44:59,995 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 23:44:59,995 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 23:44:59,995 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 -> d0144744ce48339ff9171f70682ff014d707c8affcdd45929fe7382e980b7693 [2022-02-20 23:45:00,179 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 23:45:00,193 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 23:45:00,196 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 23:45:00,197 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 23:45:00,198 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 23:45:00,198 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/memsafety/test-0218.i [2022-02-20 23:45:00,252 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab14caf2/2cf172d3857647aeb1d426eed87389ad/FLAG302064727 [2022-02-20 23:45:00,673 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 23:45:00,674 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/memsafety/test-0218.i [2022-02-20 23:45:00,683 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab14caf2/2cf172d3857647aeb1d426eed87389ad/FLAG302064727 [2022-02-20 23:45:00,691 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/6ab14caf2/2cf172d3857647aeb1d426eed87389ad [2022-02-20 23:45:00,692 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 23:45:00,693 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 23:45:00,694 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:00,694 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 23:45:00,700 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 23:45:00,703 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:00" (1/1) ... [2022-02-20 23:45:00,704 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2412b4ca and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:00, skipping insertion in model container [2022-02-20 23:45:00,704 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 11:45:00" (1/1) ... [2022-02-20 23:45:00,709 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 23:45:00,744 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 23:45:00,972 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:00,978 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 23:45:01,015 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 23:45:01,052 INFO L208 MainTranslator]: Completed translation [2022-02-20 23:45:01,053 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01 WrapperNode [2022-02-20 23:45:01,053 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 23:45:01,054 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:01,054 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 23:45:01,054 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 23:45:01,059 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,073 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,108 INFO L137 Inliner]: procedures = 181, calls = 46, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 216 [2022-02-20 23:45:01,108 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 23:45:01,108 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 23:45:01,109 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 23:45:01,109 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 23:45:01,136 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,136 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,144 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,145 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,152 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,155 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,161 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,163 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 23:45:01,163 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 23:45:01,164 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 23:45:01,164 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 23:45:01,167 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (1/1) ... [2022-02-20 23:45:01,179 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 23:45:01,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:01,194 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2022-02-20 23:45:01,196 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2022-02-20 23:45:01,229 INFO L130 BoogieDeclarations]: Found specification of procedure rand_end_point [2022-02-20 23:45:01,230 INFO L138 BoogieDeclarations]: Found implementation of procedure rand_end_point [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 23:45:01,230 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 23:45:01,231 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 23:45:01,340 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 23:45:01,341 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 23:45:01,843 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 23:45:01,849 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 23:45:01,850 INFO L299 CfgBuilder]: Removed 5 assume(true) statements. [2022-02-20 23:45:01,851 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:01 BoogieIcfgContainer [2022-02-20 23:45:01,851 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 23:45:01,853 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 23:45:01,853 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 23:45:01,855 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 23:45:01,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 11:45:00" (1/3) ... [2022-02-20 23:45:01,856 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab3f48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:01, skipping insertion in model container [2022-02-20 23:45:01,856 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 11:45:01" (2/3) ... [2022-02-20 23:45:01,857 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@2ab3f48d and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 11:45:01, skipping insertion in model container [2022-02-20 23:45:01,857 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 11:45:01" (3/3) ... [2022-02-20 23:45:01,858 INFO L111 eAbstractionObserver]: Analyzing ICFG test-0218.i [2022-02-20 23:45:01,863 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 23:45:01,863 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2022-02-20 23:45:01,900 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 23:45:01,908 INFO L339 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=false, mAutomataTypeConcurrency=FINITE_AUTOMATA, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mLoopAccelerationTechnique=FAST_UPR [2022-02-20 23:45:01,909 INFO L340 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2022-02-20 23:45:01,942 INFO L276 IsEmpty]: Start isEmpty. Operand has 167 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 163 states have internal predecessors, (190), 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:45:01,948 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2022-02-20 23:45:01,949 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:01,949 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2022-02-20 23:45:01,949 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:01,953 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:01,953 INFO L85 PathProgramCache]: Analyzing trace with hash 1074826664, now seen corresponding path program 1 times [2022-02-20 23:45:01,961 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:01,962 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1607719009] [2022-02-20 23:45:01,963 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:01,964 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:02,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:02,078 INFO L290 TraceCheckUtils]: 0: Hoare triple {170#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(12, 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); {170#true} is VALID [2022-02-20 23:45:02,078 INFO L290 TraceCheckUtils]: 1: Hoare triple {170#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {170#true} is VALID [2022-02-20 23:45:02,079 INFO L290 TraceCheckUtils]: 2: Hoare triple {170#true} assume !true; {171#false} is VALID [2022-02-20 23:45:02,080 INFO L290 TraceCheckUtils]: 3: Hoare triple {171#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {171#false} is VALID [2022-02-20 23:45:02,080 INFO L290 TraceCheckUtils]: 4: Hoare triple {171#false} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {171#false} is VALID [2022-02-20 23:45:02,080 INFO L290 TraceCheckUtils]: 5: Hoare triple {171#false} assume !(1 == #valid[~#list~0.base]); {171#false} is VALID [2022-02-20 23:45:02,081 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:02,082 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:02,082 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1607719009] [2022-02-20 23:45:02,082 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1607719009] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:02,082 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:02,083 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:02,084 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1751472908] [2022-02-20 23:45:02,084 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:02,088 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:45:02,088 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:02,091 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:45:02,100 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:45:02,100 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 23:45:02,101 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 23:45:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 23:45:02,127 INFO L87 Difference]: Start difference. First operand has 167 states, 98 states have (on average 1.9387755102040816) internal successors, (190), 163 states have internal predecessors, (190), 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:45:02,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,265 INFO L93 Difference]: Finished difference Result 167 states and 188 transitions. [2022-02-20 23:45:02,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 23:45:02,265 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:45:02,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:02,266 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:45:02,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 194 transitions. [2022-02-20 23:45:02,275 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:45:02,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 194 transitions. [2022-02-20 23:45:02,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 194 transitions. [2022-02-20 23:45:02,399 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 194 edges. 194 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:02,413 INFO L225 Difference]: With dead ends: 167 [2022-02-20 23:45:02,413 INFO L226 Difference]: Without dead ends: 165 [2022-02-20 23:45:02,415 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:45:02,418 INFO L933 BasicCegarLoop]: 188 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, 188 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:45:02,418 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:02,430 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 165 states. [2022-02-20 23:45:02,449 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 165 to 165. [2022-02-20 23:45:02,450 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:02,455 INFO L82 GeneralOperation]: Start isEquivalent. First operand 165 states. Second operand has 165 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 161 states have internal predecessors, (182), 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:45:02,456 INFO L74 IsIncluded]: Start isIncluded. First operand 165 states. Second operand has 165 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 161 states have internal predecessors, (182), 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:45:02,456 INFO L87 Difference]: Start difference. First operand 165 states. Second operand has 165 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 161 states have internal predecessors, (182), 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:45:02,472 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,472 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2022-02-20 23:45:02,472 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2022-02-20 23:45:02,474 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:02,474 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:02,474 INFO L74 IsIncluded]: Start isIncluded. First operand has 165 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 161 states have internal predecessors, (182), 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 165 states. [2022-02-20 23:45:02,475 INFO L87 Difference]: Start difference. First operand has 165 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 161 states have internal predecessors, (182), 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 165 states. [2022-02-20 23:45:02,483 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,483 INFO L93 Difference]: Finished difference Result 165 states and 186 transitions. [2022-02-20 23:45:02,483 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2022-02-20 23:45:02,489 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:02,489 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:02,489 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:02,490 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:02,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 97 states have (on average 1.8762886597938144) internal successors, (182), 161 states have internal predecessors, (182), 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:45:02,494 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 186 transitions. [2022-02-20 23:45:02,495 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 186 transitions. Word has length 6 [2022-02-20 23:45:02,495 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:02,495 INFO L470 AbstractCegarLoop]: Abstraction has 165 states and 186 transitions. [2022-02-20 23:45:02,495 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:45:02,496 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 186 transitions. [2022-02-20 23:45:02,496 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:02,496 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:02,497 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:02,497 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 23:45:02,497 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:02,498 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:02,498 INFO L85 PathProgramCache]: Analyzing trace with hash -1280321240, now seen corresponding path program 1 times [2022-02-20 23:45:02,498 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:02,499 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [928398916] [2022-02-20 23:45:02,499 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:02,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:02,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:02,571 INFO L290 TraceCheckUtils]: 0: Hoare triple {836#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(12, 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); {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:02,572 INFO L290 TraceCheckUtils]: 1: Hoare triple {838#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:02,572 INFO L290 TraceCheckUtils]: 2: Hoare triple {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:02,573 INFO L290 TraceCheckUtils]: 3: Hoare triple {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:02,573 INFO L290 TraceCheckUtils]: 4: Hoare triple {838#(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~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:02,574 INFO L290 TraceCheckUtils]: 5: Hoare triple {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} is VALID [2022-02-20 23:45:02,574 INFO L290 TraceCheckUtils]: 6: Hoare triple {838#(and (= (select |#valid| |~#list~0.base|) 1) (= (select |#valid| |~#list~0.base|) (select |#valid| 3)))} assume !(1 == #valid[~#list~0.base]); {837#false} is VALID [2022-02-20 23:45:02,574 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:02,574 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:02,575 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [928398916] [2022-02-20 23:45:02,575 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [928398916] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:02,575 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:02,575 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2022-02-20 23:45:02,575 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1781691040] [2022-02-20 23:45:02,576 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:02,576 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:45:02,576 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:02,577 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,582 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:02,582 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:02,582 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:02,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:02,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:02,584 INFO L87 Difference]: Start difference. First operand 165 states and 186 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:02,972 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2022-02-20 23:45:02,972 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:02,972 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:45:02,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:02,972 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 23:45:02,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:02,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 363 transitions. [2022-02-20 23:45:02,979 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 363 transitions. [2022-02-20 23:45:03,217 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,224 INFO L225 Difference]: With dead ends: 321 [2022-02-20 23:45:03,224 INFO L226 Difference]: Without dead ends: 321 [2022-02-20 23:45:03,224 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:45:03,225 INFO L933 BasicCegarLoop]: 126 mSDtfsCounter, 167 mSDsluCounter, 119 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 128 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:03,225 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [167 Valid, 245 Invalid, 128 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:03,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 321 states. [2022-02-20 23:45:03,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 321 to 227. [2022-02-20 23:45:03,233 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:03,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 321 states. Second operand has 227 states, 156 states have (on average 1.858974358974359) internal successors, (290), 220 states have internal predecessors, (290), 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:45:03,234 INFO L74 IsIncluded]: Start isIncluded. First operand 321 states. Second operand has 227 states, 156 states have (on average 1.858974358974359) internal successors, (290), 220 states have internal predecessors, (290), 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:45:03,235 INFO L87 Difference]: Start difference. First operand 321 states. Second operand has 227 states, 156 states have (on average 1.858974358974359) internal successors, (290), 220 states have internal predecessors, (290), 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:45:03,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,243 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2022-02-20 23:45:03,244 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 362 transitions. [2022-02-20 23:45:03,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,245 INFO L74 IsIncluded]: Start isIncluded. First operand has 227 states, 156 states have (on average 1.858974358974359) internal successors, (290), 220 states have internal predecessors, (290), 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 321 states. [2022-02-20 23:45:03,245 INFO L87 Difference]: Start difference. First operand has 227 states, 156 states have (on average 1.858974358974359) internal successors, (290), 220 states have internal predecessors, (290), 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 321 states. [2022-02-20 23:45:03,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,267 INFO L93 Difference]: Finished difference Result 321 states and 362 transitions. [2022-02-20 23:45:03,267 INFO L276 IsEmpty]: Start isEmpty. Operand 321 states and 362 transitions. [2022-02-20 23:45:03,268 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,268 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,268 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:03,268 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:03,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 227 states, 156 states have (on average 1.858974358974359) internal successors, (290), 220 states have internal predecessors, (290), 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:45:03,275 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 227 states to 227 states and 298 transitions. [2022-02-20 23:45:03,275 INFO L78 Accepts]: Start accepts. Automaton has 227 states and 298 transitions. Word has length 7 [2022-02-20 23:45:03,275 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:03,275 INFO L470 AbstractCegarLoop]: Abstraction has 227 states and 298 transitions. [2022-02-20 23:45:03,275 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,276 INFO L276 IsEmpty]: Start isEmpty. Operand 227 states and 298 transitions. [2022-02-20 23:45:03,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:03,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:03,276 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:03,276 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 23:45:03,277 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:03,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:03,278 INFO L85 PathProgramCache]: Analyzing trace with hash -1280321239, now seen corresponding path program 1 times [2022-02-20 23:45:03,278 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:03,278 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [834321967] [2022-02-20 23:45:03,278 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:03,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:03,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:03,385 INFO L290 TraceCheckUtils]: 0: Hoare triple {2031#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(12, 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); {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:03,385 INFO L290 TraceCheckUtils]: 1: Hoare triple {2033#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:03,386 INFO L290 TraceCheckUtils]: 2: Hoare triple {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:03,386 INFO L290 TraceCheckUtils]: 3: Hoare triple {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:03,387 INFO L290 TraceCheckUtils]: 4: Hoare triple {2033#(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~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:03,387 INFO L290 TraceCheckUtils]: 5: Hoare triple {2033#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {2034#(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:45:03,388 INFO L290 TraceCheckUtils]: 6: Hoare triple {2034#(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); {2032#false} is VALID [2022-02-20 23:45:03,388 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:03,388 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:03,389 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [834321967] [2022-02-20 23:45:03,389 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [834321967] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:03,389 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:03,389 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:03,389 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639225689] [2022-02-20 23:45:03,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:03,390 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:45:03,390 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:03,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,395 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,395 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:03,395 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:03,395 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:03,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:03,396 INFO L87 Difference]: Start difference. First operand 227 states and 298 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,745 INFO L93 Difference]: Finished difference Result 245 states and 316 transitions. [2022-02-20 23:45:03,745 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:03,745 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:45:03,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:03,746 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-02-20 23:45:03,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 204 transitions. [2022-02-20 23:45:03,750 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 204 transitions. [2022-02-20 23:45:03,909 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 204 edges. 204 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:03,912 INFO L225 Difference]: With dead ends: 245 [2022-02-20 23:45:03,913 INFO L226 Difference]: Without dead ends: 245 [2022-02-20 23:45:03,913 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:45:03,914 INFO L933 BasicCegarLoop]: 131 mSDtfsCounter, 214 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 214 SdHoareTripleChecker+Valid, 253 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:03,914 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [214 Valid, 253 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:03,914 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 245 states. [2022-02-20 23:45:03,922 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 245 to 229. [2022-02-20 23:45:03,925 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:03,926 INFO L82 GeneralOperation]: Start isEquivalent. First operand 245 states. Second operand has 229 states, 158 states have (on average 1.8544303797468353) internal successors, (293), 222 states have internal predecessors, (293), 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:45:03,926 INFO L74 IsIncluded]: Start isIncluded. First operand 245 states. Second operand has 229 states, 158 states have (on average 1.8544303797468353) internal successors, (293), 222 states have internal predecessors, (293), 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:45:03,927 INFO L87 Difference]: Start difference. First operand 245 states. Second operand has 229 states, 158 states have (on average 1.8544303797468353) internal successors, (293), 222 states have internal predecessors, (293), 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:45:03,933 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,933 INFO L93 Difference]: Finished difference Result 245 states and 316 transitions. [2022-02-20 23:45:03,934 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 316 transitions. [2022-02-20 23:45:03,936 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,936 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,936 INFO L74 IsIncluded]: Start isIncluded. First operand has 229 states, 158 states have (on average 1.8544303797468353) internal successors, (293), 222 states have internal predecessors, (293), 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 245 states. [2022-02-20 23:45:03,937 INFO L87 Difference]: Start difference. First operand has 229 states, 158 states have (on average 1.8544303797468353) internal successors, (293), 222 states have internal predecessors, (293), 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 245 states. [2022-02-20 23:45:03,942 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:03,943 INFO L93 Difference]: Finished difference Result 245 states and 316 transitions. [2022-02-20 23:45:03,943 INFO L276 IsEmpty]: Start isEmpty. Operand 245 states and 316 transitions. [2022-02-20 23:45:03,943 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:03,943 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:03,947 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:03,947 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:03,947 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 229 states, 158 states have (on average 1.8544303797468353) internal successors, (293), 222 states have internal predecessors, (293), 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:45:03,952 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 229 states to 229 states and 301 transitions. [2022-02-20 23:45:03,952 INFO L78 Accepts]: Start accepts. Automaton has 229 states and 301 transitions. Word has length 7 [2022-02-20 23:45:03,952 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:03,952 INFO L470 AbstractCegarLoop]: Abstraction has 229 states and 301 transitions. [2022-02-20 23:45:03,952 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:03,952 INFO L276 IsEmpty]: Start isEmpty. Operand 229 states and 301 transitions. [2022-02-20 23:45:03,953 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 23:45:03,953 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:03,953 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:03,953 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 23:45:03,953 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr58REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:03,954 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:03,954 INFO L85 PathProgramCache]: Analyzing trace with hash -1280321301, now seen corresponding path program 1 times [2022-02-20 23:45:03,954 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:03,954 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [389566032] [2022-02-20 23:45:03,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:03,955 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:03,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:04,050 INFO L290 TraceCheckUtils]: 0: Hoare triple {3003#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(12, 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); {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:04,051 INFO L290 TraceCheckUtils]: 1: Hoare triple {3005#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:04,051 INFO L290 TraceCheckUtils]: 2: Hoare triple {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:04,052 INFO L290 TraceCheckUtils]: 3: Hoare triple {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:04,053 INFO L290 TraceCheckUtils]: 4: Hoare triple {3005#(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~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:04,054 INFO L290 TraceCheckUtils]: 5: Hoare triple {3005#(and (= (select |#length| |~#list~0.base|) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {3006#(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:45:04,054 INFO L290 TraceCheckUtils]: 6: Hoare triple {3006#(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); {3004#false} is VALID [2022-02-20 23:45:04,054 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:04,055 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:04,055 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [389566032] [2022-02-20 23:45:04,055 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [389566032] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:04,055 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:04,055 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:04,055 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2145130801] [2022-02-20 23:45:04,056 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:04,056 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:45:04,056 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:04,056 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,062 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,062 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:04,062 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:04,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:04,063 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:04,063 INFO L87 Difference]: Start difference. First operand 229 states and 301 transitions. Second operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,417 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2022-02-20 23:45:04,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:04,417 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 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 7 [2022-02-20 23:45:04,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:04,417 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2022-02-20 23:45:04,419 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,421 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 203 transitions. [2022-02-20 23:45:04,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 203 transitions. [2022-02-20 23:45:04,568 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 203 edges. 203 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,570 INFO L225 Difference]: With dead ends: 244 [2022-02-20 23:45:04,571 INFO L226 Difference]: Without dead ends: 244 [2022-02-20 23:45:04,571 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:45:04,572 INFO L933 BasicCegarLoop]: 144 mSDtfsCounter, 196 mSDsluCounter, 122 mSDsCounter, 0 mSdLazyCounter, 120 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 196 SdHoareTripleChecker+Valid, 266 SdHoareTripleChecker+Invalid, 121 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 120 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:04,572 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [196 Valid, 266 Invalid, 121 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 120 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:04,573 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 244 states. [2022-02-20 23:45:04,576 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 244 to 226. [2022-02-20 23:45:04,576 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:04,577 INFO L82 GeneralOperation]: Start isEquivalent. First operand 244 states. Second operand has 226 states, 156 states have (on average 1.8461538461538463) internal successors, (288), 219 states have internal predecessors, (288), 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:45:04,577 INFO L74 IsIncluded]: Start isIncluded. First operand 244 states. Second operand has 226 states, 156 states have (on average 1.8461538461538463) internal successors, (288), 219 states have internal predecessors, (288), 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:45:04,578 INFO L87 Difference]: Start difference. First operand 244 states. Second operand has 226 states, 156 states have (on average 1.8461538461538463) internal successors, (288), 219 states have internal predecessors, (288), 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:45:04,582 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,582 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2022-02-20 23:45:04,583 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 314 transitions. [2022-02-20 23:45:04,583 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,583 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,583 INFO L74 IsIncluded]: Start isIncluded. First operand has 226 states, 156 states have (on average 1.8461538461538463) internal successors, (288), 219 states have internal predecessors, (288), 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 244 states. [2022-02-20 23:45:04,584 INFO L87 Difference]: Start difference. First operand has 226 states, 156 states have (on average 1.8461538461538463) internal successors, (288), 219 states have internal predecessors, (288), 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 244 states. [2022-02-20 23:45:04,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:04,589 INFO L93 Difference]: Finished difference Result 244 states and 314 transitions. [2022-02-20 23:45:04,589 INFO L276 IsEmpty]: Start isEmpty. Operand 244 states and 314 transitions. [2022-02-20 23:45:04,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:04,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:04,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:04,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:04,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 226 states, 156 states have (on average 1.8461538461538463) internal successors, (288), 219 states have internal predecessors, (288), 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:45:04,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 296 transitions. [2022-02-20 23:45:04,594 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 296 transitions. Word has length 7 [2022-02-20 23:45:04,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:04,594 INFO L470 AbstractCegarLoop]: Abstraction has 226 states and 296 transitions. [2022-02-20 23:45:04,594 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,594 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 296 transitions. [2022-02-20 23:45:04,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:04,595 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:04,595 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:04,595 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 23:45:04,595 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:04,596 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:04,596 INFO L85 PathProgramCache]: Analyzing trace with hash 1554740496, now seen corresponding path program 1 times [2022-02-20 23:45:04,596 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:04,596 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [166914933] [2022-02-20 23:45:04,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:04,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:04,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:04,719 INFO L290 TraceCheckUtils]: 0: Hoare triple {3969#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(12, 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); {3971#(and (= (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))))} is VALID [2022-02-20 23:45:04,720 INFO L290 TraceCheckUtils]: 1: Hoare triple {3971#(and (= (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))))} 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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {3971#(and (= (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))))} is VALID [2022-02-20 23:45:04,720 INFO L290 TraceCheckUtils]: 2: Hoare triple {3971#(and (= (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))))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {3971#(and (= (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))))} is VALID [2022-02-20 23:45:04,721 INFO L290 TraceCheckUtils]: 3: Hoare triple {3971#(and (= (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))))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {3971#(and (= (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))))} is VALID [2022-02-20 23:45:04,721 INFO L290 TraceCheckUtils]: 4: Hoare triple {3971#(and (= (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))))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {3971#(and (= (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))))} is VALID [2022-02-20 23:45:04,722 INFO L290 TraceCheckUtils]: 5: Hoare triple {3971#(and (= (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))))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {3972#(and (= (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))) (= (* |ULTIMATE.start_main_~end_point~0#1| 4) 4))} is VALID [2022-02-20 23:45:04,723 INFO L290 TraceCheckUtils]: 6: Hoare triple {3972#(and (= (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))) (= (* |ULTIMATE.start_main_~end_point~0#1| 4) 4))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {3973#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} is VALID [2022-02-20 23:45:04,723 INFO L290 TraceCheckUtils]: 7: Hoare triple {3973#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {3974#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} is VALID [2022-02-20 23:45:04,724 INFO L290 TraceCheckUtils]: 8: Hoare triple {3974#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {3970#false} is VALID [2022-02-20 23:45:04,724 INFO L290 TraceCheckUtils]: 9: Hoare triple {3970#false} assume !(1 == #valid[main_~cursor~1#1.base]); {3970#false} is VALID [2022-02-20 23:45:04,724 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:04,724 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:04,724 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [166914933] [2022-02-20 23:45:04,725 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [166914933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:04,725 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:04,725 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:04,725 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1312072289] [2022-02-20 23:45:04,725 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:04,725 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:45:04,726 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:04,726 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:04,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:04,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:04,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:04,734 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:04,734 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:04,735 INFO L87 Difference]: Start difference. First operand 226 states and 296 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,321 INFO L93 Difference]: Finished difference Result 402 states and 517 transitions. [2022-02-20 23:45:05,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:05,321 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:45:05,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:05,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2022-02-20 23:45:05,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 332 transitions. [2022-02-20 23:45:05,329 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 332 transitions. [2022-02-20 23:45:05,536 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:45:05,542 INFO L225 Difference]: With dead ends: 402 [2022-02-20 23:45:05,542 INFO L226 Difference]: Without dead ends: 402 [2022-02-20 23:45:05,543 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:05,543 INFO L933 BasicCegarLoop]: 164 mSDtfsCounter, 150 mSDsluCounter, 581 mSDsCounter, 0 mSdLazyCounter, 134 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 745 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:05,544 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [150 Valid, 745 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 134 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:05,544 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 402 states. [2022-02-20 23:45:05,549 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 402 to 292. [2022-02-20 23:45:05,549 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:05,550 INFO L82 GeneralOperation]: Start isEquivalent. First operand 402 states. Second operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:05,551 INFO L74 IsIncluded]: Start isIncluded. First operand 402 states. Second operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:05,551 INFO L87 Difference]: Start difference. First operand 402 states. Second operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:05,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,565 INFO L93 Difference]: Finished difference Result 402 states and 517 transitions. [2022-02-20 23:45:05,565 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 517 transitions. [2022-02-20 23:45:05,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,566 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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 402 states. [2022-02-20 23:45:05,567 INFO L87 Difference]: Start difference. First operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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 402 states. [2022-02-20 23:45:05,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:05,577 INFO L93 Difference]: Finished difference Result 402 states and 517 transitions. [2022-02-20 23:45:05,577 INFO L276 IsEmpty]: Start isEmpty. Operand 402 states and 517 transitions. [2022-02-20 23:45:05,577 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:05,578 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:05,578 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:05,578 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:05,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:05,585 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 403 transitions. [2022-02-20 23:45:05,585 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 403 transitions. Word has length 10 [2022-02-20 23:45:05,585 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:05,585 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 403 transitions. [2022-02-20 23:45:05,586 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,586 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 403 transitions. [2022-02-20 23:45:05,586 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2022-02-20 23:45:05,586 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:05,586 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:05,586 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 23:45:05,586 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:05,587 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:05,587 INFO L85 PathProgramCache]: Analyzing trace with hash 1552893454, now seen corresponding path program 1 times [2022-02-20 23:45:05,587 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:05,587 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1398804935] [2022-02-20 23:45:05,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:05,588 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:05,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:05,715 INFO L290 TraceCheckUtils]: 0: Hoare triple {5481#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(12, 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); {5483#(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:45:05,716 INFO L290 TraceCheckUtils]: 1: Hoare triple {5483#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {5483#(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:45:05,716 INFO L290 TraceCheckUtils]: 2: Hoare triple {5483#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {5483#(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:45:05,717 INFO L290 TraceCheckUtils]: 3: Hoare triple {5483#(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 !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {5483#(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:45:05,717 INFO L290 TraceCheckUtils]: 4: Hoare triple {5483#(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))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {5483#(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:45:05,718 INFO L290 TraceCheckUtils]: 5: Hoare triple {5483#(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 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {5484#(and (or (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)) (not (= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) 0))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)))} is VALID [2022-02-20 23:45:05,719 INFO L290 TraceCheckUtils]: 6: Hoare triple {5484#(and (or (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)) (not (= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) 0))) (<= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) (* ~unnamed1~0~LIST_BEG 4)))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {5485#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} is VALID [2022-02-20 23:45:05,719 INFO L290 TraceCheckUtils]: 7: Hoare triple {5485#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (= |ULTIMATE.start_main_#t~mem36#1.base| 0))} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {5486#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} is VALID [2022-02-20 23:45:05,720 INFO L290 TraceCheckUtils]: 8: Hoare triple {5486#(and (= |ULTIMATE.start_main_~cursor~1#1.base| 0) (= |ULTIMATE.start_main_~cursor~1#1.offset| 0))} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {5482#false} is VALID [2022-02-20 23:45:05,720 INFO L290 TraceCheckUtils]: 9: Hoare triple {5482#false} assume !(1 == #valid[main_~cursor~1#1.base]); {5482#false} is VALID [2022-02-20 23:45:05,720 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:05,720 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:05,720 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1398804935] [2022-02-20 23:45:05,720 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1398804935] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:05,721 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:05,721 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:05,721 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1918918340] [2022-02-20 23:45:05,721 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:05,721 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:45:05,721 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:05,721 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:05,728 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 10 edges. 10 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:05,728 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:05,728 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:05,729 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:05,729 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:05,729 INFO L87 Difference]: Start difference. First operand 292 states and 403 transitions. Second operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,398 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,398 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2022-02-20 23:45:06,398 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:06,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2022-02-20 23:45:06,399 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:06,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 321 transitions. [2022-02-20 23:45:06,401 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 321 transitions. [2022-02-20 23:45:06,403 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 321 transitions. [2022-02-20 23:45:06,614 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,620 INFO L225 Difference]: With dead ends: 392 [2022-02-20 23:45:06,620 INFO L226 Difference]: Without dead ends: 392 [2022-02-20 23:45:06,620 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:06,621 INFO L933 BasicCegarLoop]: 169 mSDtfsCounter, 131 mSDsluCounter, 622 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 131 SdHoareTripleChecker+Valid, 791 SdHoareTripleChecker+Invalid, 154 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:06,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [131 Valid, 791 Invalid, 154 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:06,622 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 392 states. [2022-02-20 23:45:06,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 392 to 292. [2022-02-20 23:45:06,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:06,626 INFO L82 GeneralOperation]: Start isEquivalent. First operand 392 states. Second operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:06,627 INFO L74 IsIncluded]: Start isIncluded. First operand 392 states. Second operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:06,627 INFO L87 Difference]: Start difference. First operand 392 states. Second operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:06,634 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,634 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2022-02-20 23:45:06,634 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 506 transitions. [2022-02-20 23:45:06,635 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,635 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,635 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:06,636 INFO L87 Difference]: Start difference. First operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:06,642 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,643 INFO L93 Difference]: Finished difference Result 392 states and 506 transitions. [2022-02-20 23:45:06,643 INFO L276 IsEmpty]: Start isEmpty. Operand 392 states and 506 transitions. [2022-02-20 23:45:06,643 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:06,643 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:06,644 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:06,644 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:06,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 216 states have (on average 1.7916666666666667) internal successors, (387), 281 states have internal predecessors, (387), 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:45:06,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 403 transitions. [2022-02-20 23:45:06,648 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 403 transitions. Word has length 10 [2022-02-20 23:45:06,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:06,649 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 403 transitions. [2022-02-20 23:45:06,649 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 1.6666666666666667) internal successors, (10), 5 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,649 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 403 transitions. [2022-02-20 23:45:06,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2022-02-20 23:45:06,649 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:06,649 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:06,650 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 23:45:06,650 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:06,650 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:06,650 INFO L85 PathProgramCache]: Analyzing trace with hash 952313872, now seen corresponding path program 1 times [2022-02-20 23:45:06,650 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:06,650 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341534717] [2022-02-20 23:45:06,651 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:06,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:06,658 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:06,666 INFO L290 TraceCheckUtils]: 0: Hoare triple {6965#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(12, 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); {6965#true} is VALID [2022-02-20 23:45:06,666 INFO L290 TraceCheckUtils]: 1: Hoare triple {6965#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,667 INFO L290 TraceCheckUtils]: 2: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,667 INFO L290 TraceCheckUtils]: 3: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,667 INFO L290 TraceCheckUtils]: 4: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,668 INFO L290 TraceCheckUtils]: 5: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,668 INFO L290 TraceCheckUtils]: 6: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,669 INFO L290 TraceCheckUtils]: 7: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,669 INFO L290 TraceCheckUtils]: 8: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,669 INFO L290 TraceCheckUtils]: 9: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} main_#res#1 := 0; {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} is VALID [2022-02-20 23:45:06,670 INFO L290 TraceCheckUtils]: 10: Hoare triple {6967#(= |ULTIMATE.start_main_old_#valid#1| |#valid|)} assume !(#valid == main_old_#valid#1); {6966#false} is VALID [2022-02-20 23:45:06,670 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:06,670 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:06,670 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341534717] [2022-02-20 23:45:06,670 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1341534717] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:06,670 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:06,670 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:06,670 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [55299146] [2022-02-20 23:45:06,671 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:06,671 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:45:06,672 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:06,673 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 11 edges. 11 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:06,678 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:06,678 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:06,679 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:06,679 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:06,679 INFO L87 Difference]: Start difference. First operand 292 states and 403 transitions. Second operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,897 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:06,897 INFO L93 Difference]: Finished difference Result 347 states and 456 transitions. [2022-02-20 23:45:06,897 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:06,898 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2022-02-20 23:45:06,898 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:06,898 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,900 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-02-20 23:45:06,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:06,902 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 272 transitions. [2022-02-20 23:45:06,902 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 272 transitions. [2022-02-20 23:45:07,053 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 272 edges. 272 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,058 INFO L225 Difference]: With dead ends: 347 [2022-02-20 23:45:07,058 INFO L226 Difference]: Without dead ends: 340 [2022-02-20 23:45:07,058 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:07,058 INFO L933 BasicCegarLoop]: 161 mSDtfsCounter, 70 mSDsluCounter, 118 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 279 SdHoareTripleChecker+Invalid, 92 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:07,059 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [72 Valid, 279 Invalid, 92 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:07,059 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 340 states. [2022-02-20 23:45:07,063 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 340 to 289. [2022-02-20 23:45:07,063 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:07,064 INFO L82 GeneralOperation]: Start isEquivalent. First operand 340 states. Second operand has 289 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 278 states have internal predecessors, (382), 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:45:07,064 INFO L74 IsIncluded]: Start isIncluded. First operand 340 states. Second operand has 289 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 278 states have internal predecessors, (382), 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:45:07,064 INFO L87 Difference]: Start difference. First operand 340 states. Second operand has 289 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 278 states have internal predecessors, (382), 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:45:07,069 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,070 INFO L93 Difference]: Finished difference Result 340 states and 448 transitions. [2022-02-20 23:45:07,070 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 448 transitions. [2022-02-20 23:45:07,070 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,070 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,071 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 278 states have internal predecessors, (382), 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 340 states. [2022-02-20 23:45:07,071 INFO L87 Difference]: Start difference. First operand has 289 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 278 states have internal predecessors, (382), 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 340 states. [2022-02-20 23:45:07,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,077 INFO L93 Difference]: Finished difference Result 340 states and 448 transitions. [2022-02-20 23:45:07,077 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 448 transitions. [2022-02-20 23:45:07,078 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:07,078 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:07,078 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:07,078 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:07,078 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 213 states have (on average 1.7934272300469483) internal successors, (382), 278 states have internal predecessors, (382), 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:45:07,082 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 398 transitions. [2022-02-20 23:45:07,083 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 398 transitions. Word has length 11 [2022-02-20 23:45:07,083 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:07,083 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 398 transitions. [2022-02-20 23:45:07,083 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.5) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 23:45:07,083 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 398 transitions. [2022-02-20 23:45:07,083 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:45:07,084 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:07,084 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:07,084 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 23:45:07,084 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:07,084 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:07,084 INFO L85 PathProgramCache]: Analyzing trace with hash -41167145, now seen corresponding path program 1 times [2022-02-20 23:45:07,085 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:07,085 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1002474047] [2022-02-20 23:45:07,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:07,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:07,110 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:07,140 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:07,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:07,145 INFO L290 TraceCheckUtils]: 0: Hoare triple {8286#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {8286#true} is VALID [2022-02-20 23:45:07,146 INFO L290 TraceCheckUtils]: 1: Hoare triple {8286#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {8286#true} is VALID [2022-02-20 23:45:07,146 INFO L290 TraceCheckUtils]: 2: Hoare triple {8286#true} assume true; {8286#true} is VALID [2022-02-20 23:45:07,146 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {8286#true} {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #308#return; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {8286#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(12, 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); {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {8288#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,148 INFO L290 TraceCheckUtils]: 2: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,148 INFO L290 TraceCheckUtils]: 3: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,149 INFO L290 TraceCheckUtils]: 4: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,149 INFO L290 TraceCheckUtils]: 5: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,149 INFO L290 TraceCheckUtils]: 6: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,150 INFO L290 TraceCheckUtils]: 7: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,150 INFO L272 TraceCheckUtils]: 8: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret34#1 := rand_end_point(); {8286#true} is VALID [2022-02-20 23:45:07,150 INFO L290 TraceCheckUtils]: 9: Hoare triple {8286#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {8286#true} is VALID [2022-02-20 23:45:07,150 INFO L290 TraceCheckUtils]: 10: Hoare triple {8286#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {8286#true} is VALID [2022-02-20 23:45:07,150 INFO L290 TraceCheckUtils]: 11: Hoare triple {8286#true} assume true; {8286#true} is VALID [2022-02-20 23:45:07,151 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {8286#true} {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #308#return; {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:07,152 INFO L290 TraceCheckUtils]: 13: Hoare triple {8288#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {8293#(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:45:07,152 INFO L290 TraceCheckUtils]: 14: Hoare triple {8293#(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]); {8287#false} is VALID [2022-02-20 23:45:07,152 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:07,152 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:07,152 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1002474047] [2022-02-20 23:45:07,152 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1002474047] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:07,153 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:07,153 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:07,153 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [327672541] [2022-02-20 23:45:07,153 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:07,153 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:07,154 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:07,154 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,162 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:07,162 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:07,162 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:07,163 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:07,163 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:07,163 INFO L87 Difference]: Start difference. First operand 289 states and 398 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,730 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:07,731 INFO L93 Difference]: Finished difference Result 490 states and 599 transitions. [2022-02-20 23:45:07,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:07,731 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:07,731 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:07,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,734 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:45:07,734 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:07,736 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 467 transitions. [2022-02-20 23:45:07,737 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 467 transitions. [2022-02-20 23:45:08,034 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 467 edges. 467 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:08,042 INFO L225 Difference]: With dead ends: 490 [2022-02-20 23:45:08,042 INFO L226 Difference]: Without dead ends: 490 [2022-02-20 23:45:08,042 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:45:08,043 INFO L933 BasicCegarLoop]: 194 mSDtfsCounter, 319 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 242 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 319 SdHoareTripleChecker+Valid, 426 SdHoareTripleChecker+Invalid, 248 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 242 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:08,043 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [319 Valid, 426 Invalid, 248 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 242 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:08,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 490 states. [2022-02-20 23:45:08,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 490 to 295. [2022-02-20 23:45:08,049 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:08,053 INFO L82 GeneralOperation]: Start isEquivalent. First operand 490 states. Second operand has 295 states, 219 states have (on average 1.7716894977168949) internal successors, (388), 284 states have internal predecessors, (388), 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:45:08,053 INFO L74 IsIncluded]: Start isIncluded. First operand 490 states. Second operand has 295 states, 219 states have (on average 1.7716894977168949) internal successors, (388), 284 states have internal predecessors, (388), 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:45:08,055 INFO L87 Difference]: Start difference. First operand 490 states. Second operand has 295 states, 219 states have (on average 1.7716894977168949) internal successors, (388), 284 states have internal predecessors, (388), 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:45:08,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,066 INFO L93 Difference]: Finished difference Result 490 states and 599 transitions. [2022-02-20 23:45:08,066 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 599 transitions. [2022-02-20 23:45:08,067 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:08,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:08,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 295 states, 219 states have (on average 1.7716894977168949) internal successors, (388), 284 states have internal predecessors, (388), 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 490 states. [2022-02-20 23:45:08,069 INFO L87 Difference]: Start difference. First operand has 295 states, 219 states have (on average 1.7716894977168949) internal successors, (388), 284 states have internal predecessors, (388), 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 490 states. [2022-02-20 23:45:08,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,078 INFO L93 Difference]: Finished difference Result 490 states and 599 transitions. [2022-02-20 23:45:08,079 INFO L276 IsEmpty]: Start isEmpty. Operand 490 states and 599 transitions. [2022-02-20 23:45:08,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:08,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:08,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:08,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:08,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 295 states, 219 states have (on average 1.7716894977168949) internal successors, (388), 284 states have internal predecessors, (388), 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:45:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 295 states to 295 states and 404 transitions. [2022-02-20 23:45:08,084 INFO L78 Accepts]: Start accepts. Automaton has 295 states and 404 transitions. Word has length 15 [2022-02-20 23:45:08,084 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:08,084 INFO L470 AbstractCegarLoop]: Abstraction has 295 states and 404 transitions. [2022-02-20 23:45:08,085 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,085 INFO L276 IsEmpty]: Start isEmpty. Operand 295 states and 404 transitions. [2022-02-20 23:45:08,085 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2022-02-20 23:45:08,085 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:08,085 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:08,085 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2022-02-20 23:45:08,087 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:08,087 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:08,087 INFO L85 PathProgramCache]: Analyzing trace with hash -41167144, now seen corresponding path program 1 times [2022-02-20 23:45:08,088 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:08,088 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [303354248] [2022-02-20 23:45:08,088 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:08,088 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:08,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,164 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:08,167 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,174 INFO L290 TraceCheckUtils]: 0: Hoare triple {10063#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {10063#true} is VALID [2022-02-20 23:45:08,174 INFO L290 TraceCheckUtils]: 1: Hoare triple {10063#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {10063#true} is VALID [2022-02-20 23:45:08,175 INFO L290 TraceCheckUtils]: 2: Hoare triple {10063#true} assume true; {10063#true} is VALID [2022-02-20 23:45:08,175 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {10063#true} {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #308#return; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,176 INFO L290 TraceCheckUtils]: 0: Hoare triple {10063#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(12, 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); {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,176 INFO L290 TraceCheckUtils]: 1: Hoare triple {10065#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,177 INFO L290 TraceCheckUtils]: 2: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,177 INFO L290 TraceCheckUtils]: 3: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,178 INFO L290 TraceCheckUtils]: 4: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,178 INFO L290 TraceCheckUtils]: 5: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,180 INFO L290 TraceCheckUtils]: 6: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,180 INFO L290 TraceCheckUtils]: 7: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,180 INFO L272 TraceCheckUtils]: 8: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret34#1 := rand_end_point(); {10063#true} is VALID [2022-02-20 23:45:08,180 INFO L290 TraceCheckUtils]: 9: Hoare triple {10063#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {10063#true} is VALID [2022-02-20 23:45:08,181 INFO L290 TraceCheckUtils]: 10: Hoare triple {10063#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {10063#true} is VALID [2022-02-20 23:45:08,181 INFO L290 TraceCheckUtils]: 11: Hoare triple {10063#true} assume true; {10063#true} is VALID [2022-02-20 23:45:08,181 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {10063#true} {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #308#return; {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:08,182 INFO L290 TraceCheckUtils]: 13: Hoare triple {10065#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {10070#(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:45:08,182 INFO L290 TraceCheckUtils]: 14: Hoare triple {10070#(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); {10064#false} is VALID [2022-02-20 23:45:08,183 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:08,183 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:08,183 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [303354248] [2022-02-20 23:45:08,183 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [303354248] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:08,183 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:08,183 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:08,184 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [122844261] [2022-02-20 23:45:08,184 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:08,184 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:08,184 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:08,184 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,194 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 15 edges. 15 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:08,194 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:08,194 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:08,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:08,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:08,194 INFO L87 Difference]: Start difference. First operand 295 states and 404 transitions. Second operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,631 INFO L93 Difference]: Finished difference Result 393 states and 512 transitions. [2022-02-20 23:45:08,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:08,632 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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 15 [2022-02-20 23:45:08,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:08,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2022-02-20 23:45:08,634 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 292 transitions. [2022-02-20 23:45:08,637 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 292 transitions. [2022-02-20 23:45:08,865 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:45:08,872 INFO L225 Difference]: With dead ends: 393 [2022-02-20 23:45:08,872 INFO L226 Difference]: Without dead ends: 393 [2022-02-20 23:45:08,872 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:45:08,874 INFO L933 BasicCegarLoop]: 195 mSDtfsCounter, 343 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 343 SdHoareTripleChecker+Valid, 270 SdHoareTripleChecker+Invalid, 139 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:08,874 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [343 Valid, 270 Invalid, 139 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:08,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 393 states. [2022-02-20 23:45:08,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 393 to 292. [2022-02-20 23:45:08,879 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:08,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 393 states. Second operand has 292 states, 219 states have (on average 1.7168949771689497) internal successors, (376), 281 states have internal predecessors, (376), 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:45:08,881 INFO L74 IsIncluded]: Start isIncluded. First operand 393 states. Second operand has 292 states, 219 states have (on average 1.7168949771689497) internal successors, (376), 281 states have internal predecessors, (376), 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:45:08,882 INFO L87 Difference]: Start difference. First operand 393 states. Second operand has 292 states, 219 states have (on average 1.7168949771689497) internal successors, (376), 281 states have internal predecessors, (376), 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:45:08,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,889 INFO L93 Difference]: Finished difference Result 393 states and 512 transitions. [2022-02-20 23:45:08,889 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 512 transitions. [2022-02-20 23:45:08,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:08,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:08,890 INFO L74 IsIncluded]: Start isIncluded. First operand has 292 states, 219 states have (on average 1.7168949771689497) internal successors, (376), 281 states have internal predecessors, (376), 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 393 states. [2022-02-20 23:45:08,890 INFO L87 Difference]: Start difference. First operand has 292 states, 219 states have (on average 1.7168949771689497) internal successors, (376), 281 states have internal predecessors, (376), 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 393 states. [2022-02-20 23:45:08,898 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:08,899 INFO L93 Difference]: Finished difference Result 393 states and 512 transitions. [2022-02-20 23:45:08,899 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 512 transitions. [2022-02-20 23:45:08,899 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:08,899 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:08,899 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:08,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:08,900 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 292 states, 219 states have (on average 1.7168949771689497) internal successors, (376), 281 states have internal predecessors, (376), 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:45:08,904 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 292 states to 292 states and 392 transitions. [2022-02-20 23:45:08,904 INFO L78 Accepts]: Start accepts. Automaton has 292 states and 392 transitions. Word has length 15 [2022-02-20 23:45:08,905 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:08,906 INFO L470 AbstractCegarLoop]: Abstraction has 292 states and 392 transitions. [2022-02-20 23:45:08,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.333333333333333) internal successors, (13), 4 states have internal predecessors, (13), 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:45:08,906 INFO L276 IsEmpty]: Start isEmpty. Operand 292 states and 392 transitions. [2022-02-20 23:45:08,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:08,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:08,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:08,906 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 23:45:08,907 INFO L402 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:08,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:08,907 INFO L85 PathProgramCache]: Analyzing trace with hash 85672930, now seen corresponding path program 1 times [2022-02-20 23:45:08,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:08,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [925472541] [2022-02-20 23:45:08,907 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:08,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:08,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,979 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:08,981 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:08,986 INFO L290 TraceCheckUtils]: 0: Hoare triple {11546#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {11546#true} is VALID [2022-02-20 23:45:08,987 INFO L290 TraceCheckUtils]: 1: Hoare triple {11546#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {11546#true} is VALID [2022-02-20 23:45:08,987 INFO L290 TraceCheckUtils]: 2: Hoare triple {11546#true} assume true; {11546#true} is VALID [2022-02-20 23:45:08,987 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {11546#true} {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #306#return; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,988 INFO L290 TraceCheckUtils]: 0: Hoare triple {11546#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(12, 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); {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,989 INFO L290 TraceCheckUtils]: 1: Hoare triple {11548#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,989 INFO L290 TraceCheckUtils]: 2: Hoare triple {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,989 INFO L290 TraceCheckUtils]: 3: Hoare triple {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,991 INFO L290 TraceCheckUtils]: 4: Hoare triple {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,992 INFO L290 TraceCheckUtils]: 5: Hoare triple {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,992 INFO L272 TraceCheckUtils]: 6: Hoare triple {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret32#1 := rand_end_point(); {11546#true} is VALID [2022-02-20 23:45:08,992 INFO L290 TraceCheckUtils]: 7: Hoare triple {11546#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {11546#true} is VALID [2022-02-20 23:45:08,992 INFO L290 TraceCheckUtils]: 8: Hoare triple {11546#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {11546#true} is VALID [2022-02-20 23:45:08,992 INFO L290 TraceCheckUtils]: 9: Hoare triple {11546#true} assume true; {11546#true} is VALID [2022-02-20 23:45:08,993 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {11546#true} {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #306#return; {11548#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:08,997 INFO L290 TraceCheckUtils]: 11: Hoare triple {11548#(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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {11553#(and (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (or (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_create_item_~item~0#1.base|) (not (= 3 |ULTIMATE.start_create_item_~item~0#1.base|))))} is VALID [2022-02-20 23:45:08,998 INFO L290 TraceCheckUtils]: 12: Hoare triple {11553#(and (= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1) (or (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_create_item_~item~0#1.base|) (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); {11554#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:08,998 INFO L290 TraceCheckUtils]: 13: Hoare triple {11554#(= (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; {11554#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:08,999 INFO L290 TraceCheckUtils]: 14: Hoare triple {11554#(= (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; {11554#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:09,000 INFO L290 TraceCheckUtils]: 15: Hoare triple {11554#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} havoc create_item_#t~switch6#1; {11554#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} is VALID [2022-02-20 23:45:09,000 INFO L290 TraceCheckUtils]: 16: Hoare triple {11554#(= (select |#valid| |ULTIMATE.start_create_item_~cursor#1.base|) 1)} assume !(1 == #valid[create_item_~cursor#1.base]); {11547#false} is VALID [2022-02-20 23:45:09,000 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:09,001 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:09,001 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [925472541] [2022-02-20 23:45:09,001 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [925472541] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:09,001 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:09,001 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:09,001 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759503243] [2022-02-20 23:45:09,001 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:09,002 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,002 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:09,002 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,011 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:09,011 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:09,011 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:09,012 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:09,012 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:09,012 INFO L87 Difference]: Start difference. First operand 292 states and 392 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:09,914 INFO L93 Difference]: Finished difference Result 628 states and 735 transitions. [2022-02-20 23:45:09,914 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:09,914 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,914 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:09,914 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2022-02-20 23:45:09,918 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:09,921 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 677 transitions. [2022-02-20 23:45:09,921 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 677 transitions. [2022-02-20 23:45:10,361 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 677 edges. 677 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:10,373 INFO L225 Difference]: With dead ends: 628 [2022-02-20 23:45:10,373 INFO L226 Difference]: Without dead ends: 628 [2022-02-20 23:45:10,373 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:45:10,373 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 763 mSDsluCounter, 335 mSDsCounter, 0 mSdLazyCounter, 335 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 765 SdHoareTripleChecker+Valid, 538 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 335 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:10,374 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [765 Valid, 538 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 335 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:10,374 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 628 states. [2022-02-20 23:45:10,378 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 628 to 289. [2022-02-20 23:45:10,379 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:10,379 INFO L82 GeneralOperation]: Start isEquivalent. First operand 628 states. Second operand has 289 states, 220 states have (on average 1.6818181818181819) internal successors, (370), 278 states have internal predecessors, (370), 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:45:10,379 INFO L74 IsIncluded]: Start isIncluded. First operand 628 states. Second operand has 289 states, 220 states have (on average 1.6818181818181819) internal successors, (370), 278 states have internal predecessors, (370), 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:45:10,380 INFO L87 Difference]: Start difference. First operand 628 states. Second operand has 289 states, 220 states have (on average 1.6818181818181819) internal successors, (370), 278 states have internal predecessors, (370), 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:45:10,392 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:10,394 INFO L93 Difference]: Finished difference Result 628 states and 735 transitions. [2022-02-20 23:45:10,394 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 735 transitions. [2022-02-20 23:45:10,395 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:10,395 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:10,395 INFO L74 IsIncluded]: Start isIncluded. First operand has 289 states, 220 states have (on average 1.6818181818181819) internal successors, (370), 278 states have internal predecessors, (370), 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 628 states. [2022-02-20 23:45:10,397 INFO L87 Difference]: Start difference. First operand has 289 states, 220 states have (on average 1.6818181818181819) internal successors, (370), 278 states have internal predecessors, (370), 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 628 states. [2022-02-20 23:45:10,409 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:10,409 INFO L93 Difference]: Finished difference Result 628 states and 735 transitions. [2022-02-20 23:45:10,410 INFO L276 IsEmpty]: Start isEmpty. Operand 628 states and 735 transitions. [2022-02-20 23:45:10,410 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:10,411 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:10,411 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:10,411 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:10,414 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 289 states, 220 states have (on average 1.6818181818181819) internal successors, (370), 278 states have internal predecessors, (370), 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:45:10,418 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 289 states to 289 states and 386 transitions. [2022-02-20 23:45:10,419 INFO L78 Accepts]: Start accepts. Automaton has 289 states and 386 transitions. Word has length 17 [2022-02-20 23:45:10,419 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:10,419 INFO L470 AbstractCegarLoop]: Abstraction has 289 states and 386 transitions. [2022-02-20 23:45:10,419 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 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:45:10,419 INFO L276 IsEmpty]: Start isEmpty. Operand 289 states and 386 transitions. [2022-02-20 23:45:10,419 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:10,419 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:10,420 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:10,420 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2022-02-20 23:45:10,420 INFO L402 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:10,420 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:10,420 INFO L85 PathProgramCache]: Analyzing trace with hash 85672931, now seen corresponding path program 1 times [2022-02-20 23:45:10,420 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:10,420 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1812927358] [2022-02-20 23:45:10,421 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:10,421 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:10,431 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:10,490 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:10,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:10,516 INFO L290 TraceCheckUtils]: 0: Hoare triple {13734#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {13734#true} is VALID [2022-02-20 23:45:10,517 INFO L290 TraceCheckUtils]: 1: Hoare triple {13734#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,523 INFO L290 TraceCheckUtils]: 2: Hoare triple {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,524 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {13741#(and (= 3 |~#list~0.base|) (= (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:45:10,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {13734#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(12, 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); {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,527 INFO L290 TraceCheckUtils]: 1: Hoare triple {13736#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,527 INFO L290 TraceCheckUtils]: 2: Hoare triple {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:10,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {13734#true} is VALID [2022-02-20 23:45:10,530 INFO L290 TraceCheckUtils]: 7: Hoare triple {13734#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {13734#true} is VALID [2022-02-20 23:45:10,530 INFO L290 TraceCheckUtils]: 8: Hoare triple {13734#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:10,531 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {13743#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {13736#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {13741#(and (= 3 |~#list~0.base|) (= (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:45:10,532 INFO L290 TraceCheckUtils]: 11: Hoare triple {13741#(and (= 3 |~#list~0.base|) (= (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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {13742#(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:45:10,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {13742#(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); {13742#(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:45:10,533 INFO L290 TraceCheckUtils]: 13: Hoare triple {13742#(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; {13742#(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:45:10,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {13742#(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; {13742#(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:45:10,534 INFO L290 TraceCheckUtils]: 15: Hoare triple {13742#(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; {13742#(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:45:10,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {13742#(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); {13735#false} is VALID [2022-02-20 23:45:10,534 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:10,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:10,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1812927358] [2022-02-20 23:45:10,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1812927358] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:10,535 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:10,535 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:10,535 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [937249925] [2022-02-20 23:45:10,535 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:10,535 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:45:10,536 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:10,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:45:10,546 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:10,546 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:10,546 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:10,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:10,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:10,547 INFO L87 Difference]: Start difference. First operand 289 states and 386 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:45:11,592 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:11,592 INFO L93 Difference]: Finished difference Result 594 states and 794 transitions. [2022-02-20 23:45:11,592 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:45:11,592 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 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:45:11,592 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:11,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:45:11,595 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2022-02-20 23:45:11,595 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:45:11,596 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 419 transitions. [2022-02-20 23:45:11,596 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 419 transitions. [2022-02-20 23:45:11,939 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 419 edges. 419 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:11,950 INFO L225 Difference]: With dead ends: 594 [2022-02-20 23:45:11,950 INFO L226 Difference]: Without dead ends: 594 [2022-02-20 23:45:11,950 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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:45:11,951 INFO L933 BasicCegarLoop]: 186 mSDtfsCounter, 538 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 540 SdHoareTripleChecker+Valid, 698 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:11,951 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [540 Valid, 698 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:11,952 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 594 states. [2022-02-20 23:45:11,962 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 594 to 351. [2022-02-20 23:45:11,963 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:11,963 INFO L82 GeneralOperation]: Start isEquivalent. First operand 594 states. Second operand has 351 states, 278 states have (on average 1.6654676258992807) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:11,964 INFO L74 IsIncluded]: Start isIncluded. First operand 594 states. Second operand has 351 states, 278 states have (on average 1.6654676258992807) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:11,964 INFO L87 Difference]: Start difference. First operand 594 states. Second operand has 351 states, 278 states have (on average 1.6654676258992807) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:11,976 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:11,976 INFO L93 Difference]: Finished difference Result 594 states and 794 transitions. [2022-02-20 23:45:11,976 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 794 transitions. [2022-02-20 23:45:11,977 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:11,977 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:11,978 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 278 states have (on average 1.6654676258992807) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 594 states. [2022-02-20 23:45:11,978 INFO L87 Difference]: Start difference. First operand has 351 states, 278 states have (on average 1.6654676258992807) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 594 states. [2022-02-20 23:45:11,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:11,991 INFO L93 Difference]: Finished difference Result 594 states and 794 transitions. [2022-02-20 23:45:11,991 INFO L276 IsEmpty]: Start isEmpty. Operand 594 states and 794 transitions. [2022-02-20 23:45:11,992 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:11,992 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:11,992 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:11,993 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:11,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.6654676258992807) internal successors, (463), 338 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:11,998 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 487 transitions. [2022-02-20 23:45:11,998 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 487 transitions. Word has length 17 [2022-02-20 23:45:11,998 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:11,998 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 487 transitions. [2022-02-20 23:45:11,998 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 23:45:11,998 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 487 transitions. [2022-02-20 23:45:11,998 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2022-02-20 23:45:11,999 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:11,999 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:11,999 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2022-02-20 23:45:11,999 INFO L402 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:11,999 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:11,999 INFO L85 PathProgramCache]: Analyzing trace with hash -1721781532, now seen corresponding path program 1 times [2022-02-20 23:45:12,000 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:12,000 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2005958163] [2022-02-20 23:45:12,000 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:12,000 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:12,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:12,048 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:12,050 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:12,058 INFO L290 TraceCheckUtils]: 0: Hoare triple {15887#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {15887#true} is VALID [2022-02-20 23:45:12,059 INFO L290 TraceCheckUtils]: 1: Hoare triple {15887#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:12,059 INFO L290 TraceCheckUtils]: 2: Hoare triple {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:12,059 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {15887#true} #306#return; {15893#(<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|)} is VALID [2022-02-20 23:45:12,059 INFO L290 TraceCheckUtils]: 0: Hoare triple {15887#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(12, 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); {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L290 TraceCheckUtils]: 1: Hoare triple {15887#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L290 TraceCheckUtils]: 2: Hoare triple {15887#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L290 TraceCheckUtils]: 3: Hoare triple {15887#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L290 TraceCheckUtils]: 4: Hoare triple {15887#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L290 TraceCheckUtils]: 5: Hoare triple {15887#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L272 TraceCheckUtils]: 6: Hoare triple {15887#true} call main_#t~ret32#1 := rand_end_point(); {15887#true} is VALID [2022-02-20 23:45:12,060 INFO L290 TraceCheckUtils]: 7: Hoare triple {15887#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {15887#true} is VALID [2022-02-20 23:45:12,061 INFO L290 TraceCheckUtils]: 8: Hoare triple {15887#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:12,061 INFO L290 TraceCheckUtils]: 9: Hoare triple {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:12,061 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {15896#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {15887#true} #306#return; {15893#(<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|)} is VALID [2022-02-20 23:45:12,062 INFO L290 TraceCheckUtils]: 11: Hoare triple {15893#(<= ~unnamed1~0~LIST_END |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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {15894#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:12,063 INFO L290 TraceCheckUtils]: 12: Hoare triple {15894#(not (= ~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); {15894#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:12,063 INFO L290 TraceCheckUtils]: 13: Hoare triple {15894#(not (= ~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; {15895#(not |ULTIMATE.start_create_item_#t~switch6#1|)} is VALID [2022-02-20 23:45:12,063 INFO L290 TraceCheckUtils]: 14: Hoare triple {15895#(not |ULTIMATE.start_create_item_#t~switch6#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; {15888#false} is VALID [2022-02-20 23:45:12,063 INFO L290 TraceCheckUtils]: 15: Hoare triple {15888#false} havoc create_item_#t~switch6#1; {15888#false} is VALID [2022-02-20 23:45:12,063 INFO L290 TraceCheckUtils]: 16: Hoare triple {15888#false} assume !(4 + create_item_~cursor#1.offset <= #length[create_item_~cursor#1.base] && 0 <= create_item_~cursor#1.offset); {15888#false} is VALID [2022-02-20 23:45:12,064 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:12,064 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:12,064 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2005958163] [2022-02-20 23:45:12,064 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2005958163] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:12,064 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:12,064 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:12,064 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2063133297] [2022-02-20 23:45:12,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:12,065 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,065 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:12,065 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,074 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 17 edges. 17 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:12,074 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:12,074 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:12,075 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:12,075 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:12,077 INFO L87 Difference]: Start difference. First operand 351 states and 487 transitions. Second operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:12,648 INFO L93 Difference]: Finished difference Result 559 states and 756 transitions. [2022-02-20 23:45:12,648 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:12,648 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,648 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:12,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,650 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2022-02-20 23:45:12,650 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,652 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 359 transitions. [2022-02-20 23:45:12,652 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 359 transitions. [2022-02-20 23:45:12,853 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:45:12,863 INFO L225 Difference]: With dead ends: 559 [2022-02-20 23:45:12,863 INFO L226 Difference]: Without dead ends: 559 [2022-02-20 23:45:12,863 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:45:12,864 INFO L933 BasicCegarLoop]: 349 mSDtfsCounter, 231 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 32 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 233 SdHoareTripleChecker+Valid, 1493 SdHoareTripleChecker+Invalid, 35 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 32 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:12,864 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [233 Valid, 1493 Invalid, 35 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 32 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:12,864 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2022-02-20 23:45:12,872 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 351. [2022-02-20 23:45:12,872 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:12,873 INFO L82 GeneralOperation]: Start isEquivalent. First operand 559 states. Second operand has 351 states, 278 states have (on average 1.658273381294964) internal successors, (461), 338 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:12,874 INFO L74 IsIncluded]: Start isIncluded. First operand 559 states. Second operand has 351 states, 278 states have (on average 1.658273381294964) internal successors, (461), 338 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:12,875 INFO L87 Difference]: Start difference. First operand 559 states. Second operand has 351 states, 278 states have (on average 1.658273381294964) internal successors, (461), 338 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:12,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:12,886 INFO L93 Difference]: Finished difference Result 559 states and 756 transitions. [2022-02-20 23:45:12,886 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 756 transitions. [2022-02-20 23:45:12,887 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:12,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:12,888 INFO L74 IsIncluded]: Start isIncluded. First operand has 351 states, 278 states have (on average 1.658273381294964) internal successors, (461), 338 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 559 states. [2022-02-20 23:45:12,888 INFO L87 Difference]: Start difference. First operand has 351 states, 278 states have (on average 1.658273381294964) internal successors, (461), 338 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 559 states. [2022-02-20 23:45:12,899 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:12,899 INFO L93 Difference]: Finished difference Result 559 states and 756 transitions. [2022-02-20 23:45:12,899 INFO L276 IsEmpty]: Start isEmpty. Operand 559 states and 756 transitions. [2022-02-20 23:45:12,900 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:12,900 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:12,900 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:12,900 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:12,901 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 351 states, 278 states have (on average 1.658273381294964) internal successors, (461), 338 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:12,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 351 states to 351 states and 485 transitions. [2022-02-20 23:45:12,905 INFO L78 Accepts]: Start accepts. Automaton has 351 states and 485 transitions. Word has length 17 [2022-02-20 23:45:12,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:12,906 INFO L470 AbstractCegarLoop]: Abstraction has 351 states and 485 transitions. [2022-02-20 23:45:12,906 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 2.5) internal successors, (15), 5 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:45:12,906 INFO L276 IsEmpty]: Start isEmpty. Operand 351 states and 485 transitions. [2022-02-20 23:45:12,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2022-02-20 23:45:12,906 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:12,906 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:12,907 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2022-02-20 23:45:12,907 INFO L402 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:12,907 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:12,907 INFO L85 PathProgramCache]: Analyzing trace with hash -1835564363, now seen corresponding path program 1 times [2022-02-20 23:45:12,907 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:12,907 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1583656698] [2022-02-20 23:45:12,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:12,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:12,916 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:12,966 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:12,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:12,979 INFO L290 TraceCheckUtils]: 0: Hoare triple {17931#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {17931#true} is VALID [2022-02-20 23:45:12,980 INFO L290 TraceCheckUtils]: 1: Hoare triple {17931#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:12,980 INFO L290 TraceCheckUtils]: 2: Hoare triple {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:12,981 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {17938#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_END 4)) (<= (* ~unnamed1~0~LIST_END 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} is VALID [2022-02-20 23:45:12,982 INFO L290 TraceCheckUtils]: 0: Hoare triple {17931#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(12, 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); {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:12,982 INFO L290 TraceCheckUtils]: 1: Hoare triple {17933#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:12,982 INFO L290 TraceCheckUtils]: 2: Hoare triple {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:12,983 INFO L290 TraceCheckUtils]: 3: Hoare triple {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:12,983 INFO L290 TraceCheckUtils]: 4: Hoare triple {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:12,984 INFO L290 TraceCheckUtils]: 5: Hoare triple {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:12,984 INFO L272 TraceCheckUtils]: 6: Hoare triple {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {17931#true} is VALID [2022-02-20 23:45:12,984 INFO L290 TraceCheckUtils]: 7: Hoare triple {17931#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {17931#true} is VALID [2022-02-20 23:45:12,984 INFO L290 TraceCheckUtils]: 8: Hoare triple {17931#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:12,984 INFO L290 TraceCheckUtils]: 9: Hoare triple {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:12,985 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {17940#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {17933#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {17938#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_END 4)) (<= (* ~unnamed1~0~LIST_END 4) (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|))))} is VALID [2022-02-20 23:45:12,986 INFO L290 TraceCheckUtils]: 11: Hoare triple {17938#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= (+ |~#list~0.offset| (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (* ~unnamed1~0~LIST_END 4)) (<= (* ~unnamed1~0~LIST_END 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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:12,987 INFO L290 TraceCheckUtils]: 12: Hoare triple {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 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); {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:12,987 INFO L290 TraceCheckUtils]: 13: Hoare triple {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 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; {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:12,987 INFO L290 TraceCheckUtils]: 14: Hoare triple {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:12,988 INFO L290 TraceCheckUtils]: 15: Hoare triple {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 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_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:12,988 INFO L290 TraceCheckUtils]: 16: Hoare triple {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} havoc create_item_#t~switch6#1; {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 4)) (= (select |#length| |ULTIMATE.start_create_item_~cursor#1.base|) 8))} is VALID [2022-02-20 23:45:12,989 INFO L290 TraceCheckUtils]: 17: Hoare triple {17939#(and (<= (* ~unnamed1~0~LIST_END 4) |ULTIMATE.start_create_item_~cursor#1.offset|) (<= |ULTIMATE.start_create_item_~cursor#1.offset| (* ~unnamed1~0~LIST_END 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); {17932#false} is VALID [2022-02-20 23:45:12,989 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:12,989 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:12,989 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1583656698] [2022-02-20 23:45:12,989 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1583656698] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:12,989 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:12,990 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:12,990 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [843511652] [2022-02-20 23:45:12,990 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:12,990 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) 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:45:12,990 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:12,991 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), 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:45:13,002 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:13,002 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:13,002 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:13,002 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:13,003 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:13,003 INFO L87 Difference]: Start difference. First operand 351 states and 485 transitions. Second operand has 6 states, 5 states have (on average 3.2) 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:45:14,192 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,192 INFO L93 Difference]: Finished difference Result 635 states and 863 transitions. [2022-02-20 23:45:14,192 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 23:45:14,192 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) 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:45:14,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:14,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) 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:45:14,194 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 418 transitions. [2022-02-20 23:45:14,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 3.2) 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:45:14,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 418 transitions. [2022-02-20 23:45:14,196 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 418 transitions. [2022-02-20 23:45:14,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 418 edges. 418 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:14,504 INFO L225 Difference]: With dead ends: 635 [2022-02-20 23:45:14,504 INFO L226 Difference]: Without dead ends: 635 [2022-02-20 23:45:14,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 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:45:14,505 INFO L933 BasicCegarLoop]: 246 mSDtfsCounter, 450 mSDsluCounter, 590 mSDsCounter, 0 mSdLazyCounter, 407 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 450 SdHoareTripleChecker+Valid, 836 SdHoareTripleChecker+Invalid, 415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:14,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [450 Valid, 836 Invalid, 415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 407 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:14,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 635 states. [2022-02-20 23:45:14,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 635 to 346. [2022-02-20 23:45:14,511 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:14,511 INFO L82 GeneralOperation]: Start isEquivalent. First operand 635 states. Second operand has 346 states, 273 states have (on average 1.6593406593406594) internal successors, (453), 333 states have internal predecessors, (453), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:14,512 INFO L74 IsIncluded]: Start isIncluded. First operand 635 states. Second operand has 346 states, 273 states have (on average 1.6593406593406594) internal successors, (453), 333 states have internal predecessors, (453), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:14,512 INFO L87 Difference]: Start difference. First operand 635 states. Second operand has 346 states, 273 states have (on average 1.6593406593406594) internal successors, (453), 333 states have internal predecessors, (453), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:14,524 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,524 INFO L93 Difference]: Finished difference Result 635 states and 863 transitions. [2022-02-20 23:45:14,524 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 863 transitions. [2022-02-20 23:45:14,525 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,525 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,526 INFO L74 IsIncluded]: Start isIncluded. First operand has 346 states, 273 states have (on average 1.6593406593406594) internal successors, (453), 333 states have internal predecessors, (453), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 635 states. [2022-02-20 23:45:14,526 INFO L87 Difference]: Start difference. First operand has 346 states, 273 states have (on average 1.6593406593406594) internal successors, (453), 333 states have internal predecessors, (453), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 635 states. [2022-02-20 23:45:14,538 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:14,538 INFO L93 Difference]: Finished difference Result 635 states and 863 transitions. [2022-02-20 23:45:14,538 INFO L276 IsEmpty]: Start isEmpty. Operand 635 states and 863 transitions. [2022-02-20 23:45:14,539 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:14,539 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:14,539 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:14,540 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:14,541 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 346 states, 273 states have (on average 1.6593406593406594) internal successors, (453), 333 states have internal predecessors, (453), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:14,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 346 states to 346 states and 477 transitions. [2022-02-20 23:45:14,545 INFO L78 Accepts]: Start accepts. Automaton has 346 states and 477 transitions. Word has length 18 [2022-02-20 23:45:14,545 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:14,545 INFO L470 AbstractCegarLoop]: Abstraction has 346 states and 477 transitions. [2022-02-20 23:45:14,545 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) 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:45:14,546 INFO L276 IsEmpty]: Start isEmpty. Operand 346 states and 477 transitions. [2022-02-20 23:45:14,546 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:14,546 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:14,546 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:14,546 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2022-02-20 23:45:14,546 INFO L402 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:14,547 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:14,547 INFO L85 PathProgramCache]: Analyzing trace with hash 1066754491, now seen corresponding path program 1 times [2022-02-20 23:45:14,547 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:14,547 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1138480986] [2022-02-20 23:45:14,547 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:14,547 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:14,566 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:14,787 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:14,789 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:14,791 INFO L290 TraceCheckUtils]: 0: Hoare triple {20202#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {20202#true} is VALID [2022-02-20 23:45:14,792 INFO L290 TraceCheckUtils]: 1: Hoare triple {20202#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {20202#true} is VALID [2022-02-20 23:45:14,792 INFO L290 TraceCheckUtils]: 2: Hoare triple {20202#true} assume true; {20202#true} is VALID [2022-02-20 23:45:14,792 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {20202#true} {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} #308#return; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {20202#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(12, 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); {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,793 INFO L290 TraceCheckUtils]: 1: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,794 INFO L290 TraceCheckUtils]: 3: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,796 INFO L290 TraceCheckUtils]: 6: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,796 INFO L290 TraceCheckUtils]: 7: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,796 INFO L272 TraceCheckUtils]: 8: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} call main_#t~ret34#1 := rand_end_point(); {20202#true} is VALID [2022-02-20 23:45:14,797 INFO L290 TraceCheckUtils]: 9: Hoare triple {20202#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {20202#true} is VALID [2022-02-20 23:45:14,797 INFO L290 TraceCheckUtils]: 10: Hoare triple {20202#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {20202#true} is VALID [2022-02-20 23:45:14,797 INFO L290 TraceCheckUtils]: 11: Hoare triple {20202#true} assume true; {20202#true} is VALID [2022-02-20 23:45:14,797 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {20202#true} {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} #308#return; {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:14,798 INFO L290 TraceCheckUtils]: 13: Hoare triple {20204#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#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))) (<= 0 |~#list~0.offset|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {20209#(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| 0)))} is VALID [2022-02-20 23:45:14,799 INFO L290 TraceCheckUtils]: 14: Hoare triple {20209#(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| 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: L655 {20210#(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| 0)))} is VALID [2022-02-20 23:45:14,799 INFO L290 TraceCheckUtils]: 15: Hoare triple {20210#(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| 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; {20211#(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| 0)))} is VALID [2022-02-20 23:45:14,800 INFO L290 TraceCheckUtils]: 16: Hoare triple {20211#(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| 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: L656 {20212#(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)) (not (= |ULTIMATE.start_is_empty_~list#1.offset| 0)))} is VALID [2022-02-20 23:45:14,804 INFO L290 TraceCheckUtils]: 17: Hoare triple {20212#(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)) (not (= |ULTIMATE.start_is_empty_~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; {20213#(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| 0)))} is VALID [2022-02-20 23:45:14,804 INFO L290 TraceCheckUtils]: 18: Hoare triple {20213#(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| 0)))} assume is_empty_~no_beg~0#1 != is_empty_~no_end~0#1; {20214#(not (= |ULTIMATE.start_is_empty_~list#1.offset| 0))} is VALID [2022-02-20 23:45:14,805 INFO L290 TraceCheckUtils]: 19: Hoare triple {20214#(not (= |ULTIMATE.start_is_empty_~list#1.offset| 0))} assume 0 == is_empty_~list#1.offset; {20203#false} is VALID [2022-02-20 23:45:14,805 INFO L290 TraceCheckUtils]: 20: Hoare triple {20203#false} assume !(is_empty_~list#1.base < #StackHeapBarrier); {20203#false} is VALID [2022-02-20 23:45:14,805 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:14,805 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:14,805 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1138480986] [2022-02-20 23:45:14,805 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1138480986] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:14,806 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:14,806 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:14,806 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580259973] [2022-02-20 23:45:14,806 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:14,806 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 21 [2022-02-20 23:45:14,806 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:14,807 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:45:14,820 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:14,820 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 23:45:14,820 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:14,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 23:45:14,821 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=52, Unknown=0, NotChecked=0, Total=72 [2022-02-20 23:45:14,821 INFO L87 Difference]: Start difference. First operand 346 states and 477 transitions. Second operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:45:16,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:16,610 INFO L93 Difference]: Finished difference Result 753 states and 1012 transitions. [2022-02-20 23:45:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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 21 [2022-02-20 23:45:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:16,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:45:16,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 503 transitions. [2022-02-20 23:45:16,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:45:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 503 transitions. [2022-02-20 23:45:16,615 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 503 transitions. [2022-02-20 23:45:16,970 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 503 edges. 503 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:16,986 INFO L225 Difference]: With dead ends: 753 [2022-02-20 23:45:16,986 INFO L226 Difference]: Without dead ends: 751 [2022-02-20 23:45:16,986 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:45:16,987 INFO L933 BasicCegarLoop]: 248 mSDtfsCounter, 563 mSDsluCounter, 1295 mSDsCounter, 0 mSdLazyCounter, 337 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 565 SdHoareTripleChecker+Valid, 1543 SdHoareTripleChecker+Invalid, 358 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 337 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:16,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [565 Valid, 1543 Invalid, 358 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 337 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:16,987 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 751 states. [2022-02-20 23:45:17,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 751 to 340. [2022-02-20 23:45:17,000 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:17,001 INFO L82 GeneralOperation]: Start isEquivalent. First operand 751 states. Second operand has 340 states, 267 states have (on average 1.655430711610487) internal successors, (442), 327 states have internal predecessors, (442), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:17,001 INFO L74 IsIncluded]: Start isIncluded. First operand 751 states. Second operand has 340 states, 267 states have (on average 1.655430711610487) internal successors, (442), 327 states have internal predecessors, (442), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:17,002 INFO L87 Difference]: Start difference. First operand 751 states. Second operand has 340 states, 267 states have (on average 1.655430711610487) internal successors, (442), 327 states have internal predecessors, (442), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:17,020 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,021 INFO L93 Difference]: Finished difference Result 751 states and 1010 transitions. [2022-02-20 23:45:17,021 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1010 transitions. [2022-02-20 23:45:17,022 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,023 INFO L74 IsIncluded]: Start isIncluded. First operand has 340 states, 267 states have (on average 1.655430711610487) internal successors, (442), 327 states have internal predecessors, (442), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 751 states. [2022-02-20 23:45:17,023 INFO L87 Difference]: Start difference. First operand has 340 states, 267 states have (on average 1.655430711610487) internal successors, (442), 327 states have internal predecessors, (442), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) Second operand 751 states. [2022-02-20 23:45:17,040 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:17,040 INFO L93 Difference]: Finished difference Result 751 states and 1010 transitions. [2022-02-20 23:45:17,041 INFO L276 IsEmpty]: Start isEmpty. Operand 751 states and 1010 transitions. [2022-02-20 23:45:17,043 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:17,043 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:17,043 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:17,043 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:17,044 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 340 states, 267 states have (on average 1.655430711610487) internal successors, (442), 327 states have internal predecessors, (442), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 8 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:17,048 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 340 states to 340 states and 466 transitions. [2022-02-20 23:45:17,049 INFO L78 Accepts]: Start accepts. Automaton has 340 states and 466 transitions. Word has length 21 [2022-02-20 23:45:17,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:17,049 INFO L470 AbstractCegarLoop]: Abstraction has 340 states and 466 transitions. [2022-02-20 23:45:17,049 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.111111111111111) internal successors, (19), 9 states have internal predecessors, (19), 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:45:17,049 INFO L276 IsEmpty]: Start isEmpty. Operand 340 states and 466 transitions. [2022-02-20 23:45:17,049 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 23:45:17,050 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:17,050 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:17,050 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2022-02-20 23:45:17,050 INFO L402 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:17,050 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:17,050 INFO L85 PathProgramCache]: Analyzing trace with hash -1136706200, now seen corresponding path program 1 times [2022-02-20 23:45:17,051 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:17,051 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [328278903] [2022-02-20 23:45:17,051 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:17,051 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:17,070 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,212 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:17,214 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:17,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {22824#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {22824#true} is VALID [2022-02-20 23:45:17,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {22824#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {22824#true} is VALID [2022-02-20 23:45:17,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {22824#true} assume true; {22824#true} is VALID [2022-02-20 23:45:17,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {22824#true} {22826#(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))} #306#return; {22826#(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:45:17,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {22824#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(12, 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); {22826#(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:45:17,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {22826#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {22826#(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:45:17,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {22826#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {22826#(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:45:17,220 INFO L290 TraceCheckUtils]: 3: Hoare triple {22826#(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 !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {22826#(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:45:17,220 INFO L290 TraceCheckUtils]: 4: Hoare triple {22826#(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~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {22826#(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:45:17,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {22826#(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 !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {22826#(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:45:17,221 INFO L272 TraceCheckUtils]: 6: Hoare triple {22826#(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(); {22824#true} is VALID [2022-02-20 23:45:17,221 INFO L290 TraceCheckUtils]: 7: Hoare triple {22824#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {22824#true} is VALID [2022-02-20 23:45:17,221 INFO L290 TraceCheckUtils]: 8: Hoare triple {22824#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {22824#true} is VALID [2022-02-20 23:45:17,221 INFO L290 TraceCheckUtils]: 9: Hoare triple {22824#true} assume true; {22824#true} is VALID [2022-02-20 23:45:17,222 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {22824#true} {22826#(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))} #306#return; {22826#(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:45:17,222 INFO L290 TraceCheckUtils]: 11: Hoare triple {22826#(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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {22831#(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:45:17,223 INFO L290 TraceCheckUtils]: 12: Hoare triple {22831#(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); {22831#(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:45:17,224 INFO L290 TraceCheckUtils]: 13: Hoare triple {22831#(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; {22832#(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:45:17,224 INFO L290 TraceCheckUtils]: 14: Hoare triple {22832#(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; {22833#(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:45:17,225 INFO L290 TraceCheckUtils]: 15: Hoare triple {22833#(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; {22833#(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:45:17,225 INFO L290 TraceCheckUtils]: 16: Hoare triple {22833#(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: L677-12 {22834#(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:45:17,226 INFO L290 TraceCheckUtils]: 17: Hoare triple {22834#(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; {22835#(and (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (not |ULTIMATE.start_create_item_#t~short10#1|))} is VALID [2022-02-20 23:45:17,226 INFO L290 TraceCheckUtils]: 18: Hoare triple {22835#(and (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (not |ULTIMATE.start_create_item_#t~short10#1|))} assume create_item_#t~short10#1; {22825#false} is VALID [2022-02-20 23:45:17,226 INFO L290 TraceCheckUtils]: 19: Hoare triple {22825#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: L677-3 {22825#false} is VALID [2022-02-20 23:45:17,226 INFO L290 TraceCheckUtils]: 20: Hoare triple {22825#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {22825#false} is VALID [2022-02-20 23:45:17,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:17,227 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:17,227 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [328278903] [2022-02-20 23:45:17,227 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [328278903] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:17,227 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:17,227 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:45:17,227 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [731161821] [2022-02-20 23:45:17,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:17,228 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2022-02-20 23:45:17,228 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:17,228 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:45:17,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 21 edges. 21 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:17,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:17,242 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:17,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:17,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:17,242 INFO L87 Difference]: Start difference. First operand 340 states and 466 transitions. Second operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:45:18,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:18,066 INFO L93 Difference]: Finished difference Result 496 states and 644 transitions. [2022-02-20 23:45:18,066 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:18,066 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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 21 [2022-02-20 23:45:18,066 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:18,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:45:18,068 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 337 transitions. [2022-02-20 23:45:18,068 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:45:18,070 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 337 transitions. [2022-02-20 23:45:18,070 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 337 transitions. [2022-02-20 23:45:18,277 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:18,285 INFO L225 Difference]: With dead ends: 496 [2022-02-20 23:45:18,285 INFO L226 Difference]: Without dead ends: 496 [2022-02-20 23:45:18,285 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:45:18,286 INFO L933 BasicCegarLoop]: 163 mSDtfsCounter, 221 mSDsluCounter, 744 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 221 SdHoareTripleChecker+Valid, 907 SdHoareTripleChecker+Invalid, 227 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:18,286 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [221 Valid, 907 Invalid, 227 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 222 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:18,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 496 states. [2022-02-20 23:45:18,293 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 496 to 356. [2022-02-20 23:45:18,293 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:18,294 INFO L82 GeneralOperation]: Start isEquivalent. First operand 496 states. Second operand has 356 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 341 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:18,294 INFO L74 IsIncluded]: Start isIncluded. First operand 496 states. Second operand has 356 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 341 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:18,295 INFO L87 Difference]: Start difference. First operand 496 states. Second operand has 356 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 341 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:18,303 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:18,303 INFO L93 Difference]: Finished difference Result 496 states and 644 transitions. [2022-02-20 23:45:18,303 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 644 transitions. [2022-02-20 23:45:18,304 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:18,304 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:18,304 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 341 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Second operand 496 states. [2022-02-20 23:45:18,305 INFO L87 Difference]: Start difference. First operand has 356 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 341 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Second operand 496 states. [2022-02-20 23:45:18,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:18,313 INFO L93 Difference]: Finished difference Result 496 states and 644 transitions. [2022-02-20 23:45:18,314 INFO L276 IsEmpty]: Start isEmpty. Operand 496 states and 644 transitions. [2022-02-20 23:45:18,314 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:18,314 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:18,314 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:18,314 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:18,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 283 states have (on average 1.6289752650176679) internal successors, (461), 341 states have internal predecessors, (461), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:18,320 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 485 transitions. [2022-02-20 23:45:18,320 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 485 transitions. Word has length 21 [2022-02-20 23:45:18,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:18,320 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 485 transitions. [2022-02-20 23:45:18,320 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.375) internal successors, (19), 8 states have internal predecessors, (19), 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:45:18,321 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 485 transitions. [2022-02-20 23:45:18,321 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:18,321 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:18,321 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:18,322 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2022-02-20 23:45:18,322 INFO L402 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:18,323 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:18,323 INFO L85 PathProgramCache]: Analyzing trace with hash -1088554597, now seen corresponding path program 1 times [2022-02-20 23:45:18,323 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:18,323 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2091774235] [2022-02-20 23:45:18,323 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:18,324 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:18,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:18,371 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:18,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:18,386 INFO L290 TraceCheckUtils]: 0: Hoare triple {24692#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {24692#true} is VALID [2022-02-20 23:45:18,386 INFO L290 TraceCheckUtils]: 1: Hoare triple {24692#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:18,387 INFO L290 TraceCheckUtils]: 2: Hoare triple {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:18,387 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {24692#true} #306#return; {24698#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:18,387 INFO L290 TraceCheckUtils]: 0: Hoare triple {24692#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(12, 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); {24692#true} is VALID [2022-02-20 23:45:18,388 INFO L290 TraceCheckUtils]: 1: Hoare triple {24692#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {24692#true} is VALID [2022-02-20 23:45:18,388 INFO L290 TraceCheckUtils]: 2: Hoare triple {24692#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {24692#true} is VALID [2022-02-20 23:45:18,388 INFO L290 TraceCheckUtils]: 3: Hoare triple {24692#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {24692#true} is VALID [2022-02-20 23:45:18,388 INFO L290 TraceCheckUtils]: 4: Hoare triple {24692#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {24692#true} is VALID [2022-02-20 23:45:18,388 INFO L290 TraceCheckUtils]: 5: Hoare triple {24692#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {24692#true} is VALID [2022-02-20 23:45:18,388 INFO L272 TraceCheckUtils]: 6: Hoare triple {24692#true} call main_#t~ret32#1 := rand_end_point(); {24692#true} is VALID [2022-02-20 23:45:18,393 INFO L290 TraceCheckUtils]: 7: Hoare triple {24692#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {24692#true} is VALID [2022-02-20 23:45:18,393 INFO L290 TraceCheckUtils]: 8: Hoare triple {24692#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:18,394 INFO L290 TraceCheckUtils]: 9: Hoare triple {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:18,395 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {24701#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {24692#true} #306#return; {24698#(<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:18,396 INFO L290 TraceCheckUtils]: 11: Hoare triple {24698#(<= |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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {24699#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:18,396 INFO L290 TraceCheckUtils]: 12: Hoare triple {24699#(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); {24699#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:18,396 INFO L290 TraceCheckUtils]: 13: Hoare triple {24699#(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; {24699#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|))} is VALID [2022-02-20 23:45:18,397 INFO L290 TraceCheckUtils]: 14: Hoare triple {24699#(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; {24700#(not |ULTIMATE.start_create_item_#t~switch6#1|)} is VALID [2022-02-20 23:45:18,397 INFO L290 TraceCheckUtils]: 15: Hoare triple {24700#(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; {24693#false} is VALID [2022-02-20 23:45:18,397 INFO L290 TraceCheckUtils]: 16: Hoare triple {24693#false} havoc create_item_#t~switch6#1; {24693#false} is VALID [2022-02-20 23:45:18,397 INFO L290 TraceCheckUtils]: 17: Hoare triple {24693#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: L677-12 {24693#false} is VALID [2022-02-20 23:45:18,397 INFO L290 TraceCheckUtils]: 18: Hoare triple {24693#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {24693#false} is VALID [2022-02-20 23:45:18,398 INFO L290 TraceCheckUtils]: 19: Hoare triple {24693#false} assume create_item_#t~short10#1; {24693#false} is VALID [2022-02-20 23:45:18,398 INFO L290 TraceCheckUtils]: 20: Hoare triple {24693#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: L677-3 {24693#false} is VALID [2022-02-20 23:45:18,398 INFO L290 TraceCheckUtils]: 21: Hoare triple {24693#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {24693#false} is VALID [2022-02-20 23:45:18,398 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:18,398 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:18,398 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2091774235] [2022-02-20 23:45:18,398 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2091774235] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:18,398 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:18,399 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:18,399 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [151940000] [2022-02-20 23:45:18,399 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:18,399 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:18,399 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:18,399 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:18,412 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:18,412 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:18,412 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:18,412 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:18,412 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:18,412 INFO L87 Difference]: Start difference. First operand 356 states and 485 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:18,877 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:18,877 INFO L93 Difference]: Finished difference Result 610 states and 833 transitions. [2022-02-20 23:45:18,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:18,877 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:18,877 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:18,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:18,879 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 358 transitions. [2022-02-20 23:45:18,879 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:18,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 358 transitions. [2022-02-20 23:45:18,880 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 358 transitions. [2022-02-20 23:45:19,083 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 358 edges. 358 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:19,094 INFO L225 Difference]: With dead ends: 610 [2022-02-20 23:45:19,094 INFO L226 Difference]: Without dead ends: 610 [2022-02-20 23:45:19,094 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:45:19,095 INFO L933 BasicCegarLoop]: 257 mSDtfsCounter, 233 mSDsluCounter, 942 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 237 SdHoareTripleChecker+Valid, 1199 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:19,095 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [237 Valid, 1199 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:19,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 610 states. [2022-02-20 23:45:19,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 610 to 358. [2022-02-20 23:45:19,100 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:19,101 INFO L82 GeneralOperation]: Start isEquivalent. First operand 610 states. Second operand has 358 states, 285 states have (on average 1.6245614035087719) internal successors, (463), 343 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,101 INFO L74 IsIncluded]: Start isIncluded. First operand 610 states. Second operand has 358 states, 285 states have (on average 1.6245614035087719) internal successors, (463), 343 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,101 INFO L87 Difference]: Start difference. First operand 610 states. Second operand has 358 states, 285 states have (on average 1.6245614035087719) internal successors, (463), 343 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,113 INFO L93 Difference]: Finished difference Result 610 states and 833 transitions. [2022-02-20 23:45:19,113 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 833 transitions. [2022-02-20 23:45:19,114 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:19,114 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:19,114 INFO L74 IsIncluded]: Start isIncluded. First operand has 358 states, 285 states have (on average 1.6245614035087719) internal successors, (463), 343 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Second operand 610 states. [2022-02-20 23:45:19,115 INFO L87 Difference]: Start difference. First operand has 358 states, 285 states have (on average 1.6245614035087719) internal successors, (463), 343 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Second operand 610 states. [2022-02-20 23:45:19,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,126 INFO L93 Difference]: Finished difference Result 610 states and 833 transitions. [2022-02-20 23:45:19,126 INFO L276 IsEmpty]: Start isEmpty. Operand 610 states and 833 transitions. [2022-02-20 23:45:19,127 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:19,127 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:19,127 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:19,127 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:19,128 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 358 states, 285 states have (on average 1.6245614035087719) internal successors, (463), 343 states have internal predecessors, (463), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 358 states to 358 states and 487 transitions. [2022-02-20 23:45:19,132 INFO L78 Accepts]: Start accepts. Automaton has 358 states and 487 transitions. Word has length 22 [2022-02-20 23:45:19,132 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:19,132 INFO L470 AbstractCegarLoop]: Abstraction has 358 states and 487 transitions. [2022-02-20 23:45:19,133 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,133 INFO L276 IsEmpty]: Start isEmpty. Operand 358 states and 487 transitions. [2022-02-20 23:45:19,133 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:19,133 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:19,133 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:19,133 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2022-02-20 23:45:19,134 INFO L402 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:19,134 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:19,134 INFO L85 PathProgramCache]: Analyzing trace with hash 686452765, now seen corresponding path program 1 times [2022-02-20 23:45:19,134 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:19,134 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164538424] [2022-02-20 23:45:19,134 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:19,135 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:19,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:19,169 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:19,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:19,182 INFO L290 TraceCheckUtils]: 0: Hoare triple {26896#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {26896#true} is VALID [2022-02-20 23:45:19,183 INFO L290 TraceCheckUtils]: 1: Hoare triple {26896#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:19,183 INFO L290 TraceCheckUtils]: 2: Hoare triple {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:19,184 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {26896#true} #306#return; {26902#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:19,184 INFO L290 TraceCheckUtils]: 0: Hoare triple {26896#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(12, 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); {26896#true} is VALID [2022-02-20 23:45:19,184 INFO L290 TraceCheckUtils]: 1: Hoare triple {26896#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {26896#true} is VALID [2022-02-20 23:45:19,184 INFO L290 TraceCheckUtils]: 2: Hoare triple {26896#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {26896#true} is VALID [2022-02-20 23:45:19,184 INFO L290 TraceCheckUtils]: 3: Hoare triple {26896#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {26896#true} is VALID [2022-02-20 23:45:19,184 INFO L290 TraceCheckUtils]: 4: Hoare triple {26896#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {26896#true} is VALID [2022-02-20 23:45:19,184 INFO L290 TraceCheckUtils]: 5: Hoare triple {26896#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {26896#true} is VALID [2022-02-20 23:45:19,184 INFO L272 TraceCheckUtils]: 6: Hoare triple {26896#true} call main_#t~ret32#1 := rand_end_point(); {26896#true} is VALID [2022-02-20 23:45:19,185 INFO L290 TraceCheckUtils]: 7: Hoare triple {26896#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {26896#true} is VALID [2022-02-20 23:45:19,185 INFO L290 TraceCheckUtils]: 8: Hoare triple {26896#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:19,185 INFO L290 TraceCheckUtils]: 9: Hoare triple {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:19,186 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {26905#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {26896#true} #306#return; {26902#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:19,186 INFO L290 TraceCheckUtils]: 11: Hoare triple {26902#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret32#1|) (<= |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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {26903#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:19,187 INFO L290 TraceCheckUtils]: 12: Hoare triple {26903#(= ~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); {26903#(= ~unnamed1~0~LIST_BEG |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:19,187 INFO L290 TraceCheckUtils]: 13: Hoare triple {26903#(= ~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; {26904#|ULTIMATE.start_create_item_#t~switch6#1|} is VALID [2022-02-20 23:45:19,187 INFO L290 TraceCheckUtils]: 14: Hoare triple {26904#|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; {26897#false} is VALID [2022-02-20 23:45:19,187 INFO L290 TraceCheckUtils]: 15: Hoare triple {26897#false} assume !create_item_#t~switch6#1; {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L290 TraceCheckUtils]: 16: Hoare triple {26897#false} havoc create_item_#t~switch6#1; {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L290 TraceCheckUtils]: 17: Hoare triple {26897#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: L677-12 {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L290 TraceCheckUtils]: 18: Hoare triple {26897#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L290 TraceCheckUtils]: 19: Hoare triple {26897#false} assume create_item_#t~short10#1; {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L290 TraceCheckUtils]: 20: Hoare triple {26897#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: L677-3 {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L290 TraceCheckUtils]: 21: Hoare triple {26897#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {26897#false} is VALID [2022-02-20 23:45:19,188 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:19,189 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:19,189 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164538424] [2022-02-20 23:45:19,189 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [164538424] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:19,189 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:19,189 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:19,189 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [615694398] [2022-02-20 23:45:19,189 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:19,190 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,190 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:19,190 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,201 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:19,201 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:19,201 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:19,201 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:19,201 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:19,202 INFO L87 Difference]: Start difference. First operand 358 states and 487 transitions. Second operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,663 INFO L93 Difference]: Finished difference Result 606 states and 825 transitions. [2022-02-20 23:45:19,663 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:19,663 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,663 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:19,663 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,665 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 355 transitions. [2022-02-20 23:45:19,665 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,666 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 355 transitions. [2022-02-20 23:45:19,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 355 transitions. [2022-02-20 23:45:19,864 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 355 edges. 355 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:19,874 INFO L225 Difference]: With dead ends: 606 [2022-02-20 23:45:19,874 INFO L226 Difference]: Without dead ends: 606 [2022-02-20 23:45:19,875 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:45:19,875 INFO L933 BasicCegarLoop]: 263 mSDtfsCounter, 230 mSDsluCounter, 952 mSDsCounter, 0 mSdLazyCounter, 23 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 234 SdHoareTripleChecker+Valid, 1215 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 23 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:19,875 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [234 Valid, 1215 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 23 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:19,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 606 states. [2022-02-20 23:45:19,880 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 606 to 356. [2022-02-20 23:45:19,880 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:19,880 INFO L82 GeneralOperation]: Start isEquivalent. First operand 606 states. Second operand has 356 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 341 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,881 INFO L74 IsIncluded]: Start isIncluded. First operand 606 states. Second operand has 356 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 341 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,881 INFO L87 Difference]: Start difference. First operand 606 states. Second operand has 356 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 341 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,895 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,895 INFO L93 Difference]: Finished difference Result 606 states and 825 transitions. [2022-02-20 23:45:19,895 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 825 transitions. [2022-02-20 23:45:19,896 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:19,896 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:19,897 INFO L74 IsIncluded]: Start isIncluded. First operand has 356 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 341 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Second operand 606 states. [2022-02-20 23:45:19,897 INFO L87 Difference]: Start difference. First operand has 356 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 341 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) Second operand 606 states. [2022-02-20 23:45:19,908 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:19,908 INFO L93 Difference]: Finished difference Result 606 states and 825 transitions. [2022-02-20 23:45:19,908 INFO L276 IsEmpty]: Start isEmpty. Operand 606 states and 825 transitions. [2022-02-20 23:45:19,909 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:19,909 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:19,909 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:19,909 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:19,910 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 356 states, 283 states have (on average 1.6148409893992932) internal successors, (457), 341 states have internal predecessors, (457), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 10 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:19,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 356 states to 356 states and 481 transitions. [2022-02-20 23:45:19,914 INFO L78 Accepts]: Start accepts. Automaton has 356 states and 481 transitions. Word has length 22 [2022-02-20 23:45:19,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:19,914 INFO L470 AbstractCegarLoop]: Abstraction has 356 states and 481 transitions. [2022-02-20 23:45:19,914 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 5 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:45:19,915 INFO L276 IsEmpty]: Start isEmpty. Operand 356 states and 481 transitions. [2022-02-20 23:45:19,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 23:45:19,915 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:19,915 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:19,915 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2022-02-20 23:45:19,915 INFO L402 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:19,916 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:19,916 INFO L85 PathProgramCache]: Analyzing trace with hash -1594113222, now seen corresponding path program 1 times [2022-02-20 23:45:19,916 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:19,916 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [297928275] [2022-02-20 23:45:19,916 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:19,916 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:19,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:19,986 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:19,988 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:20,000 INFO L290 TraceCheckUtils]: 0: Hoare triple {29086#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {29086#true} is VALID [2022-02-20 23:45:20,000 INFO L290 TraceCheckUtils]: 1: Hoare triple {29086#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:20,001 INFO L290 TraceCheckUtils]: 2: Hoare triple {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:20,001 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {29088#(and (= |~#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))))} #306#return; {29093#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|) (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (<= (* 4 |ULTIMATE.start_main_#t~ret32#1|) (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:20,002 INFO L290 TraceCheckUtils]: 0: Hoare triple {29086#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(12, 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); {29088#(and (= |~#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))))} is VALID [2022-02-20 23:45:20,002 INFO L290 TraceCheckUtils]: 1: Hoare triple {29088#(and (= |~#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))))} 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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {29088#(and (= |~#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))))} is VALID [2022-02-20 23:45:20,003 INFO L290 TraceCheckUtils]: 2: Hoare triple {29088#(and (= |~#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))))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {29088#(and (= |~#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))))} is VALID [2022-02-20 23:45:20,003 INFO L290 TraceCheckUtils]: 3: Hoare triple {29088#(and (= |~#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))))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {29088#(and (= |~#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))))} is VALID [2022-02-20 23:45:20,004 INFO L290 TraceCheckUtils]: 4: Hoare triple {29088#(and (= |~#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))))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {29088#(and (= |~#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))))} is VALID [2022-02-20 23:45:20,004 INFO L290 TraceCheckUtils]: 5: Hoare triple {29088#(and (= |~#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))))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {29088#(and (= |~#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))))} is VALID [2022-02-20 23:45:20,004 INFO L272 TraceCheckUtils]: 6: Hoare triple {29088#(and (= |~#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))))} call main_#t~ret32#1 := rand_end_point(); {29086#true} is VALID [2022-02-20 23:45:20,005 INFO L290 TraceCheckUtils]: 7: Hoare triple {29086#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {29086#true} is VALID [2022-02-20 23:45:20,005 INFO L290 TraceCheckUtils]: 8: Hoare triple {29086#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:20,005 INFO L290 TraceCheckUtils]: 9: Hoare triple {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:20,006 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {29097#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {29088#(and (= |~#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))))} #306#return; {29093#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|) (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (<= (* 4 |ULTIMATE.start_main_#t~ret32#1|) (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:20,007 INFO L290 TraceCheckUtils]: 11: Hoare triple {29093#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (<= (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|) (* 4 |ULTIMATE.start_main_#t~ret32#1|)) (<= (* 4 |ULTIMATE.start_main_#t~ret32#1|) (+ (* ~unnamed1~0~LIST_END 4) |~#list~0.offset|)) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {29094#(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:45:20,008 INFO L290 TraceCheckUtils]: 12: Hoare triple {29094#(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); {29094#(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:45:20,009 INFO L290 TraceCheckUtils]: 13: Hoare triple {29094#(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; {29094#(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:45:20,009 INFO L290 TraceCheckUtils]: 14: Hoare triple {29094#(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_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {29094#(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:45:20,010 INFO L290 TraceCheckUtils]: 15: Hoare triple {29094#(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_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {29094#(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:45:20,010 INFO L290 TraceCheckUtils]: 16: Hoare triple {29094#(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; {29094#(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:45:20,010 INFO L290 TraceCheckUtils]: 17: Hoare triple {29094#(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: L677-12 {29095#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 0) (= |ULTIMATE.start_create_item_#t~mem8#1.offset| 0))} is VALID [2022-02-20 23:45:20,011 INFO L290 TraceCheckUtils]: 18: Hoare triple {29095#(and (= |ULTIMATE.start_create_item_#t~mem8#1.base| 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; {29096#(not |ULTIMATE.start_create_item_#t~short10#1|)} is VALID [2022-02-20 23:45:20,011 INFO L290 TraceCheckUtils]: 19: Hoare triple {29096#(not |ULTIMATE.start_create_item_#t~short10#1|)} assume create_item_#t~short10#1; {29087#false} is VALID [2022-02-20 23:45:20,011 INFO L290 TraceCheckUtils]: 20: Hoare triple {29087#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: L677-3 {29087#false} is VALID [2022-02-20 23:45:20,011 INFO L290 TraceCheckUtils]: 21: Hoare triple {29087#false} assume !(1 == #valid[create_item_#t~mem7#1.base]); {29087#false} is VALID [2022-02-20 23:45:20,012 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:20,012 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:20,012 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [297928275] [2022-02-20 23:45:20,012 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [297928275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:20,012 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:20,012 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2022-02-20 23:45:20,012 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1885503330] [2022-02-20 23:45:20,012 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:20,013 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:45:20,013 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:20,013 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), 7 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:45:20,028 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:20,028 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:20,028 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:20,029 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:20,029 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2022-02-20 23:45:20,029 INFO L87 Difference]: Start difference. First operand 356 states and 481 transitions. Second operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:45:20,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:20,952 INFO L93 Difference]: Finished difference Result 540 states and 714 transitions. [2022-02-20 23:45:20,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:45:20,952 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:45:20,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:20,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:45:20,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 363 transitions. [2022-02-20 23:45:20,955 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:45:20,956 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 363 transitions. [2022-02-20 23:45:20,957 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 363 transitions. [2022-02-20 23:45:21,207 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 363 edges. 363 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:21,215 INFO L225 Difference]: With dead ends: 540 [2022-02-20 23:45:21,216 INFO L226 Difference]: Without dead ends: 540 [2022-02-20 23:45:21,216 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=51, Invalid=131, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:21,216 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 191 mSDsluCounter, 963 mSDsCounter, 0 mSdLazyCounter, 255 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 191 SdHoareTripleChecker+Valid, 1156 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 255 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:21,216 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [191 Valid, 1156 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 255 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:21,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 540 states. [2022-02-20 23:45:21,223 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 540 to 366. [2022-02-20 23:45:21,223 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:21,223 INFO L82 GeneralOperation]: Start isEquivalent. First operand 540 states. Second operand has 366 states, 293 states have (on average 1.6006825938566553) internal successors, (469), 349 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:21,224 INFO L74 IsIncluded]: Start isIncluded. First operand 540 states. Second operand has 366 states, 293 states have (on average 1.6006825938566553) internal successors, (469), 349 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:21,224 INFO L87 Difference]: Start difference. First operand 540 states. Second operand has 366 states, 293 states have (on average 1.6006825938566553) internal successors, (469), 349 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:21,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,233 INFO L93 Difference]: Finished difference Result 540 states and 714 transitions. [2022-02-20 23:45:21,233 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 714 transitions. [2022-02-20 23:45:21,234 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:21,234 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:21,234 INFO L74 IsIncluded]: Start isIncluded. First operand has 366 states, 293 states have (on average 1.6006825938566553) internal successors, (469), 349 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 540 states. [2022-02-20 23:45:21,234 INFO L87 Difference]: Start difference. First operand has 366 states, 293 states have (on average 1.6006825938566553) internal successors, (469), 349 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 540 states. [2022-02-20 23:45:21,243 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,244 INFO L93 Difference]: Finished difference Result 540 states and 714 transitions. [2022-02-20 23:45:21,244 INFO L276 IsEmpty]: Start isEmpty. Operand 540 states and 714 transitions. [2022-02-20 23:45:21,244 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:21,244 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:21,244 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:21,245 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:21,245 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 366 states, 293 states have (on average 1.6006825938566553) internal successors, (469), 349 states have internal predecessors, (469), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:21,249 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 366 states to 366 states and 493 transitions. [2022-02-20 23:45:21,250 INFO L78 Accepts]: Start accepts. Automaton has 366 states and 493 transitions. Word has length 22 [2022-02-20 23:45:21,250 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:21,250 INFO L470 AbstractCegarLoop]: Abstraction has 366 states and 493 transitions. [2022-02-20 23:45:21,250 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 2.5) internal successors, (20), 7 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:45:21,250 INFO L276 IsEmpty]: Start isEmpty. Operand 366 states and 493 transitions. [2022-02-20 23:45:21,250 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:45:21,251 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:21,251 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:21,251 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2022-02-20 23:45:21,251 INFO L402 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:21,252 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:21,252 INFO L85 PathProgramCache]: Analyzing trace with hash -1338476602, now seen corresponding path program 1 times [2022-02-20 23:45:21,252 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:21,252 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1911239673] [2022-02-20 23:45:21,252 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:21,252 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:21,266 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:21,292 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:21,294 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:21,299 INFO L290 TraceCheckUtils]: 0: Hoare triple {31098#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {31098#true} is VALID [2022-02-20 23:45:21,300 INFO L290 TraceCheckUtils]: 1: Hoare triple {31098#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {31098#true} is VALID [2022-02-20 23:45:21,300 INFO L290 TraceCheckUtils]: 2: Hoare triple {31098#true} assume true; {31098#true} is VALID [2022-02-20 23:45:21,300 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {31098#true} {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #308#return; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,301 INFO L290 TraceCheckUtils]: 0: Hoare triple {31098#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(12, 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); {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,301 INFO L290 TraceCheckUtils]: 1: Hoare triple {31100#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,302 INFO L290 TraceCheckUtils]: 2: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,302 INFO L290 TraceCheckUtils]: 3: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,302 INFO L290 TraceCheckUtils]: 4: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,303 INFO L290 TraceCheckUtils]: 5: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,303 INFO L290 TraceCheckUtils]: 6: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,303 INFO L290 TraceCheckUtils]: 7: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,303 INFO L272 TraceCheckUtils]: 8: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} call main_#t~ret34#1 := rand_end_point(); {31098#true} is VALID [2022-02-20 23:45:21,304 INFO L290 TraceCheckUtils]: 9: Hoare triple {31098#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {31098#true} is VALID [2022-02-20 23:45:21,304 INFO L290 TraceCheckUtils]: 10: Hoare triple {31098#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {31098#true} is VALID [2022-02-20 23:45:21,304 INFO L290 TraceCheckUtils]: 11: Hoare triple {31098#true} assume true; {31098#true} is VALID [2022-02-20 23:45:21,304 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {31098#true} {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} #308#return; {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:21,305 INFO L290 TraceCheckUtils]: 13: Hoare triple {31100#(and (= 3 |~#list~0.base|) (= (select |#valid| 3) 1))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {31105#(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:45:21,305 INFO L290 TraceCheckUtils]: 14: Hoare triple {31105#(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: L655 {31105#(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:45:21,306 INFO L290 TraceCheckUtils]: 15: Hoare triple {31105#(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; {31105#(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:45:21,306 INFO L290 TraceCheckUtils]: 16: Hoare triple {31105#(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: L656 {31105#(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:45:21,307 INFO L290 TraceCheckUtils]: 17: Hoare triple {31105#(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; {31105#(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:45:21,307 INFO L290 TraceCheckUtils]: 18: Hoare triple {31105#(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); {31105#(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:45:21,307 INFO L290 TraceCheckUtils]: 19: Hoare triple {31105#(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; {31105#(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:45:21,308 INFO L290 TraceCheckUtils]: 20: Hoare triple {31105#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {31105#(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:45:21,312 INFO L290 TraceCheckUtils]: 21: Hoare triple {31105#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| |ULTIMATE.start_remove_one_~list#1.base|) 1))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {31105#(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:45:21,313 INFO L290 TraceCheckUtils]: 22: Hoare triple {31105#(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]); {31099#false} is VALID [2022-02-20 23:45:21,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:21,313 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:21,313 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1911239673] [2022-02-20 23:45:21,314 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1911239673] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:21,314 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:21,314 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:21,314 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401029059] [2022-02-20 23:45:21,314 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:21,315 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:21,315 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:21,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:21,328 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:21,328 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:21,328 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:21,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:21,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:21,330 INFO L87 Difference]: Start difference. First operand 366 states and 493 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:21,823 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:21,824 INFO L93 Difference]: Finished difference Result 583 states and 733 transitions. [2022-02-20 23:45:21,824 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:21,824 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:21,824 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:21,824 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:21,826 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2022-02-20 23:45:21,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:21,828 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 446 transitions. [2022-02-20 23:45:21,828 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 446 transitions. [2022-02-20 23:45:22,079 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 446 edges. 446 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:22,089 INFO L225 Difference]: With dead ends: 583 [2022-02-20 23:45:22,089 INFO L226 Difference]: Without dead ends: 583 [2022-02-20 23:45:22,089 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:45:22,089 INFO L933 BasicCegarLoop]: 200 mSDtfsCounter, 287 mSDsluCounter, 225 mSDsCounter, 0 mSdLazyCounter, 225 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 287 SdHoareTripleChecker+Valid, 425 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:45:22,090 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [287 Valid, 425 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 225 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:22,090 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 583 states. [2022-02-20 23:45:22,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 583 to 384. [2022-02-20 23:45:22,094 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:22,095 INFO L82 GeneralOperation]: Start isEquivalent. First operand 583 states. Second operand has 384 states, 311 states have (on average 1.617363344051447) internal successors, (503), 367 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:22,095 INFO L74 IsIncluded]: Start isIncluded. First operand 583 states. Second operand has 384 states, 311 states have (on average 1.617363344051447) internal successors, (503), 367 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:22,096 INFO L87 Difference]: Start difference. First operand 583 states. Second operand has 384 states, 311 states have (on average 1.617363344051447) internal successors, (503), 367 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:22,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:22,106 INFO L93 Difference]: Finished difference Result 583 states and 733 transitions. [2022-02-20 23:45:22,106 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 733 transitions. [2022-02-20 23:45:22,107 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:22,107 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:22,108 INFO L74 IsIncluded]: Start isIncluded. First operand has 384 states, 311 states have (on average 1.617363344051447) internal successors, (503), 367 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 583 states. [2022-02-20 23:45:22,108 INFO L87 Difference]: Start difference. First operand has 384 states, 311 states have (on average 1.617363344051447) internal successors, (503), 367 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 583 states. [2022-02-20 23:45:22,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:22,119 INFO L93 Difference]: Finished difference Result 583 states and 733 transitions. [2022-02-20 23:45:22,119 INFO L276 IsEmpty]: Start isEmpty. Operand 583 states and 733 transitions. [2022-02-20 23:45:22,120 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:22,120 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:22,120 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:22,120 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:22,120 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 384 states, 311 states have (on average 1.617363344051447) internal successors, (503), 367 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:22,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 384 states to 384 states and 527 transitions. [2022-02-20 23:45:22,126 INFO L78 Accepts]: Start accepts. Automaton has 384 states and 527 transitions. Word has length 23 [2022-02-20 23:45:22,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:22,126 INFO L470 AbstractCegarLoop]: Abstraction has 384 states and 527 transitions. [2022-02-20 23:45:22,126 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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:45:22,126 INFO L276 IsEmpty]: Start isEmpty. Operand 384 states and 527 transitions. [2022-02-20 23:45:22,126 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2022-02-20 23:45:22,126 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:22,127 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:22,127 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2022-02-20 23:45:22,127 INFO L402 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:22,127 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:22,127 INFO L85 PathProgramCache]: Analyzing trace with hash -1338476601, now seen corresponding path program 1 times [2022-02-20 23:45:22,127 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:22,128 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [314246726] [2022-02-20 23:45:22,128 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:22,128 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:22,137 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:22,222 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:22,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:22,226 INFO L290 TraceCheckUtils]: 0: Hoare triple {33243#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {33243#true} is VALID [2022-02-20 23:45:22,226 INFO L290 TraceCheckUtils]: 1: Hoare triple {33243#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {33243#true} is VALID [2022-02-20 23:45:22,226 INFO L290 TraceCheckUtils]: 2: Hoare triple {33243#true} assume true; {33243#true} is VALID [2022-02-20 23:45:22,226 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {33243#true} {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #308#return; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,227 INFO L290 TraceCheckUtils]: 0: Hoare triple {33243#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(12, 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); {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,227 INFO L290 TraceCheckUtils]: 1: Hoare triple {33245#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,228 INFO L290 TraceCheckUtils]: 2: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,228 INFO L290 TraceCheckUtils]: 3: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,228 INFO L290 TraceCheckUtils]: 4: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,229 INFO L290 TraceCheckUtils]: 5: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,229 INFO L290 TraceCheckUtils]: 6: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,229 INFO L290 TraceCheckUtils]: 7: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,230 INFO L272 TraceCheckUtils]: 8: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret34#1 := rand_end_point(); {33243#true} is VALID [2022-02-20 23:45:22,230 INFO L290 TraceCheckUtils]: 9: Hoare triple {33243#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {33243#true} is VALID [2022-02-20 23:45:22,230 INFO L290 TraceCheckUtils]: 10: Hoare triple {33243#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {33243#true} is VALID [2022-02-20 23:45:22,230 INFO L290 TraceCheckUtils]: 11: Hoare triple {33243#true} assume true; {33243#true} is VALID [2022-02-20 23:45:22,230 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {33243#true} {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #308#return; {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:22,231 INFO L290 TraceCheckUtils]: 13: Hoare triple {33245#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {33250#(and (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:22,232 INFO L290 TraceCheckUtils]: 14: Hoare triple {33250#(and (= (+ (* (- 1) |ULTIMATE.start_remove_one_~list#1.offset|) |ULTIMATE.start_is_empty_~list#1.offset|) 0) (= (select |#length| |ULTIMATE.start_is_empty_~list#1.base|) 8) (= (+ (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: L655 {33251#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:22,232 INFO L290 TraceCheckUtils]: 15: Hoare triple {33251#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (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; {33251#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (select |#length| |ULTIMATE.start_remove_one_~list#1.base|) (- 8)) 0))} is VALID [2022-02-20 23:45:22,233 INFO L290 TraceCheckUtils]: 16: Hoare triple {33251#(and (= (+ (* (- 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_is_empty_~list#1.base|) 8) (= (+ (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: L656 {33252#(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:45:22,233 INFO L290 TraceCheckUtils]: 17: Hoare triple {33252#(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; {33252#(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:45:22,233 INFO L290 TraceCheckUtils]: 18: Hoare triple {33252#(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); {33252#(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:45:22,234 INFO L290 TraceCheckUtils]: 19: Hoare triple {33252#(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; {33252#(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:45:22,234 INFO L290 TraceCheckUtils]: 20: Hoare triple {33252#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {33252#(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:45:22,235 INFO L290 TraceCheckUtils]: 21: Hoare triple {33252#(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~ret20#1);havoc remove_one_#t~ret20#1; {33252#(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:45:22,235 INFO L290 TraceCheckUtils]: 22: Hoare triple {33252#(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); {33244#false} is VALID [2022-02-20 23:45:22,235 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:22,236 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:22,236 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [314246726] [2022-02-20 23:45:22,236 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [314246726] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:22,236 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:22,236 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:22,236 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582001413] [2022-02-20 23:45:22,236 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:22,237 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:22,237 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:22,237 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:22,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:22,251 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:22,251 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:22,251 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:22,251 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:22,251 INFO L87 Difference]: Start difference. First operand 384 states and 527 transitions. Second operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:22,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:22,883 INFO L93 Difference]: Finished difference Result 516 states and 688 transitions. [2022-02-20 23:45:22,883 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:22,883 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:22,883 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:22,883 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:22,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 281 transitions. [2022-02-20 23:45:22,885 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:22,886 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 281 transitions. [2022-02-20 23:45:22,886 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 281 transitions. [2022-02-20 23:45:23,087 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:45:23,096 INFO L225 Difference]: With dead ends: 516 [2022-02-20 23:45:23,096 INFO L226 Difference]: Without dead ends: 516 [2022-02-20 23:45:23,097 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:45:23,097 INFO L933 BasicCegarLoop]: 181 mSDtfsCounter, 642 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 183 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 642 SdHoareTripleChecker+Valid, 324 SdHoareTripleChecker+Invalid, 195 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 183 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:23,097 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [642 Valid, 324 Invalid, 195 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 183 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:23,098 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 516 states. [2022-02-20 23:45:23,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 516 to 381. [2022-02-20 23:45:23,102 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:23,102 INFO L82 GeneralOperation]: Start isEquivalent. First operand 516 states. Second operand has 381 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 364 states have internal predecessors, (491), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,102 INFO L74 IsIncluded]: Start isIncluded. First operand 516 states. Second operand has 381 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 364 states have internal predecessors, (491), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,103 INFO L87 Difference]: Start difference. First operand 516 states. Second operand has 381 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 364 states have internal predecessors, (491), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,112 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,112 INFO L93 Difference]: Finished difference Result 516 states and 688 transitions. [2022-02-20 23:45:23,112 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 688 transitions. [2022-02-20 23:45:23,113 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,113 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,113 INFO L74 IsIncluded]: Start isIncluded. First operand has 381 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 364 states have internal predecessors, (491), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 516 states. [2022-02-20 23:45:23,114 INFO L87 Difference]: Start difference. First operand has 381 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 364 states have internal predecessors, (491), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 516 states. [2022-02-20 23:45:23,123 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,123 INFO L93 Difference]: Finished difference Result 516 states and 688 transitions. [2022-02-20 23:45:23,123 INFO L276 IsEmpty]: Start isEmpty. Operand 516 states and 688 transitions. [2022-02-20 23:45:23,124 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,124 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,124 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:23,124 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:23,124 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 381 states, 311 states have (on average 1.5787781350482315) internal successors, (491), 364 states have internal predecessors, (491), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,129 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 381 states to 381 states and 515 transitions. [2022-02-20 23:45:23,129 INFO L78 Accepts]: Start accepts. Automaton has 381 states and 515 transitions. Word has length 23 [2022-02-20 23:45:23,130 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:23,130 INFO L470 AbstractCegarLoop]: Abstraction has 381 states and 515 transitions. [2022-02-20 23:45:23,130 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.2) internal successors, (21), 6 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:45:23,130 INFO L276 IsEmpty]: Start isEmpty. Operand 381 states and 515 transitions. [2022-02-20 23:45:23,130 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:23,130 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:23,130 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:23,130 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2022-02-20 23:45:23,130 INFO L402 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:23,131 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:23,131 INFO L85 PathProgramCache]: Analyzing trace with hash -740334691, now seen corresponding path program 1 times [2022-02-20 23:45:23,131 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:23,131 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [569396208] [2022-02-20 23:45:23,131 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:23,131 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:23,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,150 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:23,151 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,153 INFO L290 TraceCheckUtils]: 0: Hoare triple {35190#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {35190#true} is VALID [2022-02-20 23:45:23,153 INFO L290 TraceCheckUtils]: 1: Hoare triple {35190#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {35190#true} assume true; {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {35190#true} {35190#true} #306#return; {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L290 TraceCheckUtils]: 0: Hoare triple {35190#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(12, 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); {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L290 TraceCheckUtils]: 1: Hoare triple {35190#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L290 TraceCheckUtils]: 2: Hoare triple {35190#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L290 TraceCheckUtils]: 3: Hoare triple {35190#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {35190#true} is VALID [2022-02-20 23:45:23,154 INFO L290 TraceCheckUtils]: 4: Hoare triple {35190#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L290 TraceCheckUtils]: 5: Hoare triple {35190#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L272 TraceCheckUtils]: 6: Hoare triple {35190#true} call main_#t~ret32#1 := rand_end_point(); {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L290 TraceCheckUtils]: 7: Hoare triple {35190#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L290 TraceCheckUtils]: 8: Hoare triple {35190#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L290 TraceCheckUtils]: 9: Hoare triple {35190#true} assume true; {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {35190#true} {35190#true} #306#return; {35190#true} is VALID [2022-02-20 23:45:23,155 INFO L290 TraceCheckUtils]: 11: Hoare triple {35190#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {35190#true} is VALID [2022-02-20 23:45:23,156 INFO L290 TraceCheckUtils]: 12: Hoare triple {35190#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {35190#true} is VALID [2022-02-20 23:45:23,156 INFO L290 TraceCheckUtils]: 13: Hoare triple {35190#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; {35190#true} is VALID [2022-02-20 23:45:23,156 INFO L290 TraceCheckUtils]: 14: Hoare triple {35190#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; {35190#true} is VALID [2022-02-20 23:45:23,156 INFO L290 TraceCheckUtils]: 15: Hoare triple {35190#true} havoc create_item_#t~switch6#1; {35190#true} is VALID [2022-02-20 23:45:23,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {35190#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: L677-12 {35190#true} is VALID [2022-02-20 23:45:23,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {35190#true} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {35190#true} is VALID [2022-02-20 23:45:23,160 INFO L290 TraceCheckUtils]: 18: Hoare triple {35190#true} assume !create_item_#t~short10#1; {35196#(not |ULTIMATE.start_create_item_#t~short10#1|)} is VALID [2022-02-20 23:45:23,160 INFO L290 TraceCheckUtils]: 19: Hoare triple {35196#(not |ULTIMATE.start_create_item_#t~short10#1|)} create_item_#t~short12#1 := create_item_#t~short10#1; {35197#(not |ULTIMATE.start_create_item_#t~short12#1|)} is VALID [2022-02-20 23:45:23,161 INFO L290 TraceCheckUtils]: 20: Hoare triple {35197#(not |ULTIMATE.start_create_item_#t~short12#1|)} assume create_item_#t~short12#1;assume -2147483648 <= create_item_#t~nondet11#1 && create_item_#t~nondet11#1 <= 2147483647;create_item_#t~short12#1 := 0 != create_item_#t~nondet11#1; {35191#false} is VALID [2022-02-20 23:45:23,161 INFO L290 TraceCheckUtils]: 21: Hoare triple {35191#false} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {35191#false} is VALID [2022-02-20 23:45:23,161 INFO L290 TraceCheckUtils]: 22: Hoare triple {35191#false} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {35191#false} is VALID [2022-02-20 23:45:23,161 INFO L290 TraceCheckUtils]: 23: Hoare triple {35191#false} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {35191#false} is VALID [2022-02-20 23:45:23,161 INFO L290 TraceCheckUtils]: 24: Hoare triple {35191#false} 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); {35191#false} is VALID [2022-02-20 23:45:23,161 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:23,162 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:23,162 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [569396208] [2022-02-20 23:45:23,162 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [569396208] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:23,162 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:23,162 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:23,162 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784304859] [2022-02-20 23:45:23,162 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:23,163 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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:45:23,163 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:23,163 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.75) 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:45:23,175 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,175 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:23,176 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:23,177 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:23,177 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:23,177 INFO L87 Difference]: Start difference. First operand 381 states and 515 transitions. Second operand has 4 states, 4 states have (on average 5.75) 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:45:23,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,357 INFO L93 Difference]: Finished difference Result 397 states and 531 transitions. [2022-02-20 23:45:23,357 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:23,357 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.75) 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:45:23,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:23,357 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) 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:45:23,358 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:45:23,358 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.75) 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:45:23,359 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 182 transitions. [2022-02-20 23:45:23,359 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 182 transitions. [2022-02-20 23:45:23,453 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 182 edges. 182 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,459 INFO L225 Difference]: With dead ends: 397 [2022-02-20 23:45:23,459 INFO L226 Difference]: Without dead ends: 397 [2022-02-20 23:45:23,459 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:45:23,459 INFO L933 BasicCegarLoop]: 172 mSDtfsCounter, 3 mSDsluCounter, 336 mSDsCounter, 0 mSdLazyCounter, 15 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 18 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 15 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:23,460 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 508 Invalid, 18 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 15 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:23,460 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 397 states. [2022-02-20 23:45:23,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 397 to 393. [2022-02-20 23:45:23,468 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:23,468 INFO L82 GeneralOperation]: Start isEquivalent. First operand 397 states. Second operand has 393 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 376 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,469 INFO L74 IsIncluded]: Start isIncluded. First operand 397 states. Second operand has 393 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 376 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,469 INFO L87 Difference]: Start difference. First operand 397 states. Second operand has 393 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 376 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,475 INFO L93 Difference]: Finished difference Result 397 states and 531 transitions. [2022-02-20 23:45:23,475 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 531 transitions. [2022-02-20 23:45:23,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 393 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 376 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 397 states. [2022-02-20 23:45:23,476 INFO L87 Difference]: Start difference. First operand has 393 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 376 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 397 states. [2022-02-20 23:45:23,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:23,482 INFO L93 Difference]: Finished difference Result 397 states and 531 transitions. [2022-02-20 23:45:23,482 INFO L276 IsEmpty]: Start isEmpty. Operand 397 states and 531 transitions. [2022-02-20 23:45:23,482 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:23,482 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:23,482 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:23,483 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:23,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 393 states, 323 states have (on average 1.5572755417956656) internal successors, (503), 376 states have internal predecessors, (503), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:23,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 393 states to 393 states and 527 transitions. [2022-02-20 23:45:23,488 INFO L78 Accepts]: Start accepts. Automaton has 393 states and 527 transitions. Word has length 25 [2022-02-20 23:45:23,488 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:23,489 INFO L470 AbstractCegarLoop]: Abstraction has 393 states and 527 transitions. [2022-02-20 23:45:23,489 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.75) 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:45:23,489 INFO L276 IsEmpty]: Start isEmpty. Operand 393 states and 527 transitions. [2022-02-20 23:45:23,489 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:23,489 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:23,489 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:23,489 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2022-02-20 23:45:23,489 INFO L402 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:23,489 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:23,490 INFO L85 PathProgramCache]: Analyzing trace with hash -738487649, now seen corresponding path program 1 times [2022-02-20 23:45:23,490 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:23,490 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [305073315] [2022-02-20 23:45:23,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:23,490 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:23,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,530 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:23,532 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:23,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {36786#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {36786#true} is VALID [2022-02-20 23:45:23,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {36786#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {36786#true} is VALID [2022-02-20 23:45:23,534 INFO L290 TraceCheckUtils]: 2: Hoare triple {36786#true} assume true; {36786#true} is VALID [2022-02-20 23:45:23,534 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {36786#true} {36786#true} #306#return; {36786#true} is VALID [2022-02-20 23:45:23,534 INFO L290 TraceCheckUtils]: 0: Hoare triple {36786#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(12, 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); {36786#true} is VALID [2022-02-20 23:45:23,534 INFO L290 TraceCheckUtils]: 1: Hoare triple {36786#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 2: Hoare triple {36786#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 3: Hoare triple {36786#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 4: Hoare triple {36786#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 5: Hoare triple {36786#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L272 TraceCheckUtils]: 6: Hoare triple {36786#true} call main_#t~ret32#1 := rand_end_point(); {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 7: Hoare triple {36786#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 8: Hoare triple {36786#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {36786#true} is VALID [2022-02-20 23:45:23,535 INFO L290 TraceCheckUtils]: 9: Hoare triple {36786#true} assume true; {36786#true} is VALID [2022-02-20 23:45:23,536 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {36786#true} {36786#true} #306#return; {36786#true} is VALID [2022-02-20 23:45:23,537 INFO L290 TraceCheckUtils]: 11: Hoare triple {36786#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {36792#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:23,537 INFO L290 TraceCheckUtils]: 12: Hoare triple {36792#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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); {36792#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:23,537 INFO L290 TraceCheckUtils]: 13: Hoare triple {36792#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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; {36792#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:23,538 INFO L290 TraceCheckUtils]: 14: Hoare triple {36792#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,538 INFO L290 TraceCheckUtils]: 15: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} havoc create_item_#t~switch6#1; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,539 INFO L290 TraceCheckUtils]: 16: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |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: L677-12 {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,539 INFO L290 TraceCheckUtils]: 17: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |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; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,539 INFO L290 TraceCheckUtils]: 18: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} assume !create_item_#t~short10#1; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,540 INFO L290 TraceCheckUtils]: 19: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} create_item_#t~short12#1 := create_item_#t~short10#1; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,540 INFO L290 TraceCheckUtils]: 20: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} assume !create_item_#t~short12#1; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,541 INFO L290 TraceCheckUtils]: 21: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,541 INFO L290 TraceCheckUtils]: 22: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,541 INFO L290 TraceCheckUtils]: 23: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |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~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_NEXT))} is VALID [2022-02-20 23:45:23,542 INFO L290 TraceCheckUtils]: 24: Hoare triple {36793#(and (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (<= |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); {36787#false} is VALID [2022-02-20 23:45:23,543 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:23,543 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:23,543 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [305073315] [2022-02-20 23:45:23,543 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [305073315] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:23,543 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:23,543 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:23,543 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [330007495] [2022-02-20 23:45:23,543 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:23,544 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:45:23,544 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:23,544 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:45:23,563 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:23,564 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:23,564 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:23,565 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:23,565 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:23,565 INFO L87 Difference]: Start difference. First operand 393 states and 527 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:45:24,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,014 INFO L93 Difference]: Finished difference Result 770 states and 1027 transitions. [2022-02-20 23:45:24,014 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:24,014 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:45:24,014 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:24,014 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:45:24,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2022-02-20 23:45:24,016 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:45:24,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 438 transitions. [2022-02-20 23:45:24,018 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 438 transitions. [2022-02-20 23:45:24,281 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 438 edges. 438 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,298 INFO L225 Difference]: With dead ends: 770 [2022-02-20 23:45:24,298 INFO L226 Difference]: Without dead ends: 770 [2022-02-20 23:45:24,298 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:45:24,299 INFO L933 BasicCegarLoop]: 208 mSDtfsCounter, 464 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 130 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 468 SdHoareTripleChecker+Valid, 404 SdHoareTripleChecker+Invalid, 132 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 130 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:24,299 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [468 Valid, 404 Invalid, 132 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 130 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:24,300 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 770 states. [2022-02-20 23:45:24,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 770 to 469. [2022-02-20 23:45:24,305 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:24,305 INFO L82 GeneralOperation]: Start isEquivalent. First operand 770 states. Second operand has 469 states, 399 states have (on average 1.5413533834586466) internal successors, (615), 452 states have internal predecessors, (615), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,306 INFO L74 IsIncluded]: Start isIncluded. First operand 770 states. Second operand has 469 states, 399 states have (on average 1.5413533834586466) internal successors, (615), 452 states have internal predecessors, (615), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,306 INFO L87 Difference]: Start difference. First operand 770 states. Second operand has 469 states, 399 states have (on average 1.5413533834586466) internal successors, (615), 452 states have internal predecessors, (615), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,323 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,323 INFO L93 Difference]: Finished difference Result 770 states and 1027 transitions. [2022-02-20 23:45:24,323 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1027 transitions. [2022-02-20 23:45:24,324 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,324 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,325 INFO L74 IsIncluded]: Start isIncluded. First operand has 469 states, 399 states have (on average 1.5413533834586466) internal successors, (615), 452 states have internal predecessors, (615), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 770 states. [2022-02-20 23:45:24,325 INFO L87 Difference]: Start difference. First operand has 469 states, 399 states have (on average 1.5413533834586466) internal successors, (615), 452 states have internal predecessors, (615), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 770 states. [2022-02-20 23:45:24,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,343 INFO L93 Difference]: Finished difference Result 770 states and 1027 transitions. [2022-02-20 23:45:24,343 INFO L276 IsEmpty]: Start isEmpty. Operand 770 states and 1027 transitions. [2022-02-20 23:45:24,344 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,344 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,344 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:24,344 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:24,345 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 469 states, 399 states have (on average 1.5413533834586466) internal successors, (615), 452 states have internal predecessors, (615), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 469 states to 469 states and 639 transitions. [2022-02-20 23:45:24,352 INFO L78 Accepts]: Start accepts. Automaton has 469 states and 639 transitions. Word has length 25 [2022-02-20 23:45:24,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:24,352 INFO L470 AbstractCegarLoop]: Abstraction has 469 states and 639 transitions. [2022-02-20 23:45:24,352 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:45:24,353 INFO L276 IsEmpty]: Start isEmpty. Operand 469 states and 639 transitions. [2022-02-20 23:45:24,353 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 23:45:24,353 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:24,353 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:24,353 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2022-02-20 23:45:24,353 INFO L402 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:24,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,354 INFO L85 PathProgramCache]: Analyzing trace with hash -738487650, now seen corresponding path program 1 times [2022-02-20 23:45:24,354 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:24,354 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999161209] [2022-02-20 23:45:24,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:24,364 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,372 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:24,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,375 INFO L290 TraceCheckUtils]: 0: Hoare triple {39575#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {39575#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {39575#true} assume true; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {39575#true} {39575#true} #306#return; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 0: Hoare triple {39575#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(12, 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); {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 1: Hoare triple {39575#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 2: Hoare triple {39575#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 3: Hoare triple {39575#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {39575#true} is VALID [2022-02-20 23:45:24,376 INFO L290 TraceCheckUtils]: 4: Hoare triple {39575#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {39575#true} is VALID [2022-02-20 23:45:24,377 INFO L290 TraceCheckUtils]: 5: Hoare triple {39575#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {39575#true} is VALID [2022-02-20 23:45:24,377 INFO L272 TraceCheckUtils]: 6: Hoare triple {39575#true} call main_#t~ret32#1 := rand_end_point(); {39575#true} is VALID [2022-02-20 23:45:24,377 INFO L290 TraceCheckUtils]: 7: Hoare triple {39575#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {39575#true} is VALID [2022-02-20 23:45:24,377 INFO L290 TraceCheckUtils]: 8: Hoare triple {39575#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {39575#true} is VALID [2022-02-20 23:45:24,377 INFO L290 TraceCheckUtils]: 9: Hoare triple {39575#true} assume true; {39575#true} is VALID [2022-02-20 23:45:24,377 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {39575#true} {39575#true} #306#return; {39575#true} is VALID [2022-02-20 23:45:24,378 INFO L290 TraceCheckUtils]: 11: Hoare triple {39575#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,378 INFO L290 TraceCheckUtils]: 12: Hoare triple {39581#(= 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); {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,379 INFO L290 TraceCheckUtils]: 13: Hoare triple {39581#(= 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; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,379 INFO L290 TraceCheckUtils]: 14: Hoare triple {39581#(= 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; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,379 INFO L290 TraceCheckUtils]: 15: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~switch6#1; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,380 INFO L290 TraceCheckUtils]: 16: Hoare triple {39581#(= 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: L677-12 {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,380 INFO L290 TraceCheckUtils]: 17: Hoare triple {39581#(= 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; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,381 INFO L290 TraceCheckUtils]: 18: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short10#1; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,381 INFO L290 TraceCheckUtils]: 19: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_#t~short12#1 := create_item_#t~short10#1; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,381 INFO L290 TraceCheckUtils]: 20: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short12#1; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,382 INFO L290 TraceCheckUtils]: 21: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,382 INFO L290 TraceCheckUtils]: 22: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,382 INFO L290 TraceCheckUtils]: 23: Hoare triple {39581#(= 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~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:24,383 INFO L290 TraceCheckUtils]: 24: Hoare triple {39581#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} assume !(1 == #valid[create_item_~item~0#1.base]); {39576#false} is VALID [2022-02-20 23:45:24,383 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:24,383 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:24,383 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999161209] [2022-02-20 23:45:24,383 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999161209] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:24,383 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:24,383 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 23:45:24,383 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2026399999] [2022-02-20 23:45:24,384 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:24,384 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,384 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:24,384 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 25 edges. 25 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,398 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 23:45:24,398 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:24,399 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 23:45:24,399 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:24,399 INFO L87 Difference]: Start difference. First operand 469 states and 639 transitions. Second operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,606 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,607 INFO L93 Difference]: Finished difference Result 560 states and 741 transitions. [2022-02-20 23:45:24,607 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 23:45:24,607 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,607 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:24,607 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-02-20 23:45:24,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 268 transitions. [2022-02-20 23:45:24,609 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 268 transitions. [2022-02-20 23:45:24,754 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:45:24,763 INFO L225 Difference]: With dead ends: 560 [2022-02-20 23:45:24,763 INFO L226 Difference]: Without dead ends: 560 [2022-02-20 23:45:24,763 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 23:45:24,764 INFO L933 BasicCegarLoop]: 188 mSDtfsCounter, 139 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 99 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 141 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 100 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 99 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:24,764 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [141 Valid, 257 Invalid, 100 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 99 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:24,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 560 states. [2022-02-20 23:45:24,768 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 560 to 467. [2022-02-20 23:45:24,769 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:24,769 INFO L82 GeneralOperation]: Start isEquivalent. First operand 560 states. Second operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,769 INFO L74 IsIncluded]: Start isIncluded. First operand 560 states. Second operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,770 INFO L87 Difference]: Start difference. First operand 560 states. Second operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,779 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,779 INFO L93 Difference]: Finished difference Result 560 states and 741 transitions. [2022-02-20 23:45:24,780 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 741 transitions. [2022-02-20 23:45:24,780 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,780 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,781 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 560 states. [2022-02-20 23:45:24,781 INFO L87 Difference]: Start difference. First operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 560 states. [2022-02-20 23:45:24,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:24,791 INFO L93 Difference]: Finished difference Result 560 states and 741 transitions. [2022-02-20 23:45:24,791 INFO L276 IsEmpty]: Start isEmpty. Operand 560 states and 741 transitions. [2022-02-20 23:45:24,792 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:24,792 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:24,792 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:24,792 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:24,792 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:24,799 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 627 transitions. [2022-02-20 23:45:24,799 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 627 transitions. Word has length 25 [2022-02-20 23:45:24,800 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:24,800 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 627 transitions. [2022-02-20 23:45:24,800 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 11.5) internal successors, (23), 3 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:45:24,800 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 627 transitions. [2022-02-20 23:45:24,800 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:24,800 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:24,800 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:24,801 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2022-02-20 23:45:24,801 INFO L402 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:24,801 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:24,801 INFO L85 PathProgramCache]: Analyzing trace with hash 1484578673, now seen corresponding path program 1 times [2022-02-20 23:45:24,801 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:24,801 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [404291870] [2022-02-20 23:45:24,801 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:24,802 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:24,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,836 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:24,838 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:24,839 INFO L290 TraceCheckUtils]: 0: Hoare triple {41731#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {41731#true} is VALID [2022-02-20 23:45:24,839 INFO L290 TraceCheckUtils]: 1: Hoare triple {41731#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {41731#true} is VALID [2022-02-20 23:45:24,839 INFO L290 TraceCheckUtils]: 2: Hoare triple {41731#true} assume true; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {41731#true} {41731#true} #306#return; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L290 TraceCheckUtils]: 0: Hoare triple {41731#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(12, 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); {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L290 TraceCheckUtils]: 1: Hoare triple {41731#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L290 TraceCheckUtils]: 2: Hoare triple {41731#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L290 TraceCheckUtils]: 3: Hoare triple {41731#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L290 TraceCheckUtils]: 4: Hoare triple {41731#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L290 TraceCheckUtils]: 5: Hoare triple {41731#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {41731#true} is VALID [2022-02-20 23:45:24,840 INFO L272 TraceCheckUtils]: 6: Hoare triple {41731#true} call main_#t~ret32#1 := rand_end_point(); {41731#true} is VALID [2022-02-20 23:45:24,841 INFO L290 TraceCheckUtils]: 7: Hoare triple {41731#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {41731#true} is VALID [2022-02-20 23:45:24,841 INFO L290 TraceCheckUtils]: 8: Hoare triple {41731#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {41731#true} is VALID [2022-02-20 23:45:24,841 INFO L290 TraceCheckUtils]: 9: Hoare triple {41731#true} assume true; {41731#true} is VALID [2022-02-20 23:45:24,841 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {41731#true} {41731#true} #306#return; {41731#true} is VALID [2022-02-20 23:45:24,842 INFO L290 TraceCheckUtils]: 11: Hoare triple {41731#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,842 INFO L290 TraceCheckUtils]: 12: Hoare triple {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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); {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,843 INFO L290 TraceCheckUtils]: 13: Hoare triple {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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; {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,843 INFO L290 TraceCheckUtils]: 14: Hoare triple {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,843 INFO L290 TraceCheckUtils]: 15: Hoare triple {41737#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,844 INFO L290 TraceCheckUtils]: 16: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_#t~switch6#1; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,844 INFO L290 TraceCheckUtils]: 17: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |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: L677-12 {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,845 INFO L290 TraceCheckUtils]: 18: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |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; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,845 INFO L290 TraceCheckUtils]: 19: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short10#1; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,845 INFO L290 TraceCheckUtils]: 20: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_#t~short12#1 := create_item_#t~short10#1; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,846 INFO L290 TraceCheckUtils]: 21: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short12#1; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,846 INFO L290 TraceCheckUtils]: 22: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,846 INFO L290 TraceCheckUtils]: 23: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,847 INFO L290 TraceCheckUtils]: 24: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:24,847 INFO L290 TraceCheckUtils]: 25: Hoare triple {41738#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= |ULTIMATE.start_create_item_~link_field~0#1| ~unnamed2~0~ITEM_PREV) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} 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); {41732#false} is VALID [2022-02-20 23:45:24,847 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:24,848 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:24,848 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [404291870] [2022-02-20 23:45:24,848 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [404291870] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:24,848 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:24,848 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:24,848 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613997451] [2022-02-20 23:45:24,848 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:24,849 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:45:24,849 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:24,849 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:45:24,867 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:24,867 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:24,867 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:24,868 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:24,868 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:24,868 INFO L87 Difference]: Start difference. First operand 467 states and 627 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:45:25,344 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,344 INFO L93 Difference]: Finished difference Result 842 states and 1119 transitions. [2022-02-20 23:45:25,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:25,344 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:45:25,344 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:25,344 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:45:25,346 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-02-20 23:45:25,346 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:45:25,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 434 transitions. [2022-02-20 23:45:25,348 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 434 transitions. [2022-02-20 23:45:25,606 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 434 edges. 434 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:25,626 INFO L225 Difference]: With dead ends: 842 [2022-02-20 23:45:25,626 INFO L226 Difference]: Without dead ends: 842 [2022-02-20 23:45:25,627 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:45:25,627 INFO L933 BasicCegarLoop]: 264 mSDtfsCounter, 372 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 161 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 376 SdHoareTripleChecker+Valid, 460 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 161 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:25,627 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [376 Valid, 460 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 161 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:25,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 842 states. [2022-02-20 23:45:25,632 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 842 to 467. [2022-02-20 23:45:25,632 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:25,633 INFO L82 GeneralOperation]: Start isEquivalent. First operand 842 states. Second operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:25,633 INFO L74 IsIncluded]: Start isIncluded. First operand 842 states. Second operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:25,634 INFO L87 Difference]: Start difference. First operand 842 states. Second operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:25,653 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,654 INFO L93 Difference]: Finished difference Result 842 states and 1119 transitions. [2022-02-20 23:45:25,654 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1119 transitions. [2022-02-20 23:45:25,655 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,655 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,655 INFO L74 IsIncluded]: Start isIncluded. First operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 842 states. [2022-02-20 23:45:25,656 INFO L87 Difference]: Start difference. First operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 842 states. [2022-02-20 23:45:25,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:25,676 INFO L93 Difference]: Finished difference Result 842 states and 1119 transitions. [2022-02-20 23:45:25,676 INFO L276 IsEmpty]: Start isEmpty. Operand 842 states and 1119 transitions. [2022-02-20 23:45:25,677 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:25,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:25,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:25,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:25,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 467 states, 399 states have (on average 1.5112781954887218) internal successors, (603), 450 states have internal predecessors, (603), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:25,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 467 states to 467 states and 627 transitions. [2022-02-20 23:45:25,685 INFO L78 Accepts]: Start accepts. Automaton has 467 states and 627 transitions. Word has length 26 [2022-02-20 23:45:25,685 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:25,686 INFO L470 AbstractCegarLoop]: Abstraction has 467 states and 627 transitions. [2022-02-20 23:45:25,686 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:45:25,686 INFO L276 IsEmpty]: Start isEmpty. Operand 467 states and 627 transitions. [2022-02-20 23:45:25,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2022-02-20 23:45:25,686 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:25,686 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:25,686 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2022-02-20 23:45:25,687 INFO L402 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:25,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:25,687 INFO L85 PathProgramCache]: Analyzing trace with hash -2109324045, now seen corresponding path program 1 times [2022-02-20 23:45:25,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:25,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1261745846] [2022-02-20 23:45:25,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:25,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:25,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:25,730 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:25,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:25,747 INFO L290 TraceCheckUtils]: 0: Hoare triple {44734#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {44734#true} is VALID [2022-02-20 23:45:25,748 INFO L290 TraceCheckUtils]: 1: Hoare triple {44734#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:25,748 INFO L290 TraceCheckUtils]: 2: Hoare triple {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:25,749 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {44734#true} #306#return; {44740#(and (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:25,749 INFO L290 TraceCheckUtils]: 0: Hoare triple {44734#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(12, 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); {44734#true} is VALID [2022-02-20 23:45:25,749 INFO L290 TraceCheckUtils]: 1: Hoare triple {44734#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {44734#true} is VALID [2022-02-20 23:45:25,749 INFO L290 TraceCheckUtils]: 2: Hoare triple {44734#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {44734#true} is VALID [2022-02-20 23:45:25,749 INFO L290 TraceCheckUtils]: 3: Hoare triple {44734#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {44734#true} is VALID [2022-02-20 23:45:25,749 INFO L290 TraceCheckUtils]: 4: Hoare triple {44734#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {44734#true} is VALID [2022-02-20 23:45:25,749 INFO L290 TraceCheckUtils]: 5: Hoare triple {44734#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {44734#true} is VALID [2022-02-20 23:45:25,750 INFO L272 TraceCheckUtils]: 6: Hoare triple {44734#true} call main_#t~ret32#1 := rand_end_point(); {44734#true} is VALID [2022-02-20 23:45:25,750 INFO L290 TraceCheckUtils]: 7: Hoare triple {44734#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {44734#true} is VALID [2022-02-20 23:45:25,750 INFO L290 TraceCheckUtils]: 8: Hoare triple {44734#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:25,750 INFO L290 TraceCheckUtils]: 9: Hoare triple {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:25,751 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {44743#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {44734#true} #306#return; {44740#(and (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:25,752 INFO L290 TraceCheckUtils]: 11: Hoare triple {44740#(and (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret32#1|) (<= |ULTIMATE.start_main_#t~ret32#1| ~unnamed1~0~LIST_END))} 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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {44741#(= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:25,752 INFO L290 TraceCheckUtils]: 12: Hoare triple {44741#(= ~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); {44741#(= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:25,752 INFO L290 TraceCheckUtils]: 13: Hoare triple {44741#(= ~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; {44741#(= ~unnamed1~0~LIST_END |ULTIMATE.start_create_item_~at#1|)} is VALID [2022-02-20 23:45:25,753 INFO L290 TraceCheckUtils]: 14: Hoare triple {44741#(= ~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; {44742#|ULTIMATE.start_create_item_#t~switch6#1|} is VALID [2022-02-20 23:45:25,753 INFO L290 TraceCheckUtils]: 15: Hoare triple {44742#|ULTIMATE.start_create_item_#t~switch6#1|} assume !create_item_#t~switch6#1; {44735#false} is VALID [2022-02-20 23:45:25,753 INFO L290 TraceCheckUtils]: 16: Hoare triple {44735#false} havoc create_item_#t~switch6#1; {44735#false} is VALID [2022-02-20 23:45:25,753 INFO L290 TraceCheckUtils]: 17: Hoare triple {44735#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: L677-12 {44735#false} is VALID [2022-02-20 23:45:25,753 INFO L290 TraceCheckUtils]: 18: Hoare triple {44735#false} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {44735#false} is VALID [2022-02-20 23:45:25,753 INFO L290 TraceCheckUtils]: 19: Hoare triple {44735#false} assume !create_item_#t~short10#1; {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L290 TraceCheckUtils]: 20: Hoare triple {44735#false} create_item_#t~short12#1 := create_item_#t~short10#1; {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L290 TraceCheckUtils]: 21: Hoare triple {44735#false} assume !create_item_#t~short12#1; {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L290 TraceCheckUtils]: 22: Hoare triple {44735#false} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L290 TraceCheckUtils]: 23: Hoare triple {44735#false} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L290 TraceCheckUtils]: 24: Hoare triple {44735#false} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L290 TraceCheckUtils]: 25: Hoare triple {44735#false} 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); {44735#false} is VALID [2022-02-20 23:45:25,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:25,755 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:25,755 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1261745846] [2022-02-20 23:45:25,755 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1261745846] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:25,755 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:25,755 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:25,755 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [138973359] [2022-02-20 23:45:25,755 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:25,756 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:25,756 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:25,756 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:25,770 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 26 edges. 26 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:25,771 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:25,771 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:25,771 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:25,771 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:25,772 INFO L87 Difference]: Start difference. First operand 467 states and 627 transitions. Second operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:26,370 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,371 INFO L93 Difference]: Finished difference Result 666 states and 882 transitions. [2022-02-20 23:45:26,371 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:26,371 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:26,371 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:26,371 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:26,373 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 341 transitions. [2022-02-20 23:45:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 341 transitions. [2022-02-20 23:45:26,374 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 341 transitions. [2022-02-20 23:45:26,564 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 341 edges. 341 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,577 INFO L225 Difference]: With dead ends: 666 [2022-02-20 23:45:26,577 INFO L226 Difference]: Without dead ends: 666 [2022-02-20 23:45:26,578 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 4 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:45:26,578 INFO L933 BasicCegarLoop]: 335 mSDtfsCounter, 222 mSDsluCounter, 1101 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 224 SdHoareTripleChecker+Valid, 1436 SdHoareTripleChecker+Invalid, 28 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:26,578 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [224 Valid, 1436 Invalid, 28 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:26,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 666 states. [2022-02-20 23:45:26,582 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 666 to 390. [2022-02-20 23:45:26,583 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:26,583 INFO L82 GeneralOperation]: Start isEquivalent. First operand 666 states. Second operand has 390 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 373 states have internal predecessors, (487), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:26,583 INFO L74 IsIncluded]: Start isIncluded. First operand 666 states. Second operand has 390 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 373 states have internal predecessors, (487), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:26,584 INFO L87 Difference]: Start difference. First operand 666 states. Second operand has 390 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 373 states have internal predecessors, (487), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:26,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,597 INFO L93 Difference]: Finished difference Result 666 states and 882 transitions. [2022-02-20 23:45:26,597 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 882 transitions. [2022-02-20 23:45:26,597 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:26,597 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:26,598 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 373 states have internal predecessors, (487), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 666 states. [2022-02-20 23:45:26,598 INFO L87 Difference]: Start difference. First operand has 390 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 373 states have internal predecessors, (487), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 666 states. [2022-02-20 23:45:26,611 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:26,612 INFO L93 Difference]: Finished difference Result 666 states and 882 transitions. [2022-02-20 23:45:26,612 INFO L276 IsEmpty]: Start isEmpty. Operand 666 states and 882 transitions. [2022-02-20 23:45:26,613 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:26,613 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:26,613 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:26,613 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:26,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 323 states have (on average 1.5077399380804954) internal successors, (487), 373 states have internal predecessors, (487), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:26,619 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 511 transitions. [2022-02-20 23:45:26,619 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 511 transitions. Word has length 26 [2022-02-20 23:45:26,619 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:26,619 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 511 transitions. [2022-02-20 23:45:26,620 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.0) internal successors, (24), 5 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:45:26,620 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 511 transitions. [2022-02-20 23:45:26,620 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:26,620 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:26,620 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:26,620 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2022-02-20 23:45:26,621 INFO L402 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr41ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:26,621 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:26,621 INFO L85 PathProgramCache]: Analyzing trace with hash 1817784781, now seen corresponding path program 1 times [2022-02-20 23:45:26,621 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:26,621 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [31722471] [2022-02-20 23:45:26,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:26,621 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:26,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:26,669 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:26,672 INFO L290 TraceCheckUtils]: 0: Hoare triple {47138#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {47138#true} is VALID [2022-02-20 23:45:26,673 INFO L290 TraceCheckUtils]: 1: Hoare triple {47138#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {47138#true} is VALID [2022-02-20 23:45:26,673 INFO L290 TraceCheckUtils]: 2: Hoare triple {47138#true} assume true; {47138#true} is VALID [2022-02-20 23:45:26,674 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {47138#true} {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #308#return; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,674 INFO L290 TraceCheckUtils]: 0: Hoare triple {47138#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(12, 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); {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,675 INFO L290 TraceCheckUtils]: 1: Hoare triple {47140#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,675 INFO L290 TraceCheckUtils]: 2: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,675 INFO L290 TraceCheckUtils]: 3: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,676 INFO L290 TraceCheckUtils]: 4: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,676 INFO L290 TraceCheckUtils]: 5: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,677 INFO L290 TraceCheckUtils]: 6: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,677 INFO L290 TraceCheckUtils]: 7: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,677 INFO L272 TraceCheckUtils]: 8: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret34#1 := rand_end_point(); {47138#true} is VALID [2022-02-20 23:45:26,677 INFO L290 TraceCheckUtils]: 9: Hoare triple {47138#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {47138#true} is VALID [2022-02-20 23:45:26,677 INFO L290 TraceCheckUtils]: 10: Hoare triple {47138#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {47138#true} is VALID [2022-02-20 23:45:26,677 INFO L290 TraceCheckUtils]: 11: Hoare triple {47138#true} assume true; {47138#true} is VALID [2022-02-20 23:45:26,678 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {47138#true} {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #308#return; {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:26,678 INFO L290 TraceCheckUtils]: 13: Hoare triple {47140#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {47145#(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:45:26,679 INFO L290 TraceCheckUtils]: 14: Hoare triple {47145#(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: L655 {47145#(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:45:26,679 INFO L290 TraceCheckUtils]: 15: Hoare triple {47145#(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; {47145#(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:45:26,680 INFO L290 TraceCheckUtils]: 16: Hoare triple {47145#(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: L656 {47145#(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:45:26,680 INFO L290 TraceCheckUtils]: 17: Hoare triple {47145#(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; {47145#(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:45:26,680 INFO L290 TraceCheckUtils]: 18: Hoare triple {47145#(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); {47145#(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:45:26,681 INFO L290 TraceCheckUtils]: 19: Hoare triple {47145#(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; {47145#(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:45:26,681 INFO L290 TraceCheckUtils]: 20: Hoare triple {47145#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {47145#(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:45:26,682 INFO L290 TraceCheckUtils]: 21: Hoare triple {47145#(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~ret20#1);havoc remove_one_#t~ret20#1; {47145#(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:45:26,682 INFO L290 TraceCheckUtils]: 22: Hoare triple {47145#(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_BEG, 4); srcloc: L700 {47145#(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:45:26,683 INFO L290 TraceCheckUtils]: 23: Hoare triple {47145#(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_END, 4); srcloc: L700-1 {47145#(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:45:26,683 INFO L290 TraceCheckUtils]: 24: Hoare triple {47145#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {47145#(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:45:26,683 INFO L290 TraceCheckUtils]: 25: Hoare triple {47145#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {47146#(= |ULTIMATE.start_remove_one_#t~mem23#1.offset| 0)} is VALID [2022-02-20 23:45:26,684 INFO L290 TraceCheckUtils]: 26: Hoare triple {47146#(= |ULTIMATE.start_remove_one_#t~mem23#1.offset| 0)} assume !(0 == remove_one_#t~mem23#1.offset); {47139#false} is VALID [2022-02-20 23:45:26,684 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:26,684 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:26,684 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [31722471] [2022-02-20 23:45:26,684 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [31722471] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:26,684 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:26,685 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:26,685 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [380891822] [2022-02-20 23:45:26,685 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:26,685 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2022-02-20 23:45:26,685 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:26,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:26,701 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:26,701 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:26,702 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:26,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:26,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:26,702 INFO L87 Difference]: Start difference. First operand 390 states and 511 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:27,193 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,194 INFO L93 Difference]: Finished difference Result 472 states and 596 transitions. [2022-02-20 23:45:27,194 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:27,194 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2022-02-20 23:45:27,194 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:27,194 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:27,196 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2022-02-20 23:45:27,196 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:27,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 297 transitions. [2022-02-20 23:45:27,197 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 297 transitions. [2022-02-20 23:45:27,395 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:45:27,403 INFO L225 Difference]: With dead ends: 472 [2022-02-20 23:45:27,403 INFO L226 Difference]: Without dead ends: 472 [2022-02-20 23:45:27,403 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:45:27,403 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 163 mSDsluCounter, 447 mSDsCounter, 0 mSdLazyCounter, 140 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 626 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 140 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:27,404 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [163 Valid, 626 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 140 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:27,404 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 472 states. [2022-02-20 23:45:27,408 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 472 to 390. [2022-02-20 23:45:27,408 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:27,408 INFO L82 GeneralOperation]: Start isEquivalent. First operand 472 states. Second operand has 390 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 373 states have internal predecessors, (486), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:27,409 INFO L74 IsIncluded]: Start isIncluded. First operand 472 states. Second operand has 390 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 373 states have internal predecessors, (486), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:27,409 INFO L87 Difference]: Start difference. First operand 472 states. Second operand has 390 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 373 states have internal predecessors, (486), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:27,416 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,416 INFO L93 Difference]: Finished difference Result 472 states and 596 transitions. [2022-02-20 23:45:27,417 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 596 transitions. [2022-02-20 23:45:27,417 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,417 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,418 INFO L74 IsIncluded]: Start isIncluded. First operand has 390 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 373 states have internal predecessors, (486), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 472 states. [2022-02-20 23:45:27,418 INFO L87 Difference]: Start difference. First operand has 390 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 373 states have internal predecessors, (486), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 472 states. [2022-02-20 23:45:27,426 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:27,426 INFO L93 Difference]: Finished difference Result 472 states and 596 transitions. [2022-02-20 23:45:27,426 INFO L276 IsEmpty]: Start isEmpty. Operand 472 states and 596 transitions. [2022-02-20 23:45:27,427 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:27,427 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:27,427 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:27,427 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:27,428 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 390 states, 323 states have (on average 1.5046439628482973) internal successors, (486), 373 states have internal predecessors, (486), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:27,433 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 390 states to 390 states and 510 transitions. [2022-02-20 23:45:27,433 INFO L78 Accepts]: Start accepts. Automaton has 390 states and 510 transitions. Word has length 27 [2022-02-20 23:45:27,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:27,434 INFO L470 AbstractCegarLoop]: Abstraction has 390 states and 510 transitions. [2022-02-20 23:45:27,434 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:27,434 INFO L276 IsEmpty]: Start isEmpty. Operand 390 states and 510 transitions. [2022-02-20 23:45:27,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:27,434 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:27,434 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:27,434 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2022-02-20 23:45:27,434 INFO L402 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:27,435 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:27,435 INFO L85 PathProgramCache]: Analyzing trace with hash -1017025601, now seen corresponding path program 1 times [2022-02-20 23:45:27,435 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:27,435 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11372933] [2022-02-20 23:45:27,435 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:27,435 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:27,444 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:27,491 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:27,493 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:27,495 INFO L290 TraceCheckUtils]: 0: Hoare triple {48959#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {48959#true} is VALID [2022-02-20 23:45:27,495 INFO L290 TraceCheckUtils]: 1: Hoare triple {48959#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {48959#true} is VALID [2022-02-20 23:45:27,495 INFO L290 TraceCheckUtils]: 2: Hoare triple {48959#true} assume true; {48959#true} is VALID [2022-02-20 23:45:27,495 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {48959#true} {48959#true} #306#return; {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 0: Hoare triple {48959#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(12, 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); {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 1: Hoare triple {48959#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 2: Hoare triple {48959#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 3: Hoare triple {48959#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 4: Hoare triple {48959#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 5: Hoare triple {48959#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L272 TraceCheckUtils]: 6: Hoare triple {48959#true} call main_#t~ret32#1 := rand_end_point(); {48959#true} is VALID [2022-02-20 23:45:27,496 INFO L290 TraceCheckUtils]: 7: Hoare triple {48959#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 8: Hoare triple {48959#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 9: Hoare triple {48959#true} assume true; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {48959#true} {48959#true} #306#return; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 11: Hoare triple {48959#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 12: Hoare triple {48959#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 13: Hoare triple {48959#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; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 14: Hoare triple {48959#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; {48959#true} is VALID [2022-02-20 23:45:27,497 INFO L290 TraceCheckUtils]: 15: Hoare triple {48959#true} havoc create_item_#t~switch6#1; {48959#true} is VALID [2022-02-20 23:45:27,498 INFO L290 TraceCheckUtils]: 16: Hoare triple {48959#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: L677-12 {48965#(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:45:27,499 INFO L290 TraceCheckUtils]: 17: Hoare triple {48965#(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; {48966#(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:45:27,499 INFO L290 TraceCheckUtils]: 18: Hoare triple {48966#(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; {48967#(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:45:27,499 INFO L290 TraceCheckUtils]: 19: Hoare triple {48967#(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))} create_item_#t~short12#1 := create_item_#t~short10#1; {48967#(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:45:27,500 INFO L290 TraceCheckUtils]: 20: Hoare triple {48967#(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~short12#1; {48967#(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:45:27,500 INFO L290 TraceCheckUtils]: 21: Hoare triple {48967#(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~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {48967#(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:45:27,501 INFO L290 TraceCheckUtils]: 22: Hoare triple {48967#(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~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {48968#(and (= |ULTIMATE.start_create_item_#t~mem14#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem14#1.base| 0))} is VALID [2022-02-20 23:45:27,501 INFO L290 TraceCheckUtils]: 23: Hoare triple {48968#(and (= |ULTIMATE.start_create_item_#t~mem14#1.offset| 0) (= |ULTIMATE.start_create_item_#t~mem14#1.base| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {48969#(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:45:27,502 INFO L290 TraceCheckUtils]: 24: Hoare triple {48969#(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: L680 {48969#(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:45:27,502 INFO L290 TraceCheckUtils]: 25: Hoare triple {48969#(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; {48960#false} is VALID [2022-02-20 23:45:27,502 INFO L290 TraceCheckUtils]: 26: Hoare triple {48960#false} assume !(1 == #valid[create_item_~link~0#1.base]); {48960#false} is VALID [2022-02-20 23:45:27,502 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:27,502 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:27,503 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11372933] [2022-02-20 23:45:27,503 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11372933] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:27,503 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:27,503 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2022-02-20 23:45:27,503 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279812063] [2022-02-20 23:45:27,503 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:27,503 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 27 [2022-02-20 23:45:27,504 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:27,504 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:45:27,521 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:27,521 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:27,521 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:27,521 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:27,522 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:27,522 INFO L87 Difference]: Start difference. First operand 390 states and 510 transitions. Second operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:45:28,248 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,249 INFO L93 Difference]: Finished difference Result 589 states and 763 transitions. [2022-02-20 23:45:28,249 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:28,249 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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 27 [2022-02-20 23:45:28,249 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:28,249 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:45:28,250 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 308 transitions. [2022-02-20 23:45:28,250 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:45:28,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 308 transitions. [2022-02-20 23:45:28,254 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 308 transitions. [2022-02-20 23:45:28,430 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:28,461 INFO L225 Difference]: With dead ends: 589 [2022-02-20 23:45:28,477 INFO L226 Difference]: Without dead ends: 589 [2022-02-20 23:45:28,477 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:28,478 INFO L933 BasicCegarLoop]: 238 mSDtfsCounter, 149 mSDsluCounter, 975 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 151 SdHoareTripleChecker+Valid, 1213 SdHoareTripleChecker+Invalid, 199 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:28,478 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [151 Valid, 1213 Invalid, 199 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:28,479 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 589 states. [2022-02-20 23:45:28,482 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 589 to 422. [2022-02-20 23:45:28,482 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:28,483 INFO L82 GeneralOperation]: Start isEquivalent. First operand 589 states. Second operand has 422 states, 355 states have (on average 1.476056338028169) internal successors, (524), 405 states have internal predecessors, (524), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:28,483 INFO L74 IsIncluded]: Start isIncluded. First operand 589 states. Second operand has 422 states, 355 states have (on average 1.476056338028169) internal successors, (524), 405 states have internal predecessors, (524), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:28,484 INFO L87 Difference]: Start difference. First operand 589 states. Second operand has 422 states, 355 states have (on average 1.476056338028169) internal successors, (524), 405 states have internal predecessors, (524), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:28,499 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,500 INFO L93 Difference]: Finished difference Result 589 states and 763 transitions. [2022-02-20 23:45:28,500 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 763 transitions. [2022-02-20 23:45:28,500 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,501 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,501 INFO L74 IsIncluded]: Start isIncluded. First operand has 422 states, 355 states have (on average 1.476056338028169) internal successors, (524), 405 states have internal predecessors, (524), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 589 states. [2022-02-20 23:45:28,501 INFO L87 Difference]: Start difference. First operand has 422 states, 355 states have (on average 1.476056338028169) internal successors, (524), 405 states have internal predecessors, (524), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 589 states. [2022-02-20 23:45:28,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:28,513 INFO L93 Difference]: Finished difference Result 589 states and 763 transitions. [2022-02-20 23:45:28,513 INFO L276 IsEmpty]: Start isEmpty. Operand 589 states and 763 transitions. [2022-02-20 23:45:28,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:28,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:28,514 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:28,514 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:28,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 422 states, 355 states have (on average 1.476056338028169) internal successors, (524), 405 states have internal predecessors, (524), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:28,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 422 states to 422 states and 548 transitions. [2022-02-20 23:45:28,520 INFO L78 Accepts]: Start accepts. Automaton has 422 states and 548 transitions. Word has length 27 [2022-02-20 23:45:28,520 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:28,520 INFO L470 AbstractCegarLoop]: Abstraction has 422 states and 548 transitions. [2022-02-20 23:45:28,520 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.5714285714285716) internal successors, (25), 7 states have internal predecessors, (25), 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:45:28,520 INFO L276 IsEmpty]: Start isEmpty. Operand 422 states and 548 transitions. [2022-02-20 23:45:28,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 23:45:28,521 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:28,521 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:28,521 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26 [2022-02-20 23:45:28,521 INFO L402 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:28,521 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:28,521 INFO L85 PathProgramCache]: Analyzing trace with hash -1017025407, now seen corresponding path program 1 times [2022-02-20 23:45:28,522 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:28,522 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2008358403] [2022-02-20 23:45:28,522 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:28,522 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:28,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,574 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:28,576 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:28,577 INFO L290 TraceCheckUtils]: 0: Hoare triple {51169#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {51169#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {51169#true} assume true; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {51169#true} {51169#true} #306#return; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 0: Hoare triple {51169#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(12, 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); {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 1: Hoare triple {51169#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 2: Hoare triple {51169#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 3: Hoare triple {51169#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {51169#true} is VALID [2022-02-20 23:45:28,578 INFO L290 TraceCheckUtils]: 4: Hoare triple {51169#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L290 TraceCheckUtils]: 5: Hoare triple {51169#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L272 TraceCheckUtils]: 6: Hoare triple {51169#true} call main_#t~ret32#1 := rand_end_point(); {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L290 TraceCheckUtils]: 7: Hoare triple {51169#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L290 TraceCheckUtils]: 8: Hoare triple {51169#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L290 TraceCheckUtils]: 9: Hoare triple {51169#true} assume true; {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {51169#true} {51169#true} #306#return; {51169#true} is VALID [2022-02-20 23:45:28,579 INFO L290 TraceCheckUtils]: 11: Hoare triple {51169#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {51175#(= |ULTIMATE.start_create_item_~item~0#1.offset| 0)} is VALID [2022-02-20 23:45:28,580 INFO L290 TraceCheckUtils]: 12: Hoare triple {51175#(= |ULTIMATE.start_create_item_~item~0#1.offset| 0)} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {51175#(= |ULTIMATE.start_create_item_~item~0#1.offset| 0)} is VALID [2022-02-20 23:45:28,580 INFO L290 TraceCheckUtils]: 13: Hoare triple {51175#(= |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; {51175#(= |ULTIMATE.start_create_item_~item~0#1.offset| 0)} is VALID [2022-02-20 23:45:28,580 INFO L290 TraceCheckUtils]: 14: Hoare triple {51175#(= |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; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,581 INFO L290 TraceCheckUtils]: 15: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} havoc create_item_#t~switch6#1; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,581 INFO L290 TraceCheckUtils]: 16: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} 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: L677-12 {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,582 INFO L290 TraceCheckUtils]: 17: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,582 INFO L290 TraceCheckUtils]: 18: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} assume !create_item_#t~short10#1; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,582 INFO L290 TraceCheckUtils]: 19: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} create_item_#t~short12#1 := create_item_#t~short10#1; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,583 INFO L290 TraceCheckUtils]: 20: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} assume !create_item_#t~short12#1; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,583 INFO L290 TraceCheckUtils]: 21: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,583 INFO L290 TraceCheckUtils]: 22: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,584 INFO L290 TraceCheckUtils]: 23: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} is VALID [2022-02-20 23:45:28,585 INFO L290 TraceCheckUtils]: 24: Hoare triple {51176#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (<= (+ |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (+ ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~link_field~0#1|)))} 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: L680 {51177#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* ~unnamed2~0~ITEM_NEXT 4) (* |ULTIMATE.start_create_item_~term_field~0#1| 4) 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:45:28,585 INFO L290 TraceCheckUtils]: 25: Hoare triple {51177#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* ~unnamed2~0~ITEM_NEXT 4) (* |ULTIMATE.start_create_item_~term_field~0#1| 4) 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~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {51177#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* ~unnamed2~0~ITEM_NEXT 4) (* |ULTIMATE.start_create_item_~term_field~0#1| 4) 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:45:28,586 INFO L290 TraceCheckUtils]: 26: Hoare triple {51177#(and (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_create_item_~term_field~0#1|) (<= (+ |ULTIMATE.start_create_item_~item~0#1.offset| (* ~unnamed2~0~ITEM_NEXT 4) (* |ULTIMATE.start_create_item_~term_field~0#1| 4) 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); {51170#false} is VALID [2022-02-20 23:45:28,586 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:28,586 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:28,586 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2008358403] [2022-02-20 23:45:28,586 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2008358403] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:28,586 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:28,586 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:28,586 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [227110536] [2022-02-20 23:45:28,587 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:28,587 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2022-02-20 23:45:28,587 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:28,587 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:28,604 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:28,605 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:28,605 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:28,605 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:28,605 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:28,605 INFO L87 Difference]: Start difference. First operand 422 states and 548 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:29,200 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,200 INFO L93 Difference]: Finished difference Result 828 states and 1070 transitions. [2022-02-20 23:45:29,200 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:29,200 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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 27 [2022-02-20 23:45:29,200 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:29,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:29,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-02-20 23:45:29,203 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:29,205 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 431 transitions. [2022-02-20 23:45:29,205 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 431 transitions. [2022-02-20 23:45:29,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 431 edges. 431 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:29,484 INFO L225 Difference]: With dead ends: 828 [2022-02-20 23:45:29,484 INFO L226 Difference]: Without dead ends: 828 [2022-02-20 23:45:29,484 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:29,485 INFO L933 BasicCegarLoop]: 215 mSDtfsCounter, 440 mSDsluCounter, 516 mSDsCounter, 0 mSdLazyCounter, 133 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 442 SdHoareTripleChecker+Valid, 731 SdHoareTripleChecker+Invalid, 137 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 133 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:29,485 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [442 Valid, 731 Invalid, 137 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 133 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:29,485 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 828 states. [2022-02-20 23:45:29,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 828 to 538. [2022-02-20 23:45:29,490 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:29,490 INFO L82 GeneralOperation]: Start isEquivalent. First operand 828 states. Second operand has 538 states, 471 states have (on average 1.4564755838641188) internal successors, (686), 521 states have internal predecessors, (686), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:29,491 INFO L74 IsIncluded]: Start isIncluded. First operand 828 states. Second operand has 538 states, 471 states have (on average 1.4564755838641188) internal successors, (686), 521 states have internal predecessors, (686), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:29,491 INFO L87 Difference]: Start difference. First operand 828 states. Second operand has 538 states, 471 states have (on average 1.4564755838641188) internal successors, (686), 521 states have internal predecessors, (686), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:29,511 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,511 INFO L93 Difference]: Finished difference Result 828 states and 1070 transitions. [2022-02-20 23:45:29,511 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1070 transitions. [2022-02-20 23:45:29,512 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:29,512 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:29,512 INFO L74 IsIncluded]: Start isIncluded. First operand has 538 states, 471 states have (on average 1.4564755838641188) internal successors, (686), 521 states have internal predecessors, (686), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 828 states. [2022-02-20 23:45:29,513 INFO L87 Difference]: Start difference. First operand has 538 states, 471 states have (on average 1.4564755838641188) internal successors, (686), 521 states have internal predecessors, (686), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) Second operand 828 states. [2022-02-20 23:45:29,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:29,532 INFO L93 Difference]: Finished difference Result 828 states and 1070 transitions. [2022-02-20 23:45:29,532 INFO L276 IsEmpty]: Start isEmpty. Operand 828 states and 1070 transitions. [2022-02-20 23:45:29,533 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:29,533 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:29,533 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:29,533 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:29,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 538 states, 471 states have (on average 1.4564755838641188) internal successors, (686), 521 states have internal predecessors, (686), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 12 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:29,542 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 538 states to 538 states and 710 transitions. [2022-02-20 23:45:29,542 INFO L78 Accepts]: Start accepts. Automaton has 538 states and 710 transitions. Word has length 27 [2022-02-20 23:45:29,542 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:29,543 INFO L470 AbstractCegarLoop]: Abstraction has 538 states and 710 transitions. [2022-02-20 23:45:29,543 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 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:45:29,543 INFO L276 IsEmpty]: Start isEmpty. Operand 538 states and 710 transitions. [2022-02-20 23:45:29,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:29,543 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:29,543 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:29,543 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2022-02-20 23:45:29,544 INFO L402 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:29,544 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:29,544 INFO L85 PathProgramCache]: Analyzing trace with hash 516753601, now seen corresponding path program 1 times [2022-02-20 23:45:29,544 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:29,544 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1477425622] [2022-02-20 23:45:29,544 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:29,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:29,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,612 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:29,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:29,615 INFO L290 TraceCheckUtils]: 0: Hoare triple {54205#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {54205#true} is VALID [2022-02-20 23:45:29,615 INFO L290 TraceCheckUtils]: 1: Hoare triple {54205#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {54205#true} is VALID [2022-02-20 23:45:29,615 INFO L290 TraceCheckUtils]: 2: Hoare triple {54205#true} assume true; {54205#true} is VALID [2022-02-20 23:45:29,616 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {54205#true} {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #308#return; {54207#(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:45:29,617 INFO L290 TraceCheckUtils]: 0: Hoare triple {54205#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(12, 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); {54207#(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:45:29,617 INFO L290 TraceCheckUtils]: 1: Hoare triple {54207#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {54207#(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:45:29,617 INFO L290 TraceCheckUtils]: 2: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {54207#(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:45:29,618 INFO L290 TraceCheckUtils]: 3: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {54207#(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:45:29,618 INFO L290 TraceCheckUtils]: 4: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {54207#(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:45:29,618 INFO L290 TraceCheckUtils]: 5: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {54207#(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:45:29,619 INFO L290 TraceCheckUtils]: 6: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {54207#(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:45:29,619 INFO L290 TraceCheckUtils]: 7: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {54207#(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:45:29,619 INFO L272 TraceCheckUtils]: 8: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} call main_#t~ret34#1 := rand_end_point(); {54205#true} is VALID [2022-02-20 23:45:29,619 INFO L290 TraceCheckUtils]: 9: Hoare triple {54205#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {54205#true} is VALID [2022-02-20 23:45:29,620 INFO L290 TraceCheckUtils]: 10: Hoare triple {54205#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {54205#true} is VALID [2022-02-20 23:45:29,620 INFO L290 TraceCheckUtils]: 11: Hoare triple {54205#true} assume true; {54205#true} is VALID [2022-02-20 23:45:29,620 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {54205#true} {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} #308#return; {54207#(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:45:29,621 INFO L290 TraceCheckUtils]: 13: Hoare triple {54207#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (<= 1 |#StackHeapBarrier|) (= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {54212#(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:45:29,621 INFO L290 TraceCheckUtils]: 14: Hoare triple {54212#(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: L655 {54212#(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:45:29,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {54212#(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; {54212#(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:45:29,622 INFO L290 TraceCheckUtils]: 16: Hoare triple {54212#(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: L656 {54212#(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:45:29,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {54212#(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; {54212#(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:45:29,623 INFO L290 TraceCheckUtils]: 18: Hoare triple {54212#(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); {54212#(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:45:29,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {54212#(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; {54212#(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:45:29,623 INFO L290 TraceCheckUtils]: 20: Hoare triple {54212#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {54212#(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:45:29,624 INFO L290 TraceCheckUtils]: 21: Hoare triple {54212#(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~ret20#1);havoc remove_one_#t~ret20#1; {54212#(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:45:29,624 INFO L290 TraceCheckUtils]: 22: Hoare triple {54212#(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_BEG, 4); srcloc: L700 {54212#(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:45:29,625 INFO L290 TraceCheckUtils]: 23: Hoare triple {54212#(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_END, 4); srcloc: L700-1 {54212#(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:45:29,625 INFO L290 TraceCheckUtils]: 24: Hoare triple {54212#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {54212#(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:45:29,626 INFO L290 TraceCheckUtils]: 25: Hoare triple {54212#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {54213#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} is VALID [2022-02-20 23:45:29,626 INFO L290 TraceCheckUtils]: 26: Hoare triple {54213#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} assume 0 == remove_one_#t~mem23#1.offset; {54213#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} is VALID [2022-02-20 23:45:29,626 INFO L290 TraceCheckUtils]: 27: Hoare triple {54213#(and (<= 1 |#StackHeapBarrier|) (= |ULTIMATE.start_remove_one_#t~mem23#1.base| 0))} assume !(remove_one_#t~mem23#1.base < #StackHeapBarrier); {54206#false} is VALID [2022-02-20 23:45:29,627 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:29,627 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:29,627 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1477425622] [2022-02-20 23:45:29,627 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1477425622] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:29,627 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:29,627 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:29,627 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1639369331] [2022-02-20 23:45:29,627 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:29,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 28 [2022-02-20 23:45:29,628 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:29,628 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:45:29,645 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:29,645 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:29,645 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:29,646 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:29,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:29,647 INFO L87 Difference]: Start difference. First operand 538 states and 710 transitions. Second operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:45:30,230 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:30,230 INFO L93 Difference]: Finished difference Result 783 states and 1007 transitions. [2022-02-20 23:45:30,230 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:30,230 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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 28 [2022-02-20 23:45:30,231 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:30,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:45:30,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2022-02-20 23:45:30,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:45:30,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 328 transitions. [2022-02-20 23:45:30,233 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 328 transitions. [2022-02-20 23:45:30,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 328 edges. 328 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:30,449 INFO L225 Difference]: With dead ends: 783 [2022-02-20 23:45:30,449 INFO L226 Difference]: Without dead ends: 783 [2022-02-20 23:45:30,449 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:45:30,450 INFO L933 BasicCegarLoop]: 196 mSDtfsCounter, 218 mSDsluCounter, 439 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 218 SdHoareTripleChecker+Valid, 635 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.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:30,450 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [218 Valid, 635 Invalid, 194 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:30,451 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 783 states. [2022-02-20 23:45:30,455 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 783 to 576. [2022-02-20 23:45:30,455 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:30,456 INFO L82 GeneralOperation]: Start isEquivalent. First operand 783 states. Second operand has 576 states, 505 states have (on average 1.4574257425742574) internal successors, (736), 557 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,456 INFO L74 IsIncluded]: Start isIncluded. First operand 783 states. Second operand has 576 states, 505 states have (on average 1.4574257425742574) internal successors, (736), 557 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,457 INFO L87 Difference]: Start difference. First operand 783 states. Second operand has 576 states, 505 states have (on average 1.4574257425742574) internal successors, (736), 557 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,474 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:30,474 INFO L93 Difference]: Finished difference Result 783 states and 1007 transitions. [2022-02-20 23:45:30,474 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1007 transitions. [2022-02-20 23:45:30,475 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:30,475 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:30,476 INFO L74 IsIncluded]: Start isIncluded. First operand has 576 states, 505 states have (on average 1.4574257425742574) internal successors, (736), 557 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 783 states. [2022-02-20 23:45:30,476 INFO L87 Difference]: Start difference. First operand has 576 states, 505 states have (on average 1.4574257425742574) internal successors, (736), 557 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 783 states. [2022-02-20 23:45:30,494 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:30,494 INFO L93 Difference]: Finished difference Result 783 states and 1007 transitions. [2022-02-20 23:45:30,494 INFO L276 IsEmpty]: Start isEmpty. Operand 783 states and 1007 transitions. [2022-02-20 23:45:30,495 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:30,495 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:30,495 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:30,495 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:30,496 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 576 states, 505 states have (on average 1.4574257425742574) internal successors, (736), 557 states have internal predecessors, (736), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:30,505 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 576 states to 576 states and 766 transitions. [2022-02-20 23:45:30,505 INFO L78 Accepts]: Start accepts. Automaton has 576 states and 766 transitions. Word has length 28 [2022-02-20 23:45:30,505 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:30,505 INFO L470 AbstractCegarLoop]: Abstraction has 576 states and 766 transitions. [2022-02-20 23:45:30,506 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.5) internal successors, (26), 5 states have internal predecessors, (26), 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:45:30,506 INFO L276 IsEmpty]: Start isEmpty. Operand 576 states and 766 transitions. [2022-02-20 23:45:30,506 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 23:45:30,506 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:30,506 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:30,506 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable28 [2022-02-20 23:45:30,506 INFO L402 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:30,507 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:30,507 INFO L85 PathProgramCache]: Analyzing trace with hash 750963923, now seen corresponding path program 1 times [2022-02-20 23:45:30,507 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:30,507 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1909814701] [2022-02-20 23:45:30,507 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:30,507 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:30,517 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:30,543 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:30,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:30,546 INFO L290 TraceCheckUtils]: 0: Hoare triple {57145#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {57145#true} is VALID [2022-02-20 23:45:30,546 INFO L290 TraceCheckUtils]: 1: Hoare triple {57145#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {57145#true} is VALID [2022-02-20 23:45:30,546 INFO L290 TraceCheckUtils]: 2: Hoare triple {57145#true} assume true; {57145#true} is VALID [2022-02-20 23:45:30,546 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {57145#true} {57145#true} #306#return; {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 0: Hoare triple {57145#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(12, 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); {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 1: Hoare triple {57145#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 2: Hoare triple {57145#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 3: Hoare triple {57145#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 4: Hoare triple {57145#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 5: Hoare triple {57145#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L272 TraceCheckUtils]: 6: Hoare triple {57145#true} call main_#t~ret32#1 := rand_end_point(); {57145#true} is VALID [2022-02-20 23:45:30,547 INFO L290 TraceCheckUtils]: 7: Hoare triple {57145#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {57145#true} is VALID [2022-02-20 23:45:30,548 INFO L290 TraceCheckUtils]: 8: Hoare triple {57145#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {57145#true} is VALID [2022-02-20 23:45:30,548 INFO L290 TraceCheckUtils]: 9: Hoare triple {57145#true} assume true; {57145#true} is VALID [2022-02-20 23:45:30,548 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {57145#true} {57145#true} #306#return; {57145#true} is VALID [2022-02-20 23:45:30,549 INFO L290 TraceCheckUtils]: 11: Hoare triple {57145#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,549 INFO L290 TraceCheckUtils]: 12: Hoare triple {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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); {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,549 INFO L290 TraceCheckUtils]: 13: Hoare triple {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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; {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,550 INFO L290 TraceCheckUtils]: 14: Hoare triple {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~switch6#1;create_item_#t~switch6#1 := create_item_#t~switch6#1 || create_item_~at#1 == ~unnamed1~0~LIST_END; {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,550 INFO L290 TraceCheckUtils]: 15: Hoare triple {57151#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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_PREV;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_NEXT; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,550 INFO L290 TraceCheckUtils]: 16: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_#t~switch6#1; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,551 INFO L290 TraceCheckUtils]: 17: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |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: L677-12 {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,551 INFO L290 TraceCheckUtils]: 18: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |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; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,552 INFO L290 TraceCheckUtils]: 19: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short10#1; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,552 INFO L290 TraceCheckUtils]: 20: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_#t~short12#1 := create_item_#t~short10#1; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,552 INFO L290 TraceCheckUtils]: 21: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short12#1; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,553 INFO L290 TraceCheckUtils]: 22: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,553 INFO L290 TraceCheckUtils]: 23: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,554 INFO L290 TraceCheckUtils]: 24: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,554 INFO L290 TraceCheckUtils]: 25: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#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: L680 {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,555 INFO L290 TraceCheckUtils]: 26: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |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~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:30,555 INFO L290 TraceCheckUtils]: 27: Hoare triple {57152#(and (<= |ULTIMATE.start_create_item_~term_field~0#1| ~unnamed2~0~ITEM_NEXT) (<= ~unnamed2~0~ITEM_NEXT |ULTIMATE.start_create_item_~term_field~0#1|) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} 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); {57146#false} is VALID [2022-02-20 23:45:30,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:45:30,555 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:30,555 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1909814701] [2022-02-20 23:45:30,556 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1909814701] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:30,556 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:30,556 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:30,556 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [657785402] [2022-02-20 23:45:30,556 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:30,556 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2022-02-20 23:45:30,557 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:30,557 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:45:30,572 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 28 edges. 28 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:30,572 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:30,572 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:30,572 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:30,573 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:30,573 INFO L87 Difference]: Start difference. First operand 576 states and 766 transitions. Second operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:45:31,086 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:31,086 INFO L93 Difference]: Finished difference Result 865 states and 1118 transitions. [2022-02-20 23:45:31,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:31,086 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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 28 [2022-02-20 23:45:31,086 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:31,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:45:31,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2022-02-20 23:45:31,088 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:45:31,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 430 transitions. [2022-02-20 23:45:31,089 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 430 transitions. [2022-02-20 23:45:31,347 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 430 edges. 430 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:31,369 INFO L225 Difference]: With dead ends: 865 [2022-02-20 23:45:31,369 INFO L226 Difference]: Without dead ends: 865 [2022-02-20 23:45:31,369 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:45:31,370 INFO L933 BasicCegarLoop]: 316 mSDtfsCounter, 299 mSDsluCounter, 265 mSDsCounter, 0 mSdLazyCounter, 189 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 303 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 189 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 189 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:31,370 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [303 Valid, 581 Invalid, 189 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 189 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:31,370 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 865 states. [2022-02-20 23:45:31,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 865 to 459. [2022-02-20 23:45:31,375 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:31,375 INFO L82 GeneralOperation]: Start isEquivalent. First operand 865 states. Second operand has 459 states, 389 states have (on average 1.455012853470437) internal successors, (566), 440 states have internal predecessors, (566), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,376 INFO L74 IsIncluded]: Start isIncluded. First operand 865 states. Second operand has 459 states, 389 states have (on average 1.455012853470437) internal successors, (566), 440 states have internal predecessors, (566), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,376 INFO L87 Difference]: Start difference. First operand 865 states. Second operand has 459 states, 389 states have (on average 1.455012853470437) internal successors, (566), 440 states have internal predecessors, (566), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,399 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:31,399 INFO L93 Difference]: Finished difference Result 865 states and 1118 transitions. [2022-02-20 23:45:31,399 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1118 transitions. [2022-02-20 23:45:31,400 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:31,400 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:31,401 INFO L74 IsIncluded]: Start isIncluded. First operand has 459 states, 389 states have (on average 1.455012853470437) internal successors, (566), 440 states have internal predecessors, (566), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 865 states. [2022-02-20 23:45:31,401 INFO L87 Difference]: Start difference. First operand has 459 states, 389 states have (on average 1.455012853470437) internal successors, (566), 440 states have internal predecessors, (566), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) Second operand 865 states. [2022-02-20 23:45:31,422 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:31,422 INFO L93 Difference]: Finished difference Result 865 states and 1118 transitions. [2022-02-20 23:45:31,422 INFO L276 IsEmpty]: Start isEmpty. Operand 865 states and 1118 transitions. [2022-02-20 23:45:31,423 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:31,423 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:31,423 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:31,423 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:31,424 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 459 states, 389 states have (on average 1.455012853470437) internal successors, (566), 440 states have internal predecessors, (566), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 13 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:31,430 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 459 states to 459 states and 596 transitions. [2022-02-20 23:45:31,431 INFO L78 Accepts]: Start accepts. Automaton has 459 states and 596 transitions. Word has length 28 [2022-02-20 23:45:31,431 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:31,431 INFO L470 AbstractCegarLoop]: Abstraction has 459 states and 596 transitions. [2022-02-20 23:45:31,431 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 8.666666666666666) internal successors, (26), 4 states have internal predecessors, (26), 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:45:31,431 INFO L276 IsEmpty]: Start isEmpty. Operand 459 states and 596 transitions. [2022-02-20 23:45:31,431 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:31,431 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:31,432 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:45:31,432 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2022-02-20 23:45:31,432 INFO L402 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:31,432 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:31,432 INFO L85 PathProgramCache]: Analyzing trace with hash -933658936, now seen corresponding path program 1 times [2022-02-20 23:45:31,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:31,432 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [546259302] [2022-02-20 23:45:31,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:31,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:31,443 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:31,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:31,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:31,480 INFO L290 TraceCheckUtils]: 0: Hoare triple {60209#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {60209#true} is VALID [2022-02-20 23:45:31,480 INFO L290 TraceCheckUtils]: 1: Hoare triple {60209#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:31,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:31,481 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {60209#true} #308#return; {60215#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:31,481 INFO L290 TraceCheckUtils]: 0: Hoare triple {60209#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(12, 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); {60209#true} is VALID [2022-02-20 23:45:31,481 INFO L290 TraceCheckUtils]: 1: Hoare triple {60209#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {60209#true} is VALID [2022-02-20 23:45:31,481 INFO L290 TraceCheckUtils]: 2: Hoare triple {60209#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L290 TraceCheckUtils]: 3: Hoare triple {60209#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L290 TraceCheckUtils]: 4: Hoare triple {60209#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L290 TraceCheckUtils]: 5: Hoare triple {60209#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L290 TraceCheckUtils]: 6: Hoare triple {60209#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L290 TraceCheckUtils]: 7: Hoare triple {60209#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L272 TraceCheckUtils]: 8: Hoare triple {60209#true} call main_#t~ret34#1 := rand_end_point(); {60209#true} is VALID [2022-02-20 23:45:31,482 INFO L290 TraceCheckUtils]: 9: Hoare triple {60209#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {60209#true} is VALID [2022-02-20 23:45:31,483 INFO L290 TraceCheckUtils]: 10: Hoare triple {60209#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:31,483 INFO L290 TraceCheckUtils]: 11: Hoare triple {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} assume true; {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} is VALID [2022-02-20 23:45:31,483 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {60217#(<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG)} {60209#true} #308#return; {60215#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:31,484 INFO L290 TraceCheckUtils]: 13: Hoare triple {60215#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,484 INFO L290 TraceCheckUtils]: 14: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |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: L655 {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,484 INFO L290 TraceCheckUtils]: 15: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |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; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,485 INFO L290 TraceCheckUtils]: 16: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |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: L656 {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,485 INFO L290 TraceCheckUtils]: 17: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |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; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,485 INFO L290 TraceCheckUtils]: 18: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,485 INFO L290 TraceCheckUtils]: 19: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,486 INFO L290 TraceCheckUtils]: 20: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,486 INFO L290 TraceCheckUtils]: 21: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,486 INFO L290 TraceCheckUtils]: 22: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#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_BEG, 4); srcloc: L700 {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,486 INFO L290 TraceCheckUtils]: 23: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#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_END, 4); srcloc: L700-1 {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,487 INFO L290 TraceCheckUtils]: 24: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,487 INFO L290 TraceCheckUtils]: 25: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_NEXT; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,487 INFO L290 TraceCheckUtils]: 26: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:31,488 INFO L290 TraceCheckUtils]: 27: Hoare triple {60216#(not (= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume ~unnamed1~0~LIST_END == remove_one_~from#1;remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_NEXT; {60210#false} is VALID [2022-02-20 23:45:31,488 INFO L290 TraceCheckUtils]: 28: Hoare triple {60210#false} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {60210#false} is VALID [2022-02-20 23:45:31,488 INFO L290 TraceCheckUtils]: 29: Hoare triple {60210#false} 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); {60210#false} is VALID [2022-02-20 23:45:31,488 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:31,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:31,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [546259302] [2022-02-20 23:45:31,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [546259302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:31,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:31,489 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:31,489 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983294703] [2022-02-20 23:45:31,489 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:31,489 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:31,489 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:31,489 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:31,505 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:45:31,505 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:31,505 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:31,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:31,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:31,506 INFO L87 Difference]: Start difference. First operand 459 states and 596 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:31,891 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:31,891 INFO L93 Difference]: Finished difference Result 929 states and 1212 transitions. [2022-02-20 23:45:31,891 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:31,892 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:31,892 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:31,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:31,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 366 transitions. [2022-02-20 23:45:31,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:31,895 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 366 transitions. [2022-02-20 23:45:31,895 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 366 transitions. [2022-02-20 23:45:32,100 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 366 edges. 366 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:32,124 INFO L225 Difference]: With dead ends: 929 [2022-02-20 23:45:32,124 INFO L226 Difference]: Without dead ends: 929 [2022-02-20 23:45:32,124 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:32,125 INFO L933 BasicCegarLoop]: 259 mSDtfsCounter, 232 mSDsluCounter, 679 mSDsCounter, 0 mSdLazyCounter, 34 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 236 SdHoareTripleChecker+Valid, 938 SdHoareTripleChecker+Invalid, 36 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 34 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:32,125 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [236 Valid, 938 Invalid, 36 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 34 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:32,125 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 929 states. [2022-02-20 23:45:32,129 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 929 to 534. [2022-02-20 23:45:32,130 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:32,130 INFO L82 GeneralOperation]: Start isEquivalent. First operand 929 states. Second operand has 534 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 510 states have internal predecessors, (673), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,130 INFO L74 IsIncluded]: Start isIncluded. First operand 929 states. Second operand has 534 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 510 states have internal predecessors, (673), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,131 INFO L87 Difference]: Start difference. First operand 929 states. Second operand has 534 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 510 states have internal predecessors, (673), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:32,154 INFO L93 Difference]: Finished difference Result 929 states and 1212 transitions. [2022-02-20 23:45:32,154 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1212 transitions. [2022-02-20 23:45:32,155 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:32,155 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:32,155 INFO L74 IsIncluded]: Start isIncluded. First operand has 534 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 510 states have internal predecessors, (673), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) Second operand 929 states. [2022-02-20 23:45:32,155 INFO L87 Difference]: Start difference. First operand has 534 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 510 states have internal predecessors, (673), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) Second operand 929 states. [2022-02-20 23:45:32,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:32,178 INFO L93 Difference]: Finished difference Result 929 states and 1212 transitions. [2022-02-20 23:45:32,178 INFO L276 IsEmpty]: Start isEmpty. Operand 929 states and 1212 transitions. [2022-02-20 23:45:32,179 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:32,179 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:32,179 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:32,179 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:32,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 534 states, 464 states have (on average 1.4504310344827587) internal successors, (673), 510 states have internal predecessors, (673), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:32,188 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 534 states to 534 states and 703 transitions. [2022-02-20 23:45:32,188 INFO L78 Accepts]: Start accepts. Automaton has 534 states and 703 transitions. Word has length 30 [2022-02-20 23:45:32,188 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:32,189 INFO L470 AbstractCegarLoop]: Abstraction has 534 states and 703 transitions. [2022-02-20 23:45:32,189 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:32,189 INFO L276 IsEmpty]: Start isEmpty. Operand 534 states and 703 transitions. [2022-02-20 23:45:32,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:32,189 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:32,189 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:32,189 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2022-02-20 23:45:32,190 INFO L402 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:32,190 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:32,190 INFO L85 PathProgramCache]: Analyzing trace with hash -933657014, now seen corresponding path program 1 times [2022-02-20 23:45:32,190 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:32,190 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [690696218] [2022-02-20 23:45:32,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:32,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:32,200 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:32,248 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:32,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:32,261 INFO L290 TraceCheckUtils]: 0: Hoare triple {63543#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {63543#true} is VALID [2022-02-20 23:45:32,261 INFO L290 TraceCheckUtils]: 1: Hoare triple {63543#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:32,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:32,262 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {63543#true} #308#return; {63549#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|) (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:32,262 INFO L290 TraceCheckUtils]: 0: Hoare triple {63543#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(12, 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); {63543#true} is VALID [2022-02-20 23:45:32,262 INFO L290 TraceCheckUtils]: 1: Hoare triple {63543#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {63543#true} is VALID [2022-02-20 23:45:32,262 INFO L290 TraceCheckUtils]: 2: Hoare triple {63543#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {63543#true} is VALID [2022-02-20 23:45:32,262 INFO L290 TraceCheckUtils]: 3: Hoare triple {63543#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {63543#true} is VALID [2022-02-20 23:45:32,263 INFO L290 TraceCheckUtils]: 4: Hoare triple {63543#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {63543#true} is VALID [2022-02-20 23:45:32,263 INFO L290 TraceCheckUtils]: 5: Hoare triple {63543#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {63543#true} is VALID [2022-02-20 23:45:32,263 INFO L290 TraceCheckUtils]: 6: Hoare triple {63543#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {63543#true} is VALID [2022-02-20 23:45:32,263 INFO L290 TraceCheckUtils]: 7: Hoare triple {63543#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {63543#true} is VALID [2022-02-20 23:45:32,263 INFO L272 TraceCheckUtils]: 8: Hoare triple {63543#true} call main_#t~ret34#1 := rand_end_point(); {63543#true} is VALID [2022-02-20 23:45:32,263 INFO L290 TraceCheckUtils]: 9: Hoare triple {63543#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {63543#true} is VALID [2022-02-20 23:45:32,271 INFO L290 TraceCheckUtils]: 10: Hoare triple {63543#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:32,272 INFO L290 TraceCheckUtils]: 11: Hoare triple {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} assume true; {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:32,272 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {63553#(and (<= ~unnamed1~0~LIST_BEG |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_BEG))} {63543#true} #308#return; {63549#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|) (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_BEG))} is VALID [2022-02-20 23:45:32,273 INFO L290 TraceCheckUtils]: 13: Hoare triple {63549#(and (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|) (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_BEG))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {63550#(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:45:32,273 INFO L290 TraceCheckUtils]: 14: Hoare triple {63550#(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: L655 {63550#(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:45:32,273 INFO L290 TraceCheckUtils]: 15: Hoare triple {63550#(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; {63550#(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:45:32,274 INFO L290 TraceCheckUtils]: 16: Hoare triple {63550#(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: L656 {63550#(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:45:32,274 INFO L290 TraceCheckUtils]: 17: Hoare triple {63550#(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; {63550#(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:45:32,275 INFO L290 TraceCheckUtils]: 18: Hoare triple {63550#(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); {63550#(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:45:32,275 INFO L290 TraceCheckUtils]: 19: Hoare triple {63550#(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; {63550#(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:45:32,275 INFO L290 TraceCheckUtils]: 20: Hoare triple {63550#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_BEG) (<= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {63550#(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:45:32,276 INFO L290 TraceCheckUtils]: 21: Hoare triple {63550#(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~ret20#1);havoc remove_one_#t~ret20#1; {63550#(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:45:32,276 INFO L290 TraceCheckUtils]: 22: Hoare triple {63550#(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~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_BEG, 4); srcloc: L700 {63551#(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:45:32,277 INFO L290 TraceCheckUtils]: 23: Hoare triple {63551#(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~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_END, 4); srcloc: L700-1 {63552#(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:45:32,277 INFO L290 TraceCheckUtils]: 24: Hoare triple {63552#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {63552#(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:45:32,278 INFO L290 TraceCheckUtils]: 25: Hoare triple {63552#(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~ite25#1 := ~unnamed2~0~ITEM_NEXT; {63552#(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:45:32,278 INFO L290 TraceCheckUtils]: 26: Hoare triple {63552#(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~ite25#1;havoc remove_one_#t~ite25#1; {63552#(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:45:32,278 INFO L290 TraceCheckUtils]: 27: Hoare triple {63552#(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~ite26#1 := ~unnamed2~0~ITEM_PREV; {63552#(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:45:32,279 INFO L290 TraceCheckUtils]: 28: Hoare triple {63552#(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~ite26#1;havoc remove_one_#t~ite26#1; {63552#(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:45:32,279 INFO L290 TraceCheckUtils]: 29: Hoare triple {63552#(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); {63544#false} is VALID [2022-02-20 23:45:32,280 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:32,280 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:32,280 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [690696218] [2022-02-20 23:45:32,280 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [690696218] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:32,280 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:32,280 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:32,280 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1140810265] [2022-02-20 23:45:32,280 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:32,281 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:32,281 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:32,281 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:32,299 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:45:32,299 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:32,299 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:32,299 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:32,299 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:32,299 INFO L87 Difference]: Start difference. First operand 534 states and 703 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:33,417 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,417 INFO L93 Difference]: Finished difference Result 1132 states and 1464 transitions. [2022-02-20 23:45:33,417 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:33,417 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:33,417 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:33,418 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:33,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 505 transitions. [2022-02-20 23:45:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:33,422 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 505 transitions. [2022-02-20 23:45:33,422 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 505 transitions. [2022-02-20 23:45:33,744 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 505 edges. 505 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:33,778 INFO L225 Difference]: With dead ends: 1132 [2022-02-20 23:45:33,778 INFO L226 Difference]: Without dead ends: 1132 [2022-02-20 23:45:33,779 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:45:33,779 INFO L933 BasicCegarLoop]: 323 mSDtfsCounter, 501 mSDsluCounter, 1315 mSDsCounter, 0 mSdLazyCounter, 210 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 505 SdHoareTripleChecker+Valid, 1638 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:33,779 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [505 Valid, 1638 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 210 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:33,780 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1132 states. [2022-02-20 23:45:33,785 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1132 to 552. [2022-02-20 23:45:33,785 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:33,786 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1132 states. Second operand has 552 states, 482 states have (on average 1.450207468879668) internal successors, (699), 528 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,786 INFO L74 IsIncluded]: Start isIncluded. First operand 1132 states. Second operand has 552 states, 482 states have (on average 1.450207468879668) internal successors, (699), 528 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,786 INFO L87 Difference]: Start difference. First operand 1132 states. Second operand has 552 states, 482 states have (on average 1.450207468879668) internal successors, (699), 528 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,819 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,819 INFO L93 Difference]: Finished difference Result 1132 states and 1464 transitions. [2022-02-20 23:45:33,819 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1464 transitions. [2022-02-20 23:45:33,820 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:33,820 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:33,820 INFO L74 IsIncluded]: Start isIncluded. First operand has 552 states, 482 states have (on average 1.450207468879668) internal successors, (699), 528 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) Second operand 1132 states. [2022-02-20 23:45:33,821 INFO L87 Difference]: Start difference. First operand has 552 states, 482 states have (on average 1.450207468879668) internal successors, (699), 528 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) Second operand 1132 states. [2022-02-20 23:45:33,857 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:33,857 INFO L93 Difference]: Finished difference Result 1132 states and 1464 transitions. [2022-02-20 23:45:33,857 INFO L276 IsEmpty]: Start isEmpty. Operand 1132 states and 1464 transitions. [2022-02-20 23:45:33,858 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:33,858 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:33,859 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:33,859 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:33,859 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 552 states, 482 states have (on average 1.450207468879668) internal successors, (699), 528 states have internal predecessors, (699), 10 states have call successors, (10), 5 states have call predecessors, (10), 10 states have return successors, (20), 18 states have call predecessors, (20), 10 states have call successors, (20) [2022-02-20 23:45:33,868 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 552 states to 552 states and 729 transitions. [2022-02-20 23:45:33,868 INFO L78 Accepts]: Start accepts. Automaton has 552 states and 729 transitions. Word has length 30 [2022-02-20 23:45:33,868 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:33,868 INFO L470 AbstractCegarLoop]: Abstraction has 552 states and 729 transitions. [2022-02-20 23:45:33,868 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:33,868 INFO L276 IsEmpty]: Start isEmpty. Operand 552 states and 729 transitions. [2022-02-20 23:45:33,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:33,868 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:33,868 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:45:33,868 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2022-02-20 23:45:33,868 INFO L402 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:33,869 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:33,869 INFO L85 PathProgramCache]: Analyzing trace with hash -1615988093, now seen corresponding path program 1 times [2022-02-20 23:45:33,869 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:33,869 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1204235618] [2022-02-20 23:45:33,869 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:33,869 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:33,880 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,958 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:33,959 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:33,961 INFO L290 TraceCheckUtils]: 0: Hoare triple {67516#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {67516#true} is VALID [2022-02-20 23:45:33,961 INFO L290 TraceCheckUtils]: 1: Hoare triple {67516#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {67516#true} is VALID [2022-02-20 23:45:33,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {67516#true} assume true; {67516#true} is VALID [2022-02-20 23:45:33,962 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {67516#true} {67518#(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))} #308#return; {67518#(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:45:33,962 INFO L290 TraceCheckUtils]: 0: Hoare triple {67516#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(12, 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); {67518#(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:45:33,963 INFO L290 TraceCheckUtils]: 1: Hoare triple {67518#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {67518#(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:45:33,963 INFO L290 TraceCheckUtils]: 2: Hoare triple {67518#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {67518#(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:45:33,964 INFO L290 TraceCheckUtils]: 3: Hoare triple {67518#(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 !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {67518#(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:45:33,964 INFO L290 TraceCheckUtils]: 4: Hoare triple {67518#(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~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {67518#(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:45:33,965 INFO L290 TraceCheckUtils]: 5: Hoare triple {67518#(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 !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {67518#(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:45:33,965 INFO L290 TraceCheckUtils]: 6: Hoare triple {67518#(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~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {67518#(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:45:33,965 INFO L290 TraceCheckUtils]: 7: Hoare triple {67518#(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 !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {67518#(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:45:33,966 INFO L272 TraceCheckUtils]: 8: Hoare triple {67518#(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~ret34#1 := rand_end_point(); {67516#true} is VALID [2022-02-20 23:45:33,966 INFO L290 TraceCheckUtils]: 9: Hoare triple {67516#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {67516#true} is VALID [2022-02-20 23:45:33,966 INFO L290 TraceCheckUtils]: 10: Hoare triple {67516#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {67516#true} is VALID [2022-02-20 23:45:33,966 INFO L290 TraceCheckUtils]: 11: Hoare triple {67516#true} assume true; {67516#true} is VALID [2022-02-20 23:45:33,966 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {67516#true} {67518#(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))} #308#return; {67518#(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:45:33,967 INFO L290 TraceCheckUtils]: 13: Hoare triple {67518#(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~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {67523#(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:45:33,967 INFO L290 TraceCheckUtils]: 14: Hoare triple {67523#(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: L655 {67523#(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:45:33,968 INFO L290 TraceCheckUtils]: 15: Hoare triple {67523#(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; {67523#(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:45:33,968 INFO L290 TraceCheckUtils]: 16: Hoare triple {67523#(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: L656 {67523#(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:45:33,969 INFO L290 TraceCheckUtils]: 17: Hoare triple {67523#(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; {67523#(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:45:33,969 INFO L290 TraceCheckUtils]: 18: Hoare triple {67523#(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); {67523#(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:45:33,969 INFO L290 TraceCheckUtils]: 19: Hoare triple {67523#(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; {67523#(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:45:33,970 INFO L290 TraceCheckUtils]: 20: Hoare triple {67523#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {67523#(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:45:33,970 INFO L290 TraceCheckUtils]: 21: Hoare triple {67523#(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~ret20#1);havoc remove_one_#t~ret20#1; {67523#(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:45:33,971 INFO L290 TraceCheckUtils]: 22: Hoare triple {67523#(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_BEG, 4); srcloc: L700 {67523#(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:45:33,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {67523#(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_END, 4); srcloc: L700-1 {67523#(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:45:33,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {67523#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {67523#(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:45:33,972 INFO L290 TraceCheckUtils]: 25: Hoare triple {67523#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {67524#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} is VALID [2022-02-20 23:45:33,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {67524#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} assume 0 == remove_one_#t~mem23#1.offset; {67524#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} is VALID [2022-02-20 23:45:33,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {67524#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {67524#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} is VALID [2022-02-20 23:45:33,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {67524#(and (= 3 |ULTIMATE.start_remove_one_~list#1.base|) (= (select |#valid| 3) 1) (not (= 3 |ULTIMATE.start_remove_one_#t~mem23#1.base|)))} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {67525#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} is VALID [2022-02-20 23:45:33,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {67525#(= (select |#valid| |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base|) 1)} assume !(1 == #valid[#Ultimate.C_memset_#ptr#1.base]); {67517#false} is VALID [2022-02-20 23:45:33,974 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:33,975 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:33,975 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1204235618] [2022-02-20 23:45:33,975 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1204235618] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:33,975 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:33,975 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:33,975 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [794698163] [2022-02-20 23:45:33,975 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:33,976 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:33,976 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:33,976 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:33,994 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:45:33,994 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:33,994 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:33,996 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:33,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:33,997 INFO L87 Difference]: Start difference. First operand 552 states and 729 transitions. Second operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:35,289 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,290 INFO L93 Difference]: Finished difference Result 1036 states and 1327 transitions. [2022-02-20 23:45:35,290 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:35,290 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:35,290 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:35,290 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:35,292 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 547 transitions. [2022-02-20 23:45:35,293 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:35,294 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 547 transitions. [2022-02-20 23:45:35,295 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 547 transitions. [2022-02-20 23:45:35,629 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 547 edges. 547 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:35,659 INFO L225 Difference]: With dead ends: 1036 [2022-02-20 23:45:35,660 INFO L226 Difference]: Without dead ends: 1036 [2022-02-20 23:45:35,660 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:45:35,660 INFO L933 BasicCegarLoop]: 256 mSDtfsCounter, 461 mSDsluCounter, 738 mSDsCounter, 0 mSdLazyCounter, 559 mSolverCounterSat, 28 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 994 SdHoareTripleChecker+Invalid, 587 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 28 IncrementalHoareTripleChecker+Valid, 559 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:35,660 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 994 Invalid, 587 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [28 Valid, 559 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:35,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1036 states. [2022-02-20 23:45:35,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1036 to 592. [2022-02-20 23:45:35,666 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:35,667 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1036 states. Second operand has 592 states, 518 states have (on average 1.4343629343629343) internal successors, (743), 565 states have internal predecessors, (743), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:35,667 INFO L74 IsIncluded]: Start isIncluded. First operand 1036 states. Second operand has 592 states, 518 states have (on average 1.4343629343629343) internal successors, (743), 565 states have internal predecessors, (743), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:35,667 INFO L87 Difference]: Start difference. First operand 1036 states. Second operand has 592 states, 518 states have (on average 1.4343629343629343) internal successors, (743), 565 states have internal predecessors, (743), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:35,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,695 INFO L93 Difference]: Finished difference Result 1036 states and 1327 transitions. [2022-02-20 23:45:35,695 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1327 transitions. [2022-02-20 23:45:35,696 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:35,696 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:35,696 INFO L74 IsIncluded]: Start isIncluded. First operand has 592 states, 518 states have (on average 1.4343629343629343) internal successors, (743), 565 states have internal predecessors, (743), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 1036 states. [2022-02-20 23:45:35,697 INFO L87 Difference]: Start difference. First operand has 592 states, 518 states have (on average 1.4343629343629343) internal successors, (743), 565 states have internal predecessors, (743), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 1036 states. [2022-02-20 23:45:35,729 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:35,729 INFO L93 Difference]: Finished difference Result 1036 states and 1327 transitions. [2022-02-20 23:45:35,729 INFO L276 IsEmpty]: Start isEmpty. Operand 1036 states and 1327 transitions. [2022-02-20 23:45:35,730 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:35,730 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:35,730 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:35,730 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:35,730 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 592 states, 518 states have (on average 1.4343629343629343) internal successors, (743), 565 states have internal predecessors, (743), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:35,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 592 states to 592 states and 779 transitions. [2022-02-20 23:45:35,740 INFO L78 Accepts]: Start accepts. Automaton has 592 states and 779 transitions. Word has length 30 [2022-02-20 23:45:35,740 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:35,740 INFO L470 AbstractCegarLoop]: Abstraction has 592 states and 779 transitions. [2022-02-20 23:45:35,740 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 5.6) internal successors, (28), 6 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:45:35,740 INFO L276 IsEmpty]: Start isEmpty. Operand 592 states and 779 transitions. [2022-02-20 23:45:35,740 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:35,740 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:35,741 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:45:35,741 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32 [2022-02-20 23:45:35,741 INFO L402 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:35,741 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:35,741 INFO L85 PathProgramCache]: Analyzing trace with hash -1342481239, now seen corresponding path program 1 times [2022-02-20 23:45:35,741 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:35,741 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [608273931] [2022-02-20 23:45:35,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:35,741 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:35,757 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:35,782 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:35,784 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:35,793 INFO L290 TraceCheckUtils]: 0: Hoare triple {71236#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {71236#true} is VALID [2022-02-20 23:45:35,794 INFO L290 TraceCheckUtils]: 1: Hoare triple {71236#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:35,794 INFO L290 TraceCheckUtils]: 2: Hoare triple {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:35,794 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {71236#true} #308#return; {71242#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 0: Hoare triple {71236#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(12, 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); {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 1: Hoare triple {71236#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 2: Hoare triple {71236#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 3: Hoare triple {71236#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 4: Hoare triple {71236#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 5: Hoare triple {71236#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 6: Hoare triple {71236#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {71236#true} is VALID [2022-02-20 23:45:35,795 INFO L290 TraceCheckUtils]: 7: Hoare triple {71236#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {71236#true} is VALID [2022-02-20 23:45:35,796 INFO L272 TraceCheckUtils]: 8: Hoare triple {71236#true} call main_#t~ret34#1 := rand_end_point(); {71236#true} is VALID [2022-02-20 23:45:35,796 INFO L290 TraceCheckUtils]: 9: Hoare triple {71236#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {71236#true} is VALID [2022-02-20 23:45:35,796 INFO L290 TraceCheckUtils]: 10: Hoare triple {71236#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:35,796 INFO L290 TraceCheckUtils]: 11: Hoare triple {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} assume true; {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} is VALID [2022-02-20 23:45:35,797 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {71244#(<= ~unnamed1~0~LIST_END |rand_end_point_#res|)} {71236#true} #308#return; {71242#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:35,797 INFO L290 TraceCheckUtils]: 13: Hoare triple {71242#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_main_#t~ret34#1|))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,797 INFO L290 TraceCheckUtils]: 14: Hoare triple {71243#(not (= ~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: L655 {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,798 INFO L290 TraceCheckUtils]: 15: Hoare triple {71243#(not (= ~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; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,798 INFO L290 TraceCheckUtils]: 16: Hoare triple {71243#(not (= ~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: L656 {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,798 INFO L290 TraceCheckUtils]: 17: Hoare triple {71243#(not (= ~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; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,798 INFO L290 TraceCheckUtils]: 18: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,799 INFO L290 TraceCheckUtils]: 19: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,799 INFO L290 TraceCheckUtils]: 20: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,799 INFO L290 TraceCheckUtils]: 21: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,799 INFO L290 TraceCheckUtils]: 22: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#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_BEG, 4); srcloc: L700 {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,800 INFO L290 TraceCheckUtils]: 23: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#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_END, 4); srcloc: L700-1 {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,800 INFO L290 TraceCheckUtils]: 24: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:35,800 INFO L290 TraceCheckUtils]: 25: Hoare triple {71243#(not (= ~unnamed1~0~LIST_BEG |ULTIMATE.start_remove_one_~from#1|))} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_NEXT; {71237#false} is VALID [2022-02-20 23:45:35,800 INFO L290 TraceCheckUtils]: 26: Hoare triple {71237#false} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {71237#false} is VALID [2022-02-20 23:45:35,801 INFO L290 TraceCheckUtils]: 27: Hoare triple {71237#false} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_PREV; {71237#false} is VALID [2022-02-20 23:45:35,801 INFO L290 TraceCheckUtils]: 28: Hoare triple {71237#false} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {71237#false} is VALID [2022-02-20 23:45:35,801 INFO L290 TraceCheckUtils]: 29: Hoare triple {71237#false} 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); {71237#false} is VALID [2022-02-20 23:45:35,801 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:35,801 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:35,801 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [608273931] [2022-02-20 23:45:35,801 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [608273931] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:35,801 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:35,801 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:35,802 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804834036] [2022-02-20 23:45:35,802 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:35,802 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:35,802 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:35,802 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:35,819 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:45:35,819 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:35,819 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:35,819 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:35,819 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:35,819 INFO L87 Difference]: Start difference. First operand 592 states and 779 transitions. Second operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:36,274 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,275 INFO L93 Difference]: Finished difference Result 952 states and 1240 transitions. [2022-02-20 23:45:36,275 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:36,275 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:36,275 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:36,275 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:36,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 337 transitions. [2022-02-20 23:45:36,277 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:36,278 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 337 transitions. [2022-02-20 23:45:36,278 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 337 transitions. [2022-02-20 23:45:36,467 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 337 edges. 337 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:36,491 INFO L225 Difference]: With dead ends: 952 [2022-02-20 23:45:36,492 INFO L226 Difference]: Without dead ends: 952 [2022-02-20 23:45:36,492 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:36,492 INFO L933 BasicCegarLoop]: 327 mSDtfsCounter, 211 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 213 SdHoareTripleChecker+Valid, 1081 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:36,492 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [213 Valid, 1081 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 23:45:36,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 952 states. [2022-02-20 23:45:36,497 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 952 to 588. [2022-02-20 23:45:36,497 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:36,498 INFO L82 GeneralOperation]: Start isEquivalent. First operand 952 states. Second operand has 588 states, 514 states have (on average 1.433852140077821) internal successors, (737), 561 states have internal predecessors, (737), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,498 INFO L74 IsIncluded]: Start isIncluded. First operand 952 states. Second operand has 588 states, 514 states have (on average 1.433852140077821) internal successors, (737), 561 states have internal predecessors, (737), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,499 INFO L87 Difference]: Start difference. First operand 952 states. Second operand has 588 states, 514 states have (on average 1.433852140077821) internal successors, (737), 561 states have internal predecessors, (737), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,523 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,523 INFO L93 Difference]: Finished difference Result 952 states and 1240 transitions. [2022-02-20 23:45:36,523 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1240 transitions. [2022-02-20 23:45:36,524 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,524 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,525 INFO L74 IsIncluded]: Start isIncluded. First operand has 588 states, 514 states have (on average 1.433852140077821) internal successors, (737), 561 states have internal predecessors, (737), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 952 states. [2022-02-20 23:45:36,526 INFO L87 Difference]: Start difference. First operand has 588 states, 514 states have (on average 1.433852140077821) internal successors, (737), 561 states have internal predecessors, (737), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 952 states. [2022-02-20 23:45:36,550 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:36,550 INFO L93 Difference]: Finished difference Result 952 states and 1240 transitions. [2022-02-20 23:45:36,550 INFO L276 IsEmpty]: Start isEmpty. Operand 952 states and 1240 transitions. [2022-02-20 23:45:36,551 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:36,551 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:36,551 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:36,551 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:36,552 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 588 states, 514 states have (on average 1.433852140077821) internal successors, (737), 561 states have internal predecessors, (737), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:36,561 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 588 states to 588 states and 773 transitions. [2022-02-20 23:45:36,562 INFO L78 Accepts]: Start accepts. Automaton has 588 states and 773 transitions. Word has length 30 [2022-02-20 23:45:36,562 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:36,562 INFO L470 AbstractCegarLoop]: Abstraction has 588 states and 773 transitions. [2022-02-20 23:45:36,562 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.6) internal successors, (28), 4 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:45:36,562 INFO L276 IsEmpty]: Start isEmpty. Operand 588 states and 773 transitions. [2022-02-20 23:45:36,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2022-02-20 23:45:36,562 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:36,562 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:45:36,563 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33 [2022-02-20 23:45:36,563 INFO L402 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:36,563 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:36,563 INFO L85 PathProgramCache]: Analyzing trace with hash -1340636119, now seen corresponding path program 1 times [2022-02-20 23:45:36,563 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:36,563 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [741457068] [2022-02-20 23:45:36,564 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:36,564 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:36,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,626 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:36,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:36,639 INFO L290 TraceCheckUtils]: 0: Hoare triple {74693#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {74693#true} is VALID [2022-02-20 23:45:36,640 INFO L290 TraceCheckUtils]: 1: Hoare triple {74693#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:36,640 INFO L290 TraceCheckUtils]: 2: Hoare triple {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:36,640 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {74693#true} #308#return; {74699#(and (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:36,641 INFO L290 TraceCheckUtils]: 0: Hoare triple {74693#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(12, 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); {74693#true} is VALID [2022-02-20 23:45:36,646 INFO L290 TraceCheckUtils]: 1: Hoare triple {74693#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 2: Hoare triple {74693#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 3: Hoare triple {74693#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 4: Hoare triple {74693#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 5: Hoare triple {74693#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 6: Hoare triple {74693#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 7: Hoare triple {74693#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L272 TraceCheckUtils]: 8: Hoare triple {74693#true} call main_#t~ret34#1 := rand_end_point(); {74693#true} is VALID [2022-02-20 23:45:36,647 INFO L290 TraceCheckUtils]: 9: Hoare triple {74693#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {74693#true} is VALID [2022-02-20 23:45:36,648 INFO L290 TraceCheckUtils]: 10: Hoare triple {74693#true} assume !(0 != #t~nondet29);havoc #t~nondet29;#res := ~unnamed1~0~LIST_END; {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:36,648 INFO L290 TraceCheckUtils]: 11: Hoare triple {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} assume true; {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} is VALID [2022-02-20 23:45:36,649 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {74703#(and (<= ~unnamed1~0~LIST_END |rand_end_point_#res|) (<= |rand_end_point_#res| ~unnamed1~0~LIST_END))} {74693#true} #308#return; {74699#(and (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} is VALID [2022-02-20 23:45:36,649 INFO L290 TraceCheckUtils]: 13: Hoare triple {74699#(and (<= |ULTIMATE.start_main_#t~ret34#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_main_#t~ret34#1|))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,650 INFO L290 TraceCheckUtils]: 14: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |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: L655 {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,650 INFO L290 TraceCheckUtils]: 15: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |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; {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,650 INFO L290 TraceCheckUtils]: 16: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |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: L656 {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,651 INFO L290 TraceCheckUtils]: 17: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |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; {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,651 INFO L290 TraceCheckUtils]: 18: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,651 INFO L290 TraceCheckUtils]: 19: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is_empty_#res#1 := is_empty_~no_beg~0#1; {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,652 INFO L290 TraceCheckUtils]: 20: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,652 INFO L290 TraceCheckUtils]: 21: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#1|))} is VALID [2022-02-20 23:45:36,653 INFO L290 TraceCheckUtils]: 22: Hoare triple {74700#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= ~unnamed1~0~LIST_END |ULTIMATE.start_remove_one_~from#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_BEG, 4); srcloc: L700 {74701#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,653 INFO L290 TraceCheckUtils]: 23: Hoare triple {74701#(and (<= |ULTIMATE.start_remove_one_~from#1| ~unnamed1~0~LIST_END) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~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_END, 4); srcloc: L700-1 {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,654 INFO L290 TraceCheckUtils]: 24: Hoare triple {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,654 INFO L290 TraceCheckUtils]: 25: Hoare triple {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} assume !(~unnamed1~0~LIST_BEG == remove_one_~from#1);remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_PREV; {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,655 INFO L290 TraceCheckUtils]: 26: Hoare triple {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,655 INFO L290 TraceCheckUtils]: 27: Hoare triple {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} assume ~unnamed1~0~LIST_END == remove_one_~from#1;remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_NEXT; {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,663 INFO L290 TraceCheckUtils]: 28: Hoare triple {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~unnamed1~0~LIST_BEG 4))))} is VALID [2022-02-20 23:45:36,664 INFO L290 TraceCheckUtils]: 29: Hoare triple {74702#(and (<= (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) 4) (select |#length| |ULTIMATE.start_remove_one_~list#1.base|)) (<= (* ~unnamed1~0~LIST_END 4) (+ |ULTIMATE.start_remove_one_~list#1.offset| (* |ULTIMATE.start_remove_one_~from#1| 4) (* ~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); {74694#false} is VALID [2022-02-20 23:45:36,664 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:36,664 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:36,665 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [741457068] [2022-02-20 23:45:36,665 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [741457068] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:36,665 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:36,665 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:36,665 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [321549752] [2022-02-20 23:45:36,665 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:36,665 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:36,666 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:36,666 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:36,682 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:45:36,682 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:36,683 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:36,683 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:36,683 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:36,683 INFO L87 Difference]: Start difference. First operand 588 states and 773 transitions. Second operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:37,841 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:37,841 INFO L93 Difference]: Finished difference Result 1169 states and 1513 transitions. [2022-02-20 23:45:37,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2022-02-20 23:45:37,841 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:37,841 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:37,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:37,843 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 477 transitions. [2022-02-20 23:45:37,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:37,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 477 transitions. [2022-02-20 23:45:37,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 10 states and 477 transitions. [2022-02-20 23:45:38,149 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 477 edges. 477 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:38,187 INFO L225 Difference]: With dead ends: 1169 [2022-02-20 23:45:38,187 INFO L226 Difference]: Without dead ends: 1169 [2022-02-20 23:45:38,187 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 5 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:45:38,188 INFO L933 BasicCegarLoop]: 393 mSDtfsCounter, 461 mSDsluCounter, 1424 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 463 SdHoareTripleChecker+Valid, 1817 SdHoareTripleChecker+Invalid, 216 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:38,188 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [463 Valid, 1817 Invalid, 216 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:38,188 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1169 states. [2022-02-20 23:45:38,194 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1169 to 572. [2022-02-20 23:45:38,194 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:38,195 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1169 states. Second operand has 572 states, 500 states have (on average 1.414) internal successors, (707), 545 states have internal predecessors, (707), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:38,195 INFO L74 IsIncluded]: Start isIncluded. First operand 1169 states. Second operand has 572 states, 500 states have (on average 1.414) internal successors, (707), 545 states have internal predecessors, (707), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:38,195 INFO L87 Difference]: Start difference. First operand 1169 states. Second operand has 572 states, 500 states have (on average 1.414) internal successors, (707), 545 states have internal predecessors, (707), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:38,229 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,229 INFO L93 Difference]: Finished difference Result 1169 states and 1513 transitions. [2022-02-20 23:45:38,229 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1513 transitions. [2022-02-20 23:45:38,230 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:38,230 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:38,230 INFO L74 IsIncluded]: Start isIncluded. First operand has 572 states, 500 states have (on average 1.414) internal successors, (707), 545 states have internal predecessors, (707), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 1169 states. [2022-02-20 23:45:38,231 INFO L87 Difference]: Start difference. First operand has 572 states, 500 states have (on average 1.414) internal successors, (707), 545 states have internal predecessors, (707), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 1169 states. [2022-02-20 23:45:38,265 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:38,265 INFO L93 Difference]: Finished difference Result 1169 states and 1513 transitions. [2022-02-20 23:45:38,265 INFO L276 IsEmpty]: Start isEmpty. Operand 1169 states and 1513 transitions. [2022-02-20 23:45:38,266 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:38,266 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:38,266 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:38,266 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:38,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 572 states, 500 states have (on average 1.414) internal successors, (707), 545 states have internal predecessors, (707), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:38,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 572 states to 572 states and 743 transitions. [2022-02-20 23:45:38,276 INFO L78 Accepts]: Start accepts. Automaton has 572 states and 743 transitions. Word has length 30 [2022-02-20 23:45:38,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:38,276 INFO L470 AbstractCegarLoop]: Abstraction has 572 states and 743 transitions. [2022-02-20 23:45:38,276 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.666666666666667) internal successors, (28), 6 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:45:38,276 INFO L276 IsEmpty]: Start isEmpty. Operand 572 states and 743 transitions. [2022-02-20 23:45:38,276 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2022-02-20 23:45:38,276 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:38,276 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] [2022-02-20 23:45:38,277 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34 [2022-02-20 23:45:38,277 INFO L402 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:38,277 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:38,277 INFO L85 PathProgramCache]: Analyzing trace with hash 1443976913, now seen corresponding path program 1 times [2022-02-20 23:45:38,277 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:38,277 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1533352706] [2022-02-20 23:45:38,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:38,277 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:38,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,391 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:38,392 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:38,394 INFO L290 TraceCheckUtils]: 0: Hoare triple {78797#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {78797#true} is VALID [2022-02-20 23:45:38,394 INFO L290 TraceCheckUtils]: 1: Hoare triple {78797#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {78797#true} is VALID [2022-02-20 23:45:38,395 INFO L290 TraceCheckUtils]: 2: Hoare triple {78797#true} assume true; {78797#true} is VALID [2022-02-20 23:45:38,395 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {78797#true} {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #308#return; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,396 INFO L290 TraceCheckUtils]: 0: Hoare triple {78797#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(12, 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); {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,396 INFO L290 TraceCheckUtils]: 1: Hoare triple {78799#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,396 INFO L290 TraceCheckUtils]: 2: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,397 INFO L290 TraceCheckUtils]: 3: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,397 INFO L290 TraceCheckUtils]: 4: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,397 INFO L290 TraceCheckUtils]: 5: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,398 INFO L290 TraceCheckUtils]: 6: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,398 INFO L290 TraceCheckUtils]: 7: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,398 INFO L272 TraceCheckUtils]: 8: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} call main_#t~ret34#1 := rand_end_point(); {78797#true} is VALID [2022-02-20 23:45:38,398 INFO L290 TraceCheckUtils]: 9: Hoare triple {78797#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {78797#true} is VALID [2022-02-20 23:45:38,398 INFO L290 TraceCheckUtils]: 10: Hoare triple {78797#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {78797#true} is VALID [2022-02-20 23:45:38,398 INFO L290 TraceCheckUtils]: 11: Hoare triple {78797#true} assume true; {78797#true} is VALID [2022-02-20 23:45:38,399 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {78797#true} {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} #308#return; {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} is VALID [2022-02-20 23:45:38,399 INFO L290 TraceCheckUtils]: 13: Hoare triple {78799#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {78804#(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:45:38,400 INFO L290 TraceCheckUtils]: 14: Hoare triple {78804#(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: L655 {78805#(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:45:38,400 INFO L290 TraceCheckUtils]: 15: Hoare triple {78805#(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; {78805#(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:45:38,401 INFO L290 TraceCheckUtils]: 16: Hoare triple {78805#(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: L656 {78806#(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:45:38,401 INFO L290 TraceCheckUtils]: 17: Hoare triple {78806#(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; {78806#(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:45:38,402 INFO L290 TraceCheckUtils]: 18: Hoare triple {78806#(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); {78806#(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:45:38,402 INFO L290 TraceCheckUtils]: 19: Hoare triple {78806#(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; {78806#(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:45:38,402 INFO L290 TraceCheckUtils]: 20: Hoare triple {78806#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {78806#(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:45:38,403 INFO L290 TraceCheckUtils]: 21: Hoare triple {78806#(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~ret20#1);havoc remove_one_#t~ret20#1; {78806#(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:45:38,403 INFO L290 TraceCheckUtils]: 22: Hoare triple {78806#(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_BEG, 4); srcloc: L700 {78806#(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:45:38,404 INFO L290 TraceCheckUtils]: 23: Hoare triple {78806#(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_END, 4); srcloc: L700-1 {78806#(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:45:38,404 INFO L290 TraceCheckUtils]: 24: Hoare triple {78806#(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~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {78806#(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:45:38,405 INFO L290 TraceCheckUtils]: 25: Hoare triple {78806#(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~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {78806#(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:45:38,405 INFO L290 TraceCheckUtils]: 26: Hoare triple {78806#(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~mem23#1.offset; {78806#(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:45:38,405 INFO L290 TraceCheckUtils]: 27: Hoare triple {78806#(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~mem23#1.base < #StackHeapBarrier; {78806#(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:45:38,406 INFO L290 TraceCheckUtils]: 28: Hoare triple {78806#(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~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {78807#(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:45:38,406 INFO L290 TraceCheckUtils]: 29: Hoare triple {78807#(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]; {78807#(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:45:38,407 INFO L290 TraceCheckUtils]: 30: Hoare triple {78807#(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); {78798#false} is VALID [2022-02-20 23:45:38,407 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:38,407 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:38,407 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1533352706] [2022-02-20 23:45:38,407 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1533352706] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:38,407 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:38,407 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:38,408 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [314682565] [2022-02-20 23:45:38,408 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:38,408 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 31 [2022-02-20 23:45:38,408 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:38,408 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:38,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:38,431 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2022-02-20 23:45:38,431 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:38,431 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2022-02-20 23:45:38,431 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:38,431 INFO L87 Difference]: Start difference. First operand 572 states and 743 transitions. Second operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:39,565 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,565 INFO L93 Difference]: Finished difference Result 953 states and 1201 transitions. [2022-02-20 23:45:39,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:39,566 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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 31 [2022-02-20 23:45:39,566 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:39,566 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:39,567 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 421 transitions. [2022-02-20 23:45:39,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:39,569 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 421 transitions. [2022-02-20 23:45:39,569 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 421 transitions. [2022-02-20 23:45:39,881 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 421 edges. 421 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:39,905 INFO L225 Difference]: With dead ends: 953 [2022-02-20 23:45:39,906 INFO L226 Difference]: Without dead ends: 953 [2022-02-20 23:45:39,906 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:45:39,906 INFO L933 BasicCegarLoop]: 234 mSDtfsCounter, 742 mSDsluCounter, 369 mSDsCounter, 0 mSdLazyCounter, 347 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 742 SdHoareTripleChecker+Valid, 603 SdHoareTripleChecker+Invalid, 362 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 347 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:39,906 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [742 Valid, 603 Invalid, 362 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 347 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:39,907 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 953 states. [2022-02-20 23:45:39,912 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 953 to 571. [2022-02-20 23:45:39,912 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:39,913 INFO L82 GeneralOperation]: Start isEquivalent. First operand 953 states. Second operand has 571 states, 500 states have (on average 1.406) internal successors, (703), 544 states have internal predecessors, (703), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,913 INFO L74 IsIncluded]: Start isIncluded. First operand 953 states. Second operand has 571 states, 500 states have (on average 1.406) internal successors, (703), 544 states have internal predecessors, (703), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,914 INFO L87 Difference]: Start difference. First operand 953 states. Second operand has 571 states, 500 states have (on average 1.406) internal successors, (703), 544 states have internal predecessors, (703), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,937 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,937 INFO L93 Difference]: Finished difference Result 953 states and 1201 transitions. [2022-02-20 23:45:39,937 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1201 transitions. [2022-02-20 23:45:39,938 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,938 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,938 INFO L74 IsIncluded]: Start isIncluded. First operand has 571 states, 500 states have (on average 1.406) internal successors, (703), 544 states have internal predecessors, (703), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 953 states. [2022-02-20 23:45:39,939 INFO L87 Difference]: Start difference. First operand has 571 states, 500 states have (on average 1.406) internal successors, (703), 544 states have internal predecessors, (703), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) Second operand 953 states. [2022-02-20 23:45:39,962 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:39,962 INFO L93 Difference]: Finished difference Result 953 states and 1201 transitions. [2022-02-20 23:45:39,962 INFO L276 IsEmpty]: Start isEmpty. Operand 953 states and 1201 transitions. [2022-02-20 23:45:39,963 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:39,963 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:39,963 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:39,963 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:39,963 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 571 states, 500 states have (on average 1.406) internal successors, (703), 544 states have internal predecessors, (703), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 20 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:39,972 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 571 states to 571 states and 739 transitions. [2022-02-20 23:45:39,972 INFO L78 Accepts]: Start accepts. Automaton has 571 states and 739 transitions. Word has length 31 [2022-02-20 23:45:39,973 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:39,973 INFO L470 AbstractCegarLoop]: Abstraction has 571 states and 739 transitions. [2022-02-20 23:45:39,973 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.833333333333333) internal successors, (29), 7 states have internal predecessors, (29), 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:45:39,973 INFO L276 IsEmpty]: Start isEmpty. Operand 571 states and 739 transitions. [2022-02-20 23:45:39,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2022-02-20 23:45:39,973 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:39,973 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:45:39,973 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35 [2022-02-20 23:45:39,973 INFO L402 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:39,973 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:39,973 INFO L85 PathProgramCache]: Analyzing trace with hash 403780234, now seen corresponding path program 1 times [2022-02-20 23:45:39,974 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:39,974 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1688959099] [2022-02-20 23:45:39,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:39,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:39,986 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,141 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:40,143 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:40,147 INFO L290 TraceCheckUtils]: 0: Hoare triple {82252#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {82252#true} is VALID [2022-02-20 23:45:40,147 INFO L290 TraceCheckUtils]: 1: Hoare triple {82252#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {82252#true} is VALID [2022-02-20 23:45:40,147 INFO L290 TraceCheckUtils]: 2: Hoare triple {82252#true} assume true; {82252#true} is VALID [2022-02-20 23:45:40,148 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {82252#true} {82254#(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))))} #308#return; {82254#(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:45:40,149 INFO L290 TraceCheckUtils]: 0: Hoare triple {82252#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(12, 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); {82254#(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:45:40,149 INFO L290 TraceCheckUtils]: 1: Hoare triple {82254#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {82254#(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:45:40,150 INFO L290 TraceCheckUtils]: 2: Hoare triple {82254#(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~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {82254#(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:45:40,150 INFO L290 TraceCheckUtils]: 3: Hoare triple {82254#(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 !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {82254#(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:45:40,151 INFO L290 TraceCheckUtils]: 4: Hoare triple {82254#(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~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {82254#(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:45:40,151 INFO L290 TraceCheckUtils]: 5: Hoare triple {82254#(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 !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {82254#(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:45:40,151 INFO L290 TraceCheckUtils]: 6: Hoare triple {82254#(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~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {82254#(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:45:40,152 INFO L290 TraceCheckUtils]: 7: Hoare triple {82254#(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 !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {82254#(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:45:40,152 INFO L272 TraceCheckUtils]: 8: Hoare triple {82254#(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~ret34#1 := rand_end_point(); {82252#true} is VALID [2022-02-20 23:45:40,152 INFO L290 TraceCheckUtils]: 9: Hoare triple {82252#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {82252#true} is VALID [2022-02-20 23:45:40,152 INFO L290 TraceCheckUtils]: 10: Hoare triple {82252#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {82252#true} is VALID [2022-02-20 23:45:40,152 INFO L290 TraceCheckUtils]: 11: Hoare triple {82252#true} assume true; {82252#true} is VALID [2022-02-20 23:45:40,153 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {82252#true} {82254#(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))))} #308#return; {82254#(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:45:40,154 INFO L290 TraceCheckUtils]: 13: Hoare triple {82254#(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~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {82259#(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:45:40,155 INFO L290 TraceCheckUtils]: 14: Hoare triple {82259#(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: L655 {82259#(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:45:40,155 INFO L290 TraceCheckUtils]: 15: Hoare triple {82259#(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; {82259#(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:45:40,156 INFO L290 TraceCheckUtils]: 16: Hoare triple {82259#(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: L656 {82259#(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:45:40,156 INFO L290 TraceCheckUtils]: 17: Hoare triple {82259#(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; {82259#(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:45:40,157 INFO L290 TraceCheckUtils]: 18: Hoare triple {82259#(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); {82259#(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:45:40,157 INFO L290 TraceCheckUtils]: 19: Hoare triple {82259#(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; {82259#(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:45:40,158 INFO L290 TraceCheckUtils]: 20: Hoare triple {82259#(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~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {82259#(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:45:40,158 INFO L290 TraceCheckUtils]: 21: Hoare triple {82259#(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~ret20#1);havoc remove_one_#t~ret20#1; {82259#(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:45:40,159 INFO L290 TraceCheckUtils]: 22: Hoare triple {82259#(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~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_BEG, 4); srcloc: L700 {82260#(and (= |ULTIMATE.start_remove_one_#t~mem21#1.offset| (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) (= |ULTIMATE.start_remove_one_#t~mem21#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)))))} is VALID [2022-02-20 23:45:40,159 INFO L290 TraceCheckUtils]: 23: Hoare triple {82260#(and (= |ULTIMATE.start_remove_one_#t~mem21#1.offset| (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) (= |ULTIMATE.start_remove_one_#t~mem21#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)))))} 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_END, 4); srcloc: L700-1 {82261#(and (= |ULTIMATE.start_remove_one_#t~mem22#1.offset| |ULTIMATE.start_remove_one_#t~mem21#1.offset|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| |ULTIMATE.start_remove_one_#t~mem21#1.base|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 24: Hoare triple {82261#(and (= |ULTIMATE.start_remove_one_#t~mem22#1.offset| |ULTIMATE.start_remove_one_#t~mem21#1.offset|) (= |ULTIMATE.start_remove_one_#t~mem22#1.base| |ULTIMATE.start_remove_one_#t~mem21#1.base|) (= |ULTIMATE.start_remove_one_~list#1.offset| 0))} assume !(remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset);havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 25: Hoare triple {82253#false} assume ~unnamed1~0~LIST_BEG == remove_one_~from#1;remove_one_#t~ite25#1 := ~unnamed2~0~ITEM_NEXT; {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 26: Hoare triple {82253#false} remove_one_~next_field~0#1 := remove_one_#t~ite25#1;havoc remove_one_#t~ite25#1; {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 27: Hoare triple {82253#false} assume !(~unnamed1~0~LIST_END == remove_one_~from#1);remove_one_#t~ite26#1 := ~unnamed2~0~ITEM_PREV; {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 28: Hoare triple {82253#false} remove_one_~term_field~1#1 := remove_one_#t~ite26#1;havoc remove_one_#t~ite26#1; {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 29: Hoare triple {82253#false} SUMMARY for call remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * remove_one_~from#1, 4); srcloc: L707 {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 30: Hoare triple {82253#false} remove_one_~item~2#1.base, remove_one_~item~2#1.offset := remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset;havoc remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset; {82253#false} is VALID [2022-02-20 23:45:40,160 INFO L290 TraceCheckUtils]: 31: Hoare triple {82253#false} assume !(1 == #valid[remove_one_~item~2#1.base]); {82253#false} is VALID [2022-02-20 23:45:40,165 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:40,165 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:40,165 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1688959099] [2022-02-20 23:45:40,165 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1688959099] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:40,165 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:40,165 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 23:45:40,166 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1630344479] [2022-02-20 23:45:40,166 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:40,167 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:45:40,167 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:40,167 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 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:45:40,192 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:45:40,192 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:40,193 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:40,194 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:40,194 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:40,194 INFO L87 Difference]: Start difference. First operand 571 states and 739 transitions. Second operand has 6 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:45:40,842 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:40,842 INFO L93 Difference]: Finished difference Result 618 states and 786 transitions. [2022-02-20 23:45:40,842 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:40,842 INFO L78 Accepts]: Start accepts. Automaton has has 6 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:45:40,843 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:40,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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:45:40,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2022-02-20 23:45:40,844 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 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:45:40,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 264 transitions. [2022-02-20 23:45:40,845 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 264 transitions. [2022-02-20 23:45:41,033 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,047 INFO L225 Difference]: With dead ends: 618 [2022-02-20 23:45:41,048 INFO L226 Difference]: Without dead ends: 618 [2022-02-20 23:45:41,048 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:45:41,048 INFO L933 BasicCegarLoop]: 187 mSDtfsCounter, 106 mSDsluCounter, 607 mSDsCounter, 0 mSdLazyCounter, 168 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 106 SdHoareTripleChecker+Valid, 794 SdHoareTripleChecker+Invalid, 172 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 168 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:41,048 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [106 Valid, 794 Invalid, 172 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 168 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:41,049 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 618 states. [2022-02-20 23:45:41,053 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 618 to 550. [2022-02-20 23:45:41,053 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:41,054 INFO L82 GeneralOperation]: Start isEquivalent. First operand 618 states. Second operand has 550 states, 479 states have (on average 1.4112734864300627) internal successors, (676), 525 states have internal predecessors, (676), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,054 INFO L74 IsIncluded]: Start isIncluded. First operand 618 states. Second operand has 550 states, 479 states have (on average 1.4112734864300627) internal successors, (676), 525 states have internal predecessors, (676), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,054 INFO L87 Difference]: Start difference. First operand 618 states. Second operand has 550 states, 479 states have (on average 1.4112734864300627) internal successors, (676), 525 states have internal predecessors, (676), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,066 INFO L93 Difference]: Finished difference Result 618 states and 786 transitions. [2022-02-20 23:45:41,066 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 786 transitions. [2022-02-20 23:45:41,066 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,067 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,067 INFO L74 IsIncluded]: Start isIncluded. First operand has 550 states, 479 states have (on average 1.4112734864300627) internal successors, (676), 525 states have internal predecessors, (676), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 618 states. [2022-02-20 23:45:41,067 INFO L87 Difference]: Start difference. First operand has 550 states, 479 states have (on average 1.4112734864300627) internal successors, (676), 525 states have internal predecessors, (676), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 618 states. [2022-02-20 23:45:41,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,078 INFO L93 Difference]: Finished difference Result 618 states and 786 transitions. [2022-02-20 23:45:41,079 INFO L276 IsEmpty]: Start isEmpty. Operand 618 states and 786 transitions. [2022-02-20 23:45:41,079 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,079 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,079 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:41,079 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:41,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 550 states, 479 states have (on average 1.4112734864300627) internal successors, (676), 525 states have internal predecessors, (676), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,089 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 550 states to 550 states and 712 transitions. [2022-02-20 23:45:41,090 INFO L78 Accepts]: Start accepts. Automaton has 550 states and 712 transitions. Word has length 32 [2022-02-20 23:45:41,090 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:41,090 INFO L470 AbstractCegarLoop]: Abstraction has 550 states and 712 transitions. [2022-02-20 23:45:41,090 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 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:45:41,090 INFO L276 IsEmpty]: Start isEmpty. Operand 550 states and 712 transitions. [2022-02-20 23:45:41,090 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:45:41,090 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:41,090 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:41,090 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable36 [2022-02-20 23:45:41,090 INFO L402 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:41,091 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:41,091 INFO L85 PathProgramCache]: Analyzing trace with hash 407119085, now seen corresponding path program 1 times [2022-02-20 23:45:41,091 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:41,091 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1765145654] [2022-02-20 23:45:41,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:41,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:41,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,136 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:41,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,140 INFO L290 TraceCheckUtils]: 0: Hoare triple {84674#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {84674#true} is VALID [2022-02-20 23:45:41,140 INFO L290 TraceCheckUtils]: 1: Hoare triple {84674#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {84674#true} is VALID [2022-02-20 23:45:41,140 INFO L290 TraceCheckUtils]: 2: Hoare triple {84674#true} assume true; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {84674#true} {84674#true} #306#return; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 0: Hoare triple {84674#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(12, 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); {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 1: Hoare triple {84674#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 2: Hoare triple {84674#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 3: Hoare triple {84674#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 4: Hoare triple {84674#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 5: Hoare triple {84674#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L272 TraceCheckUtils]: 6: Hoare triple {84674#true} call main_#t~ret32#1 := rand_end_point(); {84674#true} is VALID [2022-02-20 23:45:41,141 INFO L290 TraceCheckUtils]: 7: Hoare triple {84674#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {84674#true} is VALID [2022-02-20 23:45:41,142 INFO L290 TraceCheckUtils]: 8: Hoare triple {84674#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {84674#true} is VALID [2022-02-20 23:45:41,142 INFO L290 TraceCheckUtils]: 9: Hoare triple {84674#true} assume true; {84674#true} is VALID [2022-02-20 23:45:41,142 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {84674#true} {84674#true} #306#return; {84674#true} is VALID [2022-02-20 23:45:41,143 INFO L290 TraceCheckUtils]: 11: Hoare triple {84674#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,143 INFO L290 TraceCheckUtils]: 12: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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); {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,143 INFO L290 TraceCheckUtils]: 13: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,144 INFO L290 TraceCheckUtils]: 14: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (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; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,144 INFO L290 TraceCheckUtils]: 15: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_#t~switch6#1; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,145 INFO L290 TraceCheckUtils]: 16: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |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: L677-12 {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,145 INFO L290 TraceCheckUtils]: 17: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |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; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,145 INFO L290 TraceCheckUtils]: 18: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short10#1; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,146 INFO L290 TraceCheckUtils]: 19: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_#t~short12#1 := create_item_#t~short10#1; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,146 INFO L290 TraceCheckUtils]: 20: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short12#1; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,146 INFO L290 TraceCheckUtils]: 21: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,147 INFO L290 TraceCheckUtils]: 22: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,147 INFO L290 TraceCheckUtils]: 23: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,147 INFO L290 TraceCheckUtils]: 24: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#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: L680 {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,148 INFO L290 TraceCheckUtils]: 25: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |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~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,148 INFO L290 TraceCheckUtils]: 26: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,149 INFO L290 TraceCheckUtils]: 27: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,149 INFO L290 TraceCheckUtils]: 28: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,150 INFO L290 TraceCheckUtils]: 29: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} SUMMARY for call write~$Pointer$(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} is VALID [2022-02-20 23:45:41,150 INFO L290 TraceCheckUtils]: 30: Hoare triple {84680#(and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {84681#(and (= 8 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} is VALID [2022-02-20 23:45:41,150 INFO L290 TraceCheckUtils]: 31: Hoare triple {84681#(and (= 8 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {84682#(and (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8))} is VALID [2022-02-20 23:45:41,151 INFO L290 TraceCheckUtils]: 32: Hoare triple {84682#(and (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8))} 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); {84675#false} is VALID [2022-02-20 23:45:41,151 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:41,151 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:41,151 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1765145654] [2022-02-20 23:45:41,151 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1765145654] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:41,151 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:41,151 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:41,152 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [303906015] [2022-02-20 23:45:41,152 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:41,153 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,153 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:41,153 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,171 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:45:41,171 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:41,171 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:41,172 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:41,172 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:41,172 INFO L87 Difference]: Start difference. First operand 550 states and 712 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,628 INFO L93 Difference]: Finished difference Result 669 states and 856 transitions. [2022-02-20 23:45:41,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:41,628 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:41,628 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,629 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2022-02-20 23:45:41,629 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 264 transitions. [2022-02-20 23:45:41,630 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 264 transitions. [2022-02-20 23:45:41,791 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 264 edges. 264 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:41,804 INFO L225 Difference]: With dead ends: 669 [2022-02-20 23:45:41,804 INFO L226 Difference]: Without dead ends: 669 [2022-02-20 23:45:41,804 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:41,804 INFO L933 BasicCegarLoop]: 198 mSDtfsCounter, 354 mSDsluCounter, 310 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 508 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:41,805 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 508 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:41,807 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 669 states. [2022-02-20 23:45:41,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 669 to 549. [2022-02-20 23:45:41,811 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:41,812 INFO L82 GeneralOperation]: Start isEquivalent. First operand 669 states. Second operand has 549 states, 479 states have (on average 1.407098121085595) internal successors, (674), 524 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,812 INFO L74 IsIncluded]: Start isIncluded. First operand 669 states. Second operand has 549 states, 479 states have (on average 1.407098121085595) internal successors, (674), 524 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,812 INFO L87 Difference]: Start difference. First operand 669 states. Second operand has 549 states, 479 states have (on average 1.407098121085595) internal successors, (674), 524 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,824 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,824 INFO L93 Difference]: Finished difference Result 669 states and 856 transitions. [2022-02-20 23:45:41,824 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 856 transitions. [2022-02-20 23:45:41,825 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,825 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,825 INFO L74 IsIncluded]: Start isIncluded. First operand has 549 states, 479 states have (on average 1.407098121085595) internal successors, (674), 524 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 669 states. [2022-02-20 23:45:41,825 INFO L87 Difference]: Start difference. First operand has 549 states, 479 states have (on average 1.407098121085595) internal successors, (674), 524 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 669 states. [2022-02-20 23:45:41,837 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:41,837 INFO L93 Difference]: Finished difference Result 669 states and 856 transitions. [2022-02-20 23:45:41,837 INFO L276 IsEmpty]: Start isEmpty. Operand 669 states and 856 transitions. [2022-02-20 23:45:41,838 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:41,838 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:41,838 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:41,838 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:41,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 549 states, 479 states have (on average 1.407098121085595) internal successors, (674), 524 states have internal predecessors, (674), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:41,856 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 549 states to 549 states and 710 transitions. [2022-02-20 23:45:41,856 INFO L78 Accepts]: Start accepts. Automaton has 549 states and 710 transitions. Word has length 33 [2022-02-20 23:45:41,856 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:41,856 INFO L470 AbstractCegarLoop]: Abstraction has 549 states and 710 transitions. [2022-02-20 23:45:41,856 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,856 INFO L276 IsEmpty]: Start isEmpty. Operand 549 states and 710 transitions. [2022-02-20 23:45:41,857 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2022-02-20 23:45:41,857 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:41,857 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:41,857 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable37 [2022-02-20 23:45:41,857 INFO L402 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:41,857 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:41,857 INFO L85 PathProgramCache]: Analyzing trace with hash 407119084, now seen corresponding path program 1 times [2022-02-20 23:45:41,857 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:41,857 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [663976275] [2022-02-20 23:45:41,857 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:41,858 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:41,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,892 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:41,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:41,896 INFO L290 TraceCheckUtils]: 0: Hoare triple {87246#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {87246#true} is VALID [2022-02-20 23:45:41,896 INFO L290 TraceCheckUtils]: 1: Hoare triple {87246#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {87246#true} assume true; {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {87246#true} {87246#true} #306#return; {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L290 TraceCheckUtils]: 0: Hoare triple {87246#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(12, 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); {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L290 TraceCheckUtils]: 1: Hoare triple {87246#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L290 TraceCheckUtils]: 2: Hoare triple {87246#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L290 TraceCheckUtils]: 3: Hoare triple {87246#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {87246#true} is VALID [2022-02-20 23:45:41,897 INFO L290 TraceCheckUtils]: 4: Hoare triple {87246#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 5: Hoare triple {87246#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L272 TraceCheckUtils]: 6: Hoare triple {87246#true} call main_#t~ret32#1 := rand_end_point(); {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 7: Hoare triple {87246#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 8: Hoare triple {87246#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 9: Hoare triple {87246#true} assume true; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {87246#true} {87246#true} #306#return; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 11: Hoare triple {87246#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 12: Hoare triple {87246#true} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {87246#true} is VALID [2022-02-20 23:45:41,898 INFO L290 TraceCheckUtils]: 13: Hoare triple {87246#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; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 14: Hoare triple {87246#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; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 15: Hoare triple {87246#true} havoc create_item_#t~switch6#1; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 16: Hoare triple {87246#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: L677-12 {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 17: Hoare triple {87246#true} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 18: Hoare triple {87246#true} assume !create_item_#t~short10#1; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 19: Hoare triple {87246#true} create_item_#t~short12#1 := create_item_#t~short10#1; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 20: Hoare triple {87246#true} assume !create_item_#t~short12#1; {87246#true} is VALID [2022-02-20 23:45:41,899 INFO L290 TraceCheckUtils]: 21: Hoare triple {87246#true} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {87246#true} is VALID [2022-02-20 23:45:41,900 INFO L290 TraceCheckUtils]: 22: Hoare triple {87246#true} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {87246#true} is VALID [2022-02-20 23:45:41,900 INFO L290 TraceCheckUtils]: 23: Hoare triple {87246#true} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {87246#true} is VALID [2022-02-20 23:45:41,900 INFO L290 TraceCheckUtils]: 24: Hoare triple {87246#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: L680 {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:41,901 INFO L290 TraceCheckUtils]: 25: Hoare triple {87252#(= 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~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:41,901 INFO L290 TraceCheckUtils]: 26: Hoare triple {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:41,901 INFO L290 TraceCheckUtils]: 27: Hoare triple {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:41,902 INFO L290 TraceCheckUtils]: 28: Hoare triple {87252#(= 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); {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:41,902 INFO L290 TraceCheckUtils]: 29: Hoare triple {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} SUMMARY for call write~$Pointer$(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} is VALID [2022-02-20 23:45:41,902 INFO L290 TraceCheckUtils]: 30: Hoare triple {87252#(= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {87253#(= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1)} is VALID [2022-02-20 23:45:41,903 INFO L290 TraceCheckUtils]: 31: Hoare triple {87253#(= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1)} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {87254#(= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1)} is VALID [2022-02-20 23:45:41,903 INFO L290 TraceCheckUtils]: 32: Hoare triple {87254#(= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1)} assume !(1 == #valid[append_one_~item~1#1.base]); {87247#false} is VALID [2022-02-20 23:45:41,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:41,903 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:41,903 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [663976275] [2022-02-20 23:45:41,904 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [663976275] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:41,904 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:41,904 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:41,904 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [420593293] [2022-02-20 23:45:41,904 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:41,905 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,905 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:41,905 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:41,921 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:45:41,921 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:41,921 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:41,922 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:41,922 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:41,923 INFO L87 Difference]: Start difference. First operand 549 states and 710 transitions. Second operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:42,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,378 INFO L93 Difference]: Finished difference Result 663 states and 848 transitions. [2022-02-20 23:45:42,378 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:42,378 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:42,378 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:42,378 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:42,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 23:45:42,379 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:42,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 257 transitions. [2022-02-20 23:45:42,380 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 257 transitions. [2022-02-20 23:45:42,522 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 257 edges. 257 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:42,535 INFO L225 Difference]: With dead ends: 663 [2022-02-20 23:45:42,535 INFO L226 Difference]: Without dead ends: 663 [2022-02-20 23:45:42,536 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 4 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2022-02-20 23:45:42,536 INFO L933 BasicCegarLoop]: 180 mSDtfsCounter, 333 mSDsluCounter, 258 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 333 SdHoareTripleChecker+Valid, 438 SdHoareTripleChecker+Invalid, 221 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:42,536 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [333 Valid, 438 Invalid, 221 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:42,537 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 663 states. [2022-02-20 23:45:42,540 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 663 to 548. [2022-02-20 23:45:42,540 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:42,541 INFO L82 GeneralOperation]: Start isEquivalent. First operand 663 states. Second operand has 548 states, 479 states have (on average 1.4029227557411275) internal successors, (672), 523 states have internal predecessors, (672), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:42,541 INFO L74 IsIncluded]: Start isIncluded. First operand 663 states. Second operand has 548 states, 479 states have (on average 1.4029227557411275) internal successors, (672), 523 states have internal predecessors, (672), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:42,541 INFO L87 Difference]: Start difference. First operand 663 states. Second operand has 548 states, 479 states have (on average 1.4029227557411275) internal successors, (672), 523 states have internal predecessors, (672), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:42,553 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,553 INFO L93 Difference]: Finished difference Result 663 states and 848 transitions. [2022-02-20 23:45:42,553 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 848 transitions. [2022-02-20 23:45:42,554 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,554 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,554 INFO L74 IsIncluded]: Start isIncluded. First operand has 548 states, 479 states have (on average 1.4029227557411275) internal successors, (672), 523 states have internal predecessors, (672), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 663 states. [2022-02-20 23:45:42,554 INFO L87 Difference]: Start difference. First operand has 548 states, 479 states have (on average 1.4029227557411275) internal successors, (672), 523 states have internal predecessors, (672), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 663 states. [2022-02-20 23:45:42,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:42,566 INFO L93 Difference]: Finished difference Result 663 states and 848 transitions. [2022-02-20 23:45:42,566 INFO L276 IsEmpty]: Start isEmpty. Operand 663 states and 848 transitions. [2022-02-20 23:45:42,566 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:42,566 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:42,566 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:42,566 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:42,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 548 states, 479 states have (on average 1.4029227557411275) internal successors, (672), 523 states have internal predecessors, (672), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:42,575 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 548 states to 548 states and 708 transitions. [2022-02-20 23:45:42,575 INFO L78 Accepts]: Start accepts. Automaton has 548 states and 708 transitions. Word has length 33 [2022-02-20 23:45:42,575 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:42,575 INFO L470 AbstractCegarLoop]: Abstraction has 548 states and 708 transitions. [2022-02-20 23:45:42,575 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 7.75) internal successors, (31), 5 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:45:42,575 INFO L276 IsEmpty]: Start isEmpty. Operand 548 states and 708 transitions. [2022-02-20 23:45:42,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:45:42,576 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:42,576 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] [2022-02-20 23:45:42,576 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable38 [2022-02-20 23:45:42,576 INFO L402 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:42,576 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:42,576 INFO L85 PathProgramCache]: Analyzing trace with hash 399419021, now seen corresponding path program 1 times [2022-02-20 23:45:42,576 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:42,576 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [493122012] [2022-02-20 23:45:42,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:42,577 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:42,600 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,622 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:42,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {89799#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {89799#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {89799#true} assume true; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {89799#true} {89799#true} #306#return; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 0: Hoare triple {89799#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(12, 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); {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 1: Hoare triple {89799#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 2: Hoare triple {89799#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 3: Hoare triple {89799#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 4: Hoare triple {89799#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 5: Hoare triple {89799#true} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L272 TraceCheckUtils]: 6: Hoare triple {89799#true} call main_#t~ret32#1 := rand_end_point(); {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 7: Hoare triple {89799#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 8: Hoare triple {89799#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L290 TraceCheckUtils]: 9: Hoare triple {89799#true} assume true; {89799#true} is VALID [2022-02-20 23:45:42,625 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {89799#true} {89799#true} #306#return; {89799#true} is VALID [2022-02-20 23:45:42,626 INFO L290 TraceCheckUtils]: 11: Hoare triple {89799#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {89805#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:42,627 INFO L290 TraceCheckUtils]: 12: Hoare triple {89805#(= |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); {89805#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:42,627 INFO L290 TraceCheckUtils]: 13: Hoare triple {89805#(= |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; {89805#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:42,627 INFO L290 TraceCheckUtils]: 14: Hoare triple {89805#(= |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; {89805#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:42,628 INFO L290 TraceCheckUtils]: 15: Hoare triple {89805#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} havoc create_item_#t~switch6#1; {89805#(= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)} is VALID [2022-02-20 23:45:42,628 INFO L290 TraceCheckUtils]: 16: Hoare triple {89805#(= |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: L677-12 {89806#(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:45:42,629 INFO L290 TraceCheckUtils]: 17: Hoare triple {89806#(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; {89806#(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:45:42,629 INFO L290 TraceCheckUtils]: 18: Hoare triple {89806#(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; {89806#(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:45:42,630 INFO L290 TraceCheckUtils]: 19: Hoare triple {89806#(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~short12#1 := create_item_#t~short10#1; {89806#(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:45:42,630 INFO L290 TraceCheckUtils]: 20: Hoare triple {89806#(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~short12#1; {89806#(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:45:42,630 INFO L290 TraceCheckUtils]: 21: Hoare triple {89806#(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~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {89806#(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:45:42,631 INFO L290 TraceCheckUtils]: 22: Hoare triple {89806#(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~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {89806#(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:45:42,631 INFO L290 TraceCheckUtils]: 23: Hoare triple {89806#(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~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {89806#(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:45:42,632 INFO L290 TraceCheckUtils]: 24: Hoare triple {89806#(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: L680 {89806#(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:45:42,632 INFO L290 TraceCheckUtils]: 25: Hoare triple {89806#(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~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {89806#(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:45:42,633 INFO L290 TraceCheckUtils]: 26: Hoare triple {89806#(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~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {89806#(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:45:42,633 INFO L290 TraceCheckUtils]: 27: Hoare triple {89806#(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~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {89806#(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:45:42,633 INFO L290 TraceCheckUtils]: 28: Hoare triple {89806#(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); {89806#(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:45:42,634 INFO L290 TraceCheckUtils]: 29: Hoare triple {89806#(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_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:42,634 INFO L290 TraceCheckUtils]: 30: Hoare triple {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:42,634 INFO L290 TraceCheckUtils]: 31: Hoare triple {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:42,634 INFO L290 TraceCheckUtils]: 32: Hoare triple {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:42,635 INFO L290 TraceCheckUtils]: 33: Hoare triple {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} 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; {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} is VALID [2022-02-20 23:45:42,635 INFO L290 TraceCheckUtils]: 34: Hoare triple {89807#(= (select |#valid| |ULTIMATE.start_append_one_~list#1.base|) 1)} assume !(1 == #valid[append_one_~list#1.base]); {89800#false} is VALID [2022-02-20 23:45:42,635 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:42,635 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:42,635 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [493122012] [2022-02-20 23:45:42,635 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [493122012] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:42,636 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:42,636 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 23:45:42,636 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [563469378] [2022-02-20 23:45:42,636 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:42,636 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:42,636 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:42,636 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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:45:42,670 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:42,670 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 23:45:42,670 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:42,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 23:45:42,671 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:42,671 INFO L87 Difference]: Start difference. First operand 548 states and 708 transitions. Second operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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:45:43,319 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:43,319 INFO L93 Difference]: Finished difference Result 951 states and 1194 transitions. [2022-02-20 23:45:43,319 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 23:45:43,320 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:43,320 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:43,320 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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:45:43,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2022-02-20 23:45:43,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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:45:43,324 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 495 transitions. [2022-02-20 23:45:43,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 495 transitions. [2022-02-20 23:45:43,596 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 495 edges. 495 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:43,620 INFO L225 Difference]: With dead ends: 951 [2022-02-20 23:45:43,620 INFO L226 Difference]: Without dead ends: 951 [2022-02-20 23:45:43,621 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:45:43,621 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 367 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 336 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 373 SdHoareTripleChecker+Valid, 715 SdHoareTripleChecker+Invalid, 345 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 336 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:43,621 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [373 Valid, 715 Invalid, 345 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 336 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 23:45:43,621 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 951 states. [2022-02-20 23:45:43,626 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 951 to 545. [2022-02-20 23:45:43,626 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:43,627 INFO L82 GeneralOperation]: Start isEquivalent. First operand 951 states. Second operand has 545 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 520 states have internal predecessors, (666), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:43,627 INFO L74 IsIncluded]: Start isIncluded. First operand 951 states. Second operand has 545 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 520 states have internal predecessors, (666), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:43,627 INFO L87 Difference]: Start difference. First operand 951 states. Second operand has 545 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 520 states have internal predecessors, (666), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:43,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:43,651 INFO L93 Difference]: Finished difference Result 951 states and 1194 transitions. [2022-02-20 23:45:43,651 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1194 transitions. [2022-02-20 23:45:43,651 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:43,651 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:43,652 INFO L74 IsIncluded]: Start isIncluded. First operand has 545 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 520 states have internal predecessors, (666), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 951 states. [2022-02-20 23:45:43,652 INFO L87 Difference]: Start difference. First operand has 545 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 520 states have internal predecessors, (666), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 951 states. [2022-02-20 23:45:43,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:43,676 INFO L93 Difference]: Finished difference Result 951 states and 1194 transitions. [2022-02-20 23:45:43,676 INFO L276 IsEmpty]: Start isEmpty. Operand 951 states and 1194 transitions. [2022-02-20 23:45:43,676 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:43,677 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:43,677 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:43,677 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:43,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 545 states, 479 states have (on average 1.3903966597077244) internal successors, (666), 520 states have internal predecessors, (666), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:43,686 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 545 states to 545 states and 702 transitions. [2022-02-20 23:45:43,686 INFO L78 Accepts]: Start accepts. Automaton has 545 states and 702 transitions. Word has length 35 [2022-02-20 23:45:43,686 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:43,686 INFO L470 AbstractCegarLoop]: Abstraction has 545 states and 702 transitions. [2022-02-20 23:45:43,686 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 8.25) internal successors, (33), 5 states have internal predecessors, (33), 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:45:43,686 INFO L276 IsEmpty]: Start isEmpty. Operand 545 states and 702 transitions. [2022-02-20 23:45:43,687 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:45:43,687 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:43,687 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] [2022-02-20 23:45:43,687 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable39 [2022-02-20 23:45:43,687 INFO L402 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:43,687 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:43,687 INFO L85 PathProgramCache]: Analyzing trace with hash 399419022, now seen corresponding path program 1 times [2022-02-20 23:45:43,687 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:43,687 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1089796272] [2022-02-20 23:45:43,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:43,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:43,701 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:43,767 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:43,768 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:43,770 INFO L290 TraceCheckUtils]: 0: Hoare triple {93208#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {93208#true} is VALID [2022-02-20 23:45:43,770 INFO L290 TraceCheckUtils]: 1: Hoare triple {93208#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {93208#true} is VALID [2022-02-20 23:45:43,770 INFO L290 TraceCheckUtils]: 2: Hoare triple {93208#true} assume true; {93208#true} is VALID [2022-02-20 23:45:43,770 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {93208#true} {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,771 INFO L290 TraceCheckUtils]: 0: Hoare triple {93208#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(12, 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); {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,771 INFO L290 TraceCheckUtils]: 1: Hoare triple {93210#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,772 INFO L290 TraceCheckUtils]: 2: Hoare triple {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,772 INFO L290 TraceCheckUtils]: 3: Hoare triple {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,772 INFO L290 TraceCheckUtils]: 4: Hoare triple {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,773 INFO L290 TraceCheckUtils]: 5: Hoare triple {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,773 INFO L272 TraceCheckUtils]: 6: Hoare triple {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {93208#true} is VALID [2022-02-20 23:45:43,773 INFO L290 TraceCheckUtils]: 7: Hoare triple {93208#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {93208#true} is VALID [2022-02-20 23:45:43,773 INFO L290 TraceCheckUtils]: 8: Hoare triple {93208#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {93208#true} is VALID [2022-02-20 23:45:43,773 INFO L290 TraceCheckUtils]: 9: Hoare triple {93208#true} assume true; {93208#true} is VALID [2022-02-20 23:45:43,773 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {93208#true} {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {93210#(and (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:43,774 INFO L290 TraceCheckUtils]: 11: Hoare triple {93210#(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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {93215#(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:45:43,774 INFO L290 TraceCheckUtils]: 12: Hoare triple {93215#(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); {93215#(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:45:43,775 INFO L290 TraceCheckUtils]: 13: Hoare triple {93215#(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; {93215#(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:45:43,775 INFO L290 TraceCheckUtils]: 14: Hoare triple {93215#(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; {93215#(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:45:43,775 INFO L290 TraceCheckUtils]: 15: Hoare triple {93215#(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; {93215#(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:45:43,776 INFO L290 TraceCheckUtils]: 16: Hoare triple {93215#(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: L677-12 {93216#(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:45:43,777 INFO L290 TraceCheckUtils]: 17: Hoare triple {93216#(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; {93216#(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:45:43,777 INFO L290 TraceCheckUtils]: 18: Hoare triple {93216#(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; {93216#(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:45:43,777 INFO L290 TraceCheckUtils]: 19: Hoare triple {93216#(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~short12#1 := create_item_#t~short10#1; {93216#(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:45:43,778 INFO L290 TraceCheckUtils]: 20: Hoare triple {93216#(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~short12#1; {93216#(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:45:43,778 INFO L290 TraceCheckUtils]: 21: Hoare triple {93216#(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~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {93216#(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:45:43,779 INFO L290 TraceCheckUtils]: 22: Hoare triple {93216#(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~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {93216#(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:45:43,779 INFO L290 TraceCheckUtils]: 23: Hoare triple {93216#(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~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {93216#(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:45:43,780 INFO L290 TraceCheckUtils]: 24: Hoare triple {93216#(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: L680 {93216#(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:45:43,780 INFO L290 TraceCheckUtils]: 25: Hoare triple {93216#(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~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {93216#(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:45:43,781 INFO L290 TraceCheckUtils]: 26: Hoare triple {93216#(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~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {93216#(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:45:43,781 INFO L290 TraceCheckUtils]: 27: Hoare triple {93216#(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~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {93216#(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:45:43,782 INFO L290 TraceCheckUtils]: 28: Hoare triple {93216#(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); {93216#(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:45:43,782 INFO L290 TraceCheckUtils]: 29: Hoare triple {93216#(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_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {93217#(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:45:43,783 INFO L290 TraceCheckUtils]: 30: Hoare triple {93217#(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_~item~0#1.base, create_item_~item~0#1.offset; {93217#(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:45:43,783 INFO L290 TraceCheckUtils]: 31: Hoare triple {93217#(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~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {93217#(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:45:43,783 INFO L290 TraceCheckUtils]: 32: Hoare triple {93217#(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~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {93217#(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:45:43,784 INFO L290 TraceCheckUtils]: 33: Hoare triple {93217#(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~mem18#1.base && 0 == append_one_#t~mem18#1.offset;havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {93217#(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:45:43,784 INFO L290 TraceCheckUtils]: 34: Hoare triple {93217#(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); {93209#false} is VALID [2022-02-20 23:45:43,784 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:43,784 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:43,785 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1089796272] [2022-02-20 23:45:43,785 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1089796272] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:43,785 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:43,785 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 23:45:43,785 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [175086978] [2022-02-20 23:45:43,785 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:43,786 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:43,786 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:43,786 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:43,806 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:43,806 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 23:45:43,806 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:43,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 23:45:43,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2022-02-20 23:45:43,806 INFO L87 Difference]: Start difference. First operand 545 states and 702 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:44,537 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:44,537 INFO L93 Difference]: Finished difference Result 855 states and 1077 transitions. [2022-02-20 23:45:44,537 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 23:45:44,537 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:44,537 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:44,537 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:44,539 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2022-02-20 23:45:44,539 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:44,540 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 404 transitions. [2022-02-20 23:45:44,540 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 404 transitions. [2022-02-20 23:45:44,814 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 404 edges. 404 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:44,834 INFO L225 Difference]: With dead ends: 855 [2022-02-20 23:45:44,835 INFO L226 Difference]: Without dead ends: 855 [2022-02-20 23:45:44,835 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:45:44,835 INFO L933 BasicCegarLoop]: 193 mSDtfsCounter, 779 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 175 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 779 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 184 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 175 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:44,835 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [779 Valid, 556 Invalid, 184 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 175 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:44,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 855 states. [2022-02-20 23:45:44,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 855 to 544. [2022-02-20 23:45:44,840 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:44,841 INFO L82 GeneralOperation]: Start isEquivalent. First operand 855 states. Second operand has 544 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 519 states have internal predecessors, (664), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:44,841 INFO L74 IsIncluded]: Start isIncluded. First operand 855 states. Second operand has 544 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 519 states have internal predecessors, (664), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:44,841 INFO L87 Difference]: Start difference. First operand 855 states. Second operand has 544 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 519 states have internal predecessors, (664), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:44,861 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:44,861 INFO L93 Difference]: Finished difference Result 855 states and 1077 transitions. [2022-02-20 23:45:44,861 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1077 transitions. [2022-02-20 23:45:44,862 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:44,862 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:44,862 INFO L74 IsIncluded]: Start isIncluded. First operand has 544 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 519 states have internal predecessors, (664), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 855 states. [2022-02-20 23:45:44,863 INFO L87 Difference]: Start difference. First operand has 544 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 519 states have internal predecessors, (664), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 855 states. [2022-02-20 23:45:44,882 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:44,883 INFO L93 Difference]: Finished difference Result 855 states and 1077 transitions. [2022-02-20 23:45:44,883 INFO L276 IsEmpty]: Start isEmpty. Operand 855 states and 1077 transitions. [2022-02-20 23:45:44,883 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:44,883 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:44,883 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:44,884 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:44,884 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 544 states, 479 states have (on average 1.3862212943632568) internal successors, (664), 519 states have internal predecessors, (664), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:44,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 544 states to 544 states and 700 transitions. [2022-02-20 23:45:44,892 INFO L78 Accepts]: Start accepts. Automaton has 544 states and 700 transitions. Word has length 35 [2022-02-20 23:45:44,893 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:44,893 INFO L470 AbstractCegarLoop]: Abstraction has 544 states and 700 transitions. [2022-02-20 23:45:44,893 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 6 states have internal predecessors, (33), 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:45:44,893 INFO L276 IsEmpty]: Start isEmpty. Operand 544 states and 700 transitions. [2022-02-20 23:45:44,893 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2022-02-20 23:45:44,893 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:44,893 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 23:45:44,893 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40 [2022-02-20 23:45:44,893 INFO L402 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:44,893 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:44,893 INFO L85 PathProgramCache]: Analyzing trace with hash 399419183, now seen corresponding path program 1 times [2022-02-20 23:45:44,893 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:44,894 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [551527847] [2022-02-20 23:45:44,894 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:44,894 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:44,908 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:44,955 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:44,957 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:44,958 INFO L290 TraceCheckUtils]: 0: Hoare triple {96335#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {96335#true} is VALID [2022-02-20 23:45:44,959 INFO L290 TraceCheckUtils]: 1: Hoare triple {96335#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {96335#true} is VALID [2022-02-20 23:45:44,959 INFO L290 TraceCheckUtils]: 2: Hoare triple {96335#true} assume true; {96335#true} is VALID [2022-02-20 23:45:44,959 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {96335#true} {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,960 INFO L290 TraceCheckUtils]: 0: Hoare triple {96335#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(12, 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); {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,960 INFO L290 TraceCheckUtils]: 1: Hoare triple {96337#(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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,961 INFO L290 TraceCheckUtils]: 2: Hoare triple {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,961 INFO L290 TraceCheckUtils]: 3: Hoare triple {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,961 INFO L290 TraceCheckUtils]: 4: Hoare triple {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,962 INFO L272 TraceCheckUtils]: 6: Hoare triple {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} call main_#t~ret32#1 := rand_end_point(); {96335#true} is VALID [2022-02-20 23:45:44,962 INFO L290 TraceCheckUtils]: 7: Hoare triple {96335#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {96335#true} is VALID [2022-02-20 23:45:44,962 INFO L290 TraceCheckUtils]: 8: Hoare triple {96335#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {96335#true} is VALID [2022-02-20 23:45:44,962 INFO L290 TraceCheckUtils]: 9: Hoare triple {96335#true} assume true; {96335#true} is VALID [2022-02-20 23:45:44,963 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {96335#true} {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} #306#return; {96337#(and (= 3 |~#list~0.base|) (= (select |#length| 3) 8) (<= 0 |~#list~0.offset|) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:44,963 INFO L290 TraceCheckUtils]: 11: Hoare triple {96337#(and (= 3 |~#list~0.base|) (= (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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {96342#(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:45:44,964 INFO L290 TraceCheckUtils]: 12: Hoare triple {96342#(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_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {96342#(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:45:44,964 INFO L290 TraceCheckUtils]: 13: Hoare triple {96342#(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))} 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; {96342#(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:45:44,965 INFO L290 TraceCheckUtils]: 14: Hoare triple {96342#(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_#t~switch6#1;create_item_~link_field~0#1 := ~unnamed2~0~ITEM_NEXT;create_item_~term_field~0#1 := ~unnamed2~0~ITEM_PREV; {96342#(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:45:44,965 INFO L290 TraceCheckUtils]: 15: Hoare triple {96342#(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))} havoc create_item_#t~switch6#1; {96342#(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:45:44,965 INFO L290 TraceCheckUtils]: 16: Hoare triple {96342#(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 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: L677-12 {96342#(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:45:44,966 INFO L290 TraceCheckUtils]: 17: Hoare triple {96342#(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_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {96342#(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:45:44,966 INFO L290 TraceCheckUtils]: 18: Hoare triple {96342#(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_#t~short10#1; {96342#(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:45:44,966 INFO L290 TraceCheckUtils]: 19: Hoare triple {96342#(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_#t~short12#1 := create_item_#t~short10#1; {96342#(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:45:44,967 INFO L290 TraceCheckUtils]: 20: Hoare triple {96342#(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_#t~short12#1; {96342#(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:45:44,967 INFO L290 TraceCheckUtils]: 21: Hoare triple {96342#(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_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {96342#(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:45:44,968 INFO L290 TraceCheckUtils]: 22: Hoare triple {96342#(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 create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {96342#(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:45:44,968 INFO L290 TraceCheckUtils]: 23: Hoare triple {96342#(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_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {96342#(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:45:44,968 INFO L290 TraceCheckUtils]: 24: Hoare triple {96342#(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_~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: L680 {96342#(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:45:44,969 INFO L290 TraceCheckUtils]: 25: Hoare triple {96342#(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);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {96342#(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:45:44,969 INFO L290 TraceCheckUtils]: 26: Hoare triple {96342#(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_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {96342#(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:45:44,970 INFO L290 TraceCheckUtils]: 27: Hoare triple {96342#(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))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {96342#(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:45:44,970 INFO L290 TraceCheckUtils]: 28: Hoare triple {96342#(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); {96342#(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:45:44,970 INFO L290 TraceCheckUtils]: 29: Hoare triple {96342#(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_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {96342#(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:45:44,971 INFO L290 TraceCheckUtils]: 30: Hoare triple {96342#(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_~item~0#1.base, create_item_~item~0#1.offset; {96342#(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:45:44,971 INFO L290 TraceCheckUtils]: 31: Hoare triple {96342#(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~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {96342#(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:45:44,972 INFO L290 TraceCheckUtils]: 32: Hoare triple {96342#(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~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {96342#(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:45:44,972 INFO L290 TraceCheckUtils]: 33: Hoare triple {96342#(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~mem18#1.base && 0 == append_one_#t~mem18#1.offset);havoc append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset; {96342#(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:45:44,972 INFO L290 TraceCheckUtils]: 34: Hoare triple {96342#(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); {96336#false} is VALID [2022-02-20 23:45:44,973 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:44,973 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:44,973 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [551527847] [2022-02-20 23:45:44,973 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [551527847] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:44,973 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:44,973 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 23:45:44,973 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [540650523] [2022-02-20 23:45:44,974 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:44,974 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:44,974 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:44,974 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:45:44,994 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:44,995 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 23:45:44,995 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:44,995 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 23:45:44,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 23:45:44,995 INFO L87 Difference]: Start difference. First operand 544 states and 700 transitions. Second operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:45:45,314 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,314 INFO L93 Difference]: Finished difference Result 662 states and 842 transitions. [2022-02-20 23:45:45,314 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 23:45:45,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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 35 [2022-02-20 23:45:45,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:45,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:45:45,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-02-20 23:45:45,315 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:45:45,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 258 transitions. [2022-02-20 23:45:45,316 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 258 transitions. [2022-02-20 23:45:45,493 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 258 edges. 258 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:45,504 INFO L225 Difference]: With dead ends: 662 [2022-02-20 23:45:45,504 INFO L226 Difference]: Without dead ends: 662 [2022-02-20 23:45:45,505 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2022-02-20 23:45:45,505 INFO L933 BasicCegarLoop]: 179 mSDtfsCounter, 298 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 298 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:45,505 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [298 Valid, 259 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:45,506 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 662 states. [2022-02-20 23:45:45,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 662 to 542. [2022-02-20 23:45:45,510 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:45,510 INFO L82 GeneralOperation]: Start isEquivalent. First operand 662 states. Second operand has 542 states, 479 states have (on average 1.3778705636743216) internal successors, (660), 517 states have internal predecessors, (660), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:45,510 INFO L74 IsIncluded]: Start isIncluded. First operand 662 states. Second operand has 542 states, 479 states have (on average 1.3778705636743216) internal successors, (660), 517 states have internal predecessors, (660), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:45,511 INFO L87 Difference]: Start difference. First operand 662 states. Second operand has 542 states, 479 states have (on average 1.3778705636743216) internal successors, (660), 517 states have internal predecessors, (660), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:45,522 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,522 INFO L93 Difference]: Finished difference Result 662 states and 842 transitions. [2022-02-20 23:45:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 842 transitions. [2022-02-20 23:45:45,523 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:45,523 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:45,523 INFO L74 IsIncluded]: Start isIncluded. First operand has 542 states, 479 states have (on average 1.3778705636743216) internal successors, (660), 517 states have internal predecessors, (660), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 662 states. [2022-02-20 23:45:45,523 INFO L87 Difference]: Start difference. First operand has 542 states, 479 states have (on average 1.3778705636743216) internal successors, (660), 517 states have internal predecessors, (660), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) Second operand 662 states. [2022-02-20 23:45:45,535 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:45,535 INFO L93 Difference]: Finished difference Result 662 states and 842 transitions. [2022-02-20 23:45:45,535 INFO L276 IsEmpty]: Start isEmpty. Operand 662 states and 842 transitions. [2022-02-20 23:45:45,535 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:45,535 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:45,535 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:45,535 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:45,536 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 542 states, 479 states have (on average 1.3778705636743216) internal successors, (660), 517 states have internal predecessors, (660), 12 states have call successors, (12), 6 states have call predecessors, (12), 12 states have return successors, (24), 18 states have call predecessors, (24), 12 states have call successors, (24) [2022-02-20 23:45:45,544 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 542 states to 542 states and 696 transitions. [2022-02-20 23:45:45,544 INFO L78 Accepts]: Start accepts. Automaton has 542 states and 696 transitions. Word has length 35 [2022-02-20 23:45:45,544 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:45,544 INFO L470 AbstractCegarLoop]: Abstraction has 542 states and 696 transitions. [2022-02-20 23:45:45,544 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 11.0) internal successors, (33), 4 states have internal predecessors, (33), 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:45:45,544 INFO L276 IsEmpty]: Start isEmpty. Operand 542 states and 696 transitions. [2022-02-20 23:45:45,544 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2022-02-20 23:45:45,544 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:45,545 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] [2022-02-20 23:45:45,545 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable41 [2022-02-20 23:45:45,545 INFO L402 AbstractCegarLoop]: === Iteration 43 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:45,545 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:45,545 INFO L85 PathProgramCache]: Analyzing trace with hash 1620073746, now seen corresponding path program 1 times [2022-02-20 23:45:45,545 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:45,545 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1656818161] [2022-02-20 23:45:45,545 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:45,545 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:45,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,602 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:45,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,605 INFO L290 TraceCheckUtils]: 0: Hoare triple {98875#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,605 INFO L290 TraceCheckUtils]: 1: Hoare triple {98875#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98875#true} is VALID [2022-02-20 23:45:45,605 INFO L290 TraceCheckUtils]: 2: Hoare triple {98875#true} assume true; {98875#true} is VALID [2022-02-20 23:45:45,605 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98875#true} {98875#true} #308#return; {98875#true} is VALID [2022-02-20 23:45:45,606 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 36 [2022-02-20 23:45:45,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,608 INFO L290 TraceCheckUtils]: 0: Hoare triple {98875#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {98875#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98875#true} is VALID [2022-02-20 23:45:45,609 INFO L290 TraceCheckUtils]: 2: Hoare triple {98875#true} assume true; {98875#true} is VALID [2022-02-20 23:45:45,609 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {98875#true} {98884#(= (select |#valid| |~#list~0.base|) 1)} #308#return; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:45,609 INFO L290 TraceCheckUtils]: 0: Hoare triple {98875#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(12, 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); {98875#true} is VALID [2022-02-20 23:45:45,609 INFO L290 TraceCheckUtils]: 1: Hoare triple {98875#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 2: Hoare triple {98875#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 3: Hoare triple {98875#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 4: Hoare triple {98875#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 5: Hoare triple {98875#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 6: Hoare triple {98875#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 7: Hoare triple {98875#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L272 TraceCheckUtils]: 8: Hoare triple {98875#true} call main_#t~ret34#1 := rand_end_point(); {98875#true} is VALID [2022-02-20 23:45:45,610 INFO L290 TraceCheckUtils]: 9: Hoare triple {98875#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,611 INFO L290 TraceCheckUtils]: 10: Hoare triple {98875#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98875#true} is VALID [2022-02-20 23:45:45,611 INFO L290 TraceCheckUtils]: 11: Hoare triple {98875#true} assume true; {98875#true} is VALID [2022-02-20 23:45:45,611 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {98875#true} {98875#true} #308#return; {98875#true} is VALID [2022-02-20 23:45:45,611 INFO L290 TraceCheckUtils]: 13: Hoare triple {98875#true} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,612 INFO L290 TraceCheckUtils]: 14: Hoare triple {98881#(= |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: L655 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,612 INFO L290 TraceCheckUtils]: 15: Hoare triple {98881#(= |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; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,612 INFO L290 TraceCheckUtils]: 16: Hoare triple {98881#(= |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: L656 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,613 INFO L290 TraceCheckUtils]: 17: Hoare triple {98881#(= |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; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,613 INFO L290 TraceCheckUtils]: 18: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,613 INFO L290 TraceCheckUtils]: 19: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,614 INFO L290 TraceCheckUtils]: 20: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,614 INFO L290 TraceCheckUtils]: 21: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,614 INFO L290 TraceCheckUtils]: 22: Hoare triple {98881#(= |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_BEG, 4); srcloc: L700 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,615 INFO L290 TraceCheckUtils]: 23: Hoare triple {98881#(= |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_END, 4); srcloc: L700-1 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,615 INFO L290 TraceCheckUtils]: 24: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,615 INFO L290 TraceCheckUtils]: 25: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,616 INFO L290 TraceCheckUtils]: 26: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem23#1.offset; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,616 INFO L290 TraceCheckUtils]: 27: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,616 INFO L290 TraceCheckUtils]: 28: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {98882#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:45,617 INFO L290 TraceCheckUtils]: 29: Hoare triple {98882#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {98883#(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:45:45,617 INFO L290 TraceCheckUtils]: 30: Hoare triple {98883#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {98883#(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:45:45,617 INFO L290 TraceCheckUtils]: 31: Hoare triple {98883#(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~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {98883#(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:45:45,618 INFO L290 TraceCheckUtils]: 32: Hoare triple {98883#(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~res24#1.base, remove_one_#t~memset~res24#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~res24#1.base, remove_one_#t~memset~res24#1.offset; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:45,618 INFO L290 TraceCheckUtils]: 33: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret34#1; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:45,618 INFO L290 TraceCheckUtils]: 34: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:45,618 INFO L290 TraceCheckUtils]: 35: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:45,619 INFO L272 TraceCheckUtils]: 36: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} call main_#t~ret34#1 := rand_end_point(); {98875#true} is VALID [2022-02-20 23:45:45,619 INFO L290 TraceCheckUtils]: 37: Hoare triple {98875#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:45,619 INFO L290 TraceCheckUtils]: 38: Hoare triple {98875#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98875#true} is VALID [2022-02-20 23:45:45,619 INFO L290 TraceCheckUtils]: 39: Hoare triple {98875#true} assume true; {98875#true} is VALID [2022-02-20 23:45:45,619 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {98875#true} {98884#(= (select |#valid| |~#list~0.base|) 1)} #308#return; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:45,620 INFO L290 TraceCheckUtils]: 41: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {98889#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} is VALID [2022-02-20 23:45:45,620 INFO L290 TraceCheckUtils]: 42: Hoare triple {98889#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} assume !(1 == #valid[is_empty_~list#1.base]); {98876#false} is VALID [2022-02-20 23:45:45,620 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:45:45,620 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:45,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1656818161] [2022-02-20 23:45:45,621 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1656818161] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:45,621 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [152819210] [2022-02-20 23:45:45,621 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:45,621 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:45,621 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:45,623 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:45,623 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2022-02-20 23:45:45,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,724 INFO L263 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 23:45:45,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:45,738 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:45,964 INFO L290 TraceCheckUtils]: 0: Hoare triple {98875#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(12, 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); {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,965 INFO L290 TraceCheckUtils]: 1: Hoare triple {98893#(= 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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,965 INFO L290 TraceCheckUtils]: 2: Hoare triple {98893#(= 3 |~#list~0.base|)} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,965 INFO L290 TraceCheckUtils]: 3: Hoare triple {98893#(= 3 |~#list~0.base|)} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,965 INFO L290 TraceCheckUtils]: 4: Hoare triple {98893#(= 3 |~#list~0.base|)} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,966 INFO L290 TraceCheckUtils]: 5: Hoare triple {98893#(= 3 |~#list~0.base|)} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,966 INFO L290 TraceCheckUtils]: 6: Hoare triple {98893#(= 3 |~#list~0.base|)} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,966 INFO L290 TraceCheckUtils]: 7: Hoare triple {98893#(= 3 |~#list~0.base|)} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,966 INFO L272 TraceCheckUtils]: 8: Hoare triple {98893#(= 3 |~#list~0.base|)} call main_#t~ret34#1 := rand_end_point(); {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,967 INFO L290 TraceCheckUtils]: 9: Hoare triple {98893#(= 3 |~#list~0.base|)} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,967 INFO L290 TraceCheckUtils]: 10: Hoare triple {98893#(= 3 |~#list~0.base|)} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,967 INFO L290 TraceCheckUtils]: 11: Hoare triple {98893#(= 3 |~#list~0.base|)} assume true; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,968 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {98893#(= 3 |~#list~0.base|)} {98893#(= 3 |~#list~0.base|)} #308#return; {98893#(= 3 |~#list~0.base|)} is VALID [2022-02-20 23:45:45,968 INFO L290 TraceCheckUtils]: 13: Hoare triple {98893#(= 3 |~#list~0.base|)} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,969 INFO L290 TraceCheckUtils]: 14: Hoare triple {98933#(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: L655 {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,969 INFO L290 TraceCheckUtils]: 15: Hoare triple {98933#(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; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,969 INFO L290 TraceCheckUtils]: 16: Hoare triple {98933#(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: L656 {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,970 INFO L290 TraceCheckUtils]: 17: Hoare triple {98933#(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; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,970 INFO L290 TraceCheckUtils]: 18: Hoare triple {98933#(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); {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,970 INFO L290 TraceCheckUtils]: 19: Hoare triple {98933#(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; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,971 INFO L290 TraceCheckUtils]: 20: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,971 INFO L290 TraceCheckUtils]: 21: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,972 INFO L290 TraceCheckUtils]: 22: Hoare triple {98933#(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_BEG, 4); srcloc: L700 {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,972 INFO L290 TraceCheckUtils]: 23: Hoare triple {98933#(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_END, 4); srcloc: L700-1 {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,972 INFO L290 TraceCheckUtils]: 24: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,973 INFO L290 TraceCheckUtils]: 25: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,973 INFO L290 TraceCheckUtils]: 26: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 0 == remove_one_#t~mem23#1.offset; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,973 INFO L290 TraceCheckUtils]: 27: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,974 INFO L290 TraceCheckUtils]: 28: Hoare triple {98933#(and (= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {98979#(and (= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,974 INFO L290 TraceCheckUtils]: 29: Hoare triple {98979#(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]; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,975 INFO L290 TraceCheckUtils]: 30: Hoare triple {98983#(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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,975 INFO L290 TraceCheckUtils]: 31: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,975 INFO L290 TraceCheckUtils]: 32: Hoare triple {98983#(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~res24#1.base, remove_one_#t~memset~res24#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~res24#1.base, remove_one_#t~memset~res24#1.offset; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,976 INFO L290 TraceCheckUtils]: 33: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume { :end_inline_remove_one } true;havoc main_#t~ret34#1; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,976 INFO L290 TraceCheckUtils]: 34: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,976 INFO L290 TraceCheckUtils]: 35: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,977 INFO L272 TraceCheckUtils]: 36: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} call main_#t~ret34#1 := rand_end_point(); {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,977 INFO L290 TraceCheckUtils]: 37: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,977 INFO L290 TraceCheckUtils]: 38: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,978 INFO L290 TraceCheckUtils]: 39: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume true; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,978 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} #308#return; {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} is VALID [2022-02-20 23:45:45,979 INFO L290 TraceCheckUtils]: 41: Hoare triple {98983#(and (= (select |#valid| |~#list~0.base|) 1) (= 3 |~#list~0.base|))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {99020#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| 3) 1))} is VALID [2022-02-20 23:45:45,979 INFO L290 TraceCheckUtils]: 42: Hoare triple {99020#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select |#valid| 3) 1))} assume !(1 == #valid[is_empty_~list#1.base]); {98876#false} is VALID [2022-02-20 23:45:45,979 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:45:45,979 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 23:45:46,060 INFO L356 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2022-02-20 23:45:46,061 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:45:46,158 INFO L290 TraceCheckUtils]: 42: Hoare triple {98889#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} assume !(1 == #valid[is_empty_~list#1.base]); {98876#false} is VALID [2022-02-20 23:45:46,159 INFO L290 TraceCheckUtils]: 41: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {98889#(= (select |#valid| |ULTIMATE.start_is_empty_~list#1.base|) 1)} is VALID [2022-02-20 23:45:46,160 INFO L284 TraceCheckUtils]: 40: Hoare quadruple {98875#true} {98884#(= (select |#valid| |~#list~0.base|) 1)} #308#return; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,160 INFO L290 TraceCheckUtils]: 39: Hoare triple {98875#true} assume true; {98875#true} is VALID [2022-02-20 23:45:46,160 INFO L290 TraceCheckUtils]: 38: Hoare triple {98875#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98875#true} is VALID [2022-02-20 23:45:46,160 INFO L290 TraceCheckUtils]: 37: Hoare triple {98875#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:46,160 INFO L272 TraceCheckUtils]: 36: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} call main_#t~ret34#1 := rand_end_point(); {98875#true} is VALID [2022-02-20 23:45:46,160 INFO L290 TraceCheckUtils]: 35: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,160 INFO L290 TraceCheckUtils]: 34: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,161 INFO L290 TraceCheckUtils]: 33: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume { :end_inline_remove_one } true;havoc main_#t~ret34#1; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,161 INFO L290 TraceCheckUtils]: 32: Hoare triple {98884#(= (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~res24#1.base, remove_one_#t~memset~res24#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~res24#1.base, remove_one_#t~memset~res24#1.offset; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,161 INFO L290 TraceCheckUtils]: 31: Hoare triple {98884#(= (select |#valid| |~#list~0.base|) 1)} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,161 INFO L290 TraceCheckUtils]: 30: Hoare triple {98884#(= (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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,162 INFO L290 TraceCheckUtils]: 29: Hoare triple {98882#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {98884#(= (select |#valid| |~#list~0.base|) 1)} is VALID [2022-02-20 23:45:46,162 INFO L290 TraceCheckUtils]: 28: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {98882#(= |ULTIMATE.start_#Ultimate.C_memset_#ptr#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,162 INFO L290 TraceCheckUtils]: 27: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,163 INFO L290 TraceCheckUtils]: 26: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume 0 == remove_one_#t~mem23#1.offset; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,163 INFO L290 TraceCheckUtils]: 25: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,163 INFO L290 TraceCheckUtils]: 24: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,164 INFO L290 TraceCheckUtils]: 23: Hoare triple {98881#(= |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_END, 4); srcloc: L700-1 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,164 INFO L290 TraceCheckUtils]: 22: Hoare triple {98881#(= |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_BEG, 4); srcloc: L700 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,164 INFO L290 TraceCheckUtils]: 21: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,165 INFO L290 TraceCheckUtils]: 20: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,165 INFO L290 TraceCheckUtils]: 19: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,165 INFO L290 TraceCheckUtils]: 18: Hoare triple {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,165 INFO L290 TraceCheckUtils]: 17: Hoare triple {98881#(= |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; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,166 INFO L290 TraceCheckUtils]: 16: Hoare triple {98881#(= |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: L656 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,166 INFO L290 TraceCheckUtils]: 15: Hoare triple {98881#(= |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; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 14: Hoare triple {98881#(= |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: L655 {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 13: Hoare triple {98875#true} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {98881#(= |ULTIMATE.start_remove_one_~list#1.base| |~#list~0.base|)} is VALID [2022-02-20 23:45:46,167 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {98875#true} {98875#true} #308#return; {98875#true} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 11: Hoare triple {98875#true} assume true; {98875#true} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 10: Hoare triple {98875#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {98875#true} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 9: Hoare triple {98875#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:46,167 INFO L272 TraceCheckUtils]: 8: Hoare triple {98875#true} call main_#t~ret34#1 := rand_end_point(); {98875#true} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 7: Hoare triple {98875#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {98875#true} is VALID [2022-02-20 23:45:46,167 INFO L290 TraceCheckUtils]: 6: Hoare triple {98875#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L290 TraceCheckUtils]: 5: Hoare triple {98875#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L290 TraceCheckUtils]: 4: Hoare triple {98875#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L290 TraceCheckUtils]: 3: Hoare triple {98875#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {98875#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {98875#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {98875#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(12, 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); {98875#true} is VALID [2022-02-20 23:45:46,168 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2022-02-20 23:45:46,168 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [152819210] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 23:45:46,168 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 23:45:46,168 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 5, 5] total 11 [2022-02-20 23:45:46,168 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1599621105] [2022-02-20 23:45:46,169 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 23:45:46,169 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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 43 [2022-02-20 23:45:46,169 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:46,169 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:45:46,241 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 87 edges. 87 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:46,241 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 23:45:46,241 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:46,242 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 23:45:46,242 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=102, Unknown=0, NotChecked=0, Total=132 [2022-02-20 23:45:46,242 INFO L87 Difference]: Start difference. First operand 542 states and 696 transitions. Second operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:45:48,526 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:48,526 INFO L93 Difference]: Finished difference Result 1745 states and 2122 transitions. [2022-02-20 23:45:48,526 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2022-02-20 23:45:48,526 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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 43 [2022-02-20 23:45:48,527 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:48,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:45:48,531 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1072 transitions. [2022-02-20 23:45:48,531 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:45:48,545 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14 states to 14 states and 1072 transitions. [2022-02-20 23:45:48,545 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 14 states and 1072 transitions. [2022-02-20 23:45:49,230 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 1072 edges. 1072 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:49,310 INFO L225 Difference]: With dead ends: 1745 [2022-02-20 23:45:49,310 INFO L226 Difference]: Without dead ends: 1745 [2022-02-20 23:45:49,311 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 109 GetRequests, 90 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:45:49,311 INFO L933 BasicCegarLoop]: 232 mSDtfsCounter, 2673 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 146 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2675 SdHoareTripleChecker+Valid, 1131 SdHoareTripleChecker+Invalid, 757 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 146 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:49,311 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [2675 Valid, 1131 Invalid, 757 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [146 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 23:45:49,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1745 states. [2022-02-20 23:45:49,320 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1745 to 664. [2022-02-20 23:45:49,320 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:49,321 INFO L82 GeneralOperation]: Start isEquivalent. First operand 1745 states. Second operand has 664 states, 599 states have (on average 1.332220367278798) internal successors, (798), 631 states have internal predecessors, (798), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-02-20 23:45:49,321 INFO L74 IsIncluded]: Start isIncluded. First operand 1745 states. Second operand has 664 states, 599 states have (on average 1.332220367278798) internal successors, (798), 631 states have internal predecessors, (798), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-02-20 23:45:49,322 INFO L87 Difference]: Start difference. First operand 1745 states. Second operand has 664 states, 599 states have (on average 1.332220367278798) internal successors, (798), 631 states have internal predecessors, (798), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-02-20 23:45:49,400 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,400 INFO L93 Difference]: Finished difference Result 1745 states and 2122 transitions. [2022-02-20 23:45:49,400 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2122 transitions. [2022-02-20 23:45:49,402 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,402 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,402 INFO L74 IsIncluded]: Start isIncluded. First operand has 664 states, 599 states have (on average 1.332220367278798) internal successors, (798), 631 states have internal predecessors, (798), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) Second operand 1745 states. [2022-02-20 23:45:49,403 INFO L87 Difference]: Start difference. First operand has 664 states, 599 states have (on average 1.332220367278798) internal successors, (798), 631 states have internal predecessors, (798), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) Second operand 1745 states. [2022-02-20 23:45:49,478 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:49,479 INFO L93 Difference]: Finished difference Result 1745 states and 2122 transitions. [2022-02-20 23:45:49,479 INFO L276 IsEmpty]: Start isEmpty. Operand 1745 states and 2122 transitions. [2022-02-20 23:45:49,480 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:49,480 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:49,480 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:49,480 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:49,480 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 664 states, 599 states have (on average 1.332220367278798) internal successors, (798), 631 states have internal predecessors, (798), 16 states have call successors, (16), 8 states have call predecessors, (16), 16 states have return successors, (32), 24 states have call predecessors, (32), 16 states have call successors, (32) [2022-02-20 23:45:49,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 664 states to 664 states and 846 transitions. [2022-02-20 23:45:49,492 INFO L78 Accepts]: Start accepts. Automaton has 664 states and 846 transitions. Word has length 43 [2022-02-20 23:45:49,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:49,492 INFO L470 AbstractCegarLoop]: Abstraction has 664 states and 846 transitions. [2022-02-20 23:45:49,492 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 7.181818181818182) internal successors, (79), 12 states have internal predecessors, (79), 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:45:49,492 INFO L276 IsEmpty]: Start isEmpty. Operand 664 states and 846 transitions. [2022-02-20 23:45:49,493 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2022-02-20 23:45:49,493 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:49,493 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] [2022-02-20 23:45:49,512 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:45:49,703 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,SelfDestructingSolverStorable42 [2022-02-20 23:45:49,704 INFO L402 AbstractCegarLoop]: === Iteration 44 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:49,704 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:49,704 INFO L85 PathProgramCache]: Analyzing trace with hash 1803853866, now seen corresponding path program 1 times [2022-02-20 23:45:49,704 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:49,704 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1636954380] [2022-02-20 23:45:49,704 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,704 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:49,727 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,777 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 8 [2022-02-20 23:45:49,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,780 INFO L290 TraceCheckUtils]: 0: Hoare triple {105072#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {105072#true} is VALID [2022-02-20 23:45:49,780 INFO L290 TraceCheckUtils]: 1: Hoare triple {105072#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {105072#true} assume true; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {105072#true} {105072#true} #308#return; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 0: Hoare triple {105072#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(12, 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); {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 1: Hoare triple {105072#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 2: Hoare triple {105072#true} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 3: Hoare triple {105072#true} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 4: Hoare triple {105072#true} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {105072#true} is VALID [2022-02-20 23:45:49,786 INFO L290 TraceCheckUtils]: 5: Hoare triple {105072#true} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L290 TraceCheckUtils]: 6: Hoare triple {105072#true} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L290 TraceCheckUtils]: 7: Hoare triple {105072#true} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L272 TraceCheckUtils]: 8: Hoare triple {105072#true} call main_#t~ret34#1 := rand_end_point(); {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {105072#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {105072#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L290 TraceCheckUtils]: 11: Hoare triple {105072#true} assume true; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {105072#true} {105072#true} #308#return; {105072#true} is VALID [2022-02-20 23:45:49,787 INFO L290 TraceCheckUtils]: 13: Hoare triple {105072#true} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 14: Hoare triple {105072#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: L655 {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 15: Hoare triple {105072#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; {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 16: Hoare triple {105072#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: L656 {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 17: Hoare triple {105072#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; {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 18: Hoare triple {105072#true} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 19: Hoare triple {105072#true} is_empty_#res#1 := is_empty_~no_beg~0#1; {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 20: Hoare triple {105072#true} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 21: Hoare triple {105072#true} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {105072#true} is VALID [2022-02-20 23:45:49,788 INFO L290 TraceCheckUtils]: 22: Hoare triple {105072#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_BEG, 4); srcloc: L700 {105072#true} is VALID [2022-02-20 23:45:49,789 INFO L290 TraceCheckUtils]: 23: Hoare triple {105072#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_END, 4); srcloc: L700-1 {105072#true} is VALID [2022-02-20 23:45:49,789 INFO L290 TraceCheckUtils]: 24: Hoare triple {105072#true} assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {105072#true} is VALID [2022-02-20 23:45:49,789 INFO L290 TraceCheckUtils]: 25: Hoare triple {105072#true} SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {105072#true} is VALID [2022-02-20 23:45:49,789 INFO L290 TraceCheckUtils]: 26: Hoare triple {105072#true} assume 0 == remove_one_#t~mem23#1.offset; {105072#true} is VALID [2022-02-20 23:45:49,789 INFO L290 TraceCheckUtils]: 27: Hoare triple {105072#true} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {105072#true} is VALID [2022-02-20 23:45:49,790 INFO L290 TraceCheckUtils]: 28: Hoare triple {105072#true} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {105078#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} is VALID [2022-02-20 23:45:49,790 INFO L290 TraceCheckUtils]: 29: Hoare triple {105078#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {105078#(= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0)} is VALID [2022-02-20 23:45:49,791 INFO L290 TraceCheckUtils]: 30: Hoare triple {105078#(= (+ |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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {105079#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| 0) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} is VALID [2022-02-20 23:45:49,791 INFO L290 TraceCheckUtils]: 31: Hoare triple {105079#(and (= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| 0) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} assume #Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1 % 256];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr39#1 := 1 + #Ultimate.C_memset_#t~loopctr39#1; {105080#(and (not (<= (+ (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| 1) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 32: Hoare triple {105080#(and (not (<= (+ (div |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| 4294967296) 1) 0)) (<= |ULTIMATE.start_#Ultimate.C_memset_#t~loopctr39#1| 1) (= (+ |ULTIMATE.start_#Ultimate.C_memset_#amount#1| (- 8)) 0))} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {105073#false} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 33: Hoare triple {105073#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~res24#1.base, remove_one_#t~memset~res24#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~res24#1.base, remove_one_#t~memset~res24#1.offset; {105073#false} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 34: Hoare triple {105073#false} assume { :end_inline_remove_one } true;havoc main_#t~ret34#1; {105073#false} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 35: Hoare triple {105073#false} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {105073#false} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 36: Hoare triple {105073#false} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {105073#false} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 37: Hoare triple {105073#false} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {105073#false} is VALID [2022-02-20 23:45:49,792 INFO L290 TraceCheckUtils]: 38: Hoare triple {105073#false} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L290 TraceCheckUtils]: 39: Hoare triple {105073#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L290 TraceCheckUtils]: 40: Hoare triple {105073#false} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L290 TraceCheckUtils]: 41: Hoare triple {105073#false} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L290 TraceCheckUtils]: 42: Hoare triple {105073#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L290 TraceCheckUtils]: 43: Hoare triple {105073#false} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L290 TraceCheckUtils]: 44: Hoare triple {105073#false} assume !(1 == #valid[main_~cursor~1#1.base]); {105073#false} is VALID [2022-02-20 23:45:49,793 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:49,793 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:49,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1636954380] [2022-02-20 23:45:49,794 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1636954380] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:49,794 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2027466089] [2022-02-20 23:45:49,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:49,794 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:49,794 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:49,795 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2022-02-20 23:45:49,796 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2022-02-20 23:45:49,869 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 32 conjunts are in the unsatisfiable core [2022-02-20 23:45:49,887 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:49,889 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:50,078 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:45:50,079 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-02-20 23:45:50,082 INFO L173 IndexEqualityManager]: detected equality via solver [2022-02-20 23:45:50,083 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 7 [2022-02-20 23:45:50,187 INFO L290 TraceCheckUtils]: 0: Hoare triple {105072#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(12, 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); {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,187 INFO L290 TraceCheckUtils]: 1: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,188 INFO L290 TraceCheckUtils]: 2: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,188 INFO L290 TraceCheckUtils]: 3: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,189 INFO L290 TraceCheckUtils]: 4: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,189 INFO L290 TraceCheckUtils]: 5: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,190 INFO L290 TraceCheckUtils]: 6: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,190 INFO L290 TraceCheckUtils]: 7: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume !!(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,191 INFO L272 TraceCheckUtils]: 8: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} call main_#t~ret34#1 := rand_end_point(); {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,191 INFO L290 TraceCheckUtils]: 9: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,192 INFO L290 TraceCheckUtils]: 10: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,192 INFO L290 TraceCheckUtils]: 11: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume true; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,193 INFO L284 TraceCheckUtils]: 12: Hoare quadruple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} #308#return; {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} is VALID [2022-02-20 23:45:50,194 INFO L290 TraceCheckUtils]: 13: Hoare triple {105084#(and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) |~#list~0.offset|) 0) (= |~#list~0.offset| 0) (= 3 |~#list~0.base|) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) |~#list~0.offset|) 0))} assume -2147483648 <= main_#t~ret34#1 && main_#t~ret34#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~ret34#1;havoc remove_one_#t~ret20#1, 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~mem23#1.base, remove_one_#t~mem23#1.offset, remove_one_#t~memset~res24#1.base, remove_one_#t~memset~res24#1.offset, remove_one_#t~ite25#1, remove_one_#t~ite26#1, remove_one_#t~mem27#1.base, remove_one_#t~mem27#1.offset, remove_one_#t~mem28#1.base, remove_one_#t~mem28#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; {105124#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select (select |#memory_$Pointer$.offset| 3) 0) 0) (= |ULTIMATE.start_is_empty_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| 3) 0) 0))} is VALID [2022-02-20 23:45:50,194 INFO L290 TraceCheckUtils]: 14: Hoare triple {105124#(and (= |ULTIMATE.start_is_empty_~list#1.base| 3) (= (select (select |#memory_$Pointer$.offset| 3) 0) 0) (= |ULTIMATE.start_is_empty_~list#1.offset| 0) (= (select (select |#memory_$Pointer$.base| 3) 0) 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: L655 {105128#(and (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#1.offset|))} is VALID [2022-02-20 23:45:50,195 INFO L290 TraceCheckUtils]: 15: Hoare triple {105128#(and (= |ULTIMATE.start_is_empty_#t~mem3#1.base| 0) (= 0 |ULTIMATE.start_is_empty_#t~mem3#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; {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#1|)} is VALID [2022-02-20 23:45:50,195 INFO L290 TraceCheckUtils]: 16: Hoare triple {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#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: L656 {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#1|)} is VALID [2022-02-20 23:45:50,195 INFO L290 TraceCheckUtils]: 17: Hoare triple {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#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; {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#1|)} is VALID [2022-02-20 23:45:50,196 INFO L290 TraceCheckUtils]: 18: Hoare triple {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#1|)} assume !(is_empty_~no_beg~0#1 != is_empty_~no_end~0#1); {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#1|)} is VALID [2022-02-20 23:45:50,196 INFO L290 TraceCheckUtils]: 19: Hoare triple {105132#(<= 1 |ULTIMATE.start_is_empty_~no_beg~0#1|)} is_empty_#res#1 := is_empty_~no_beg~0#1; {105145#(<= 1 |ULTIMATE.start_is_empty_#res#1|)} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 20: Hoare triple {105145#(<= 1 |ULTIMATE.start_is_empty_#res#1|)} remove_one_#t~ret20#1 := is_empty_#res#1;assume { :end_inline_is_empty } true;assume -2147483648 <= remove_one_#t~ret20#1 && remove_one_#t~ret20#1 <= 2147483647; {105149#(<= 1 |ULTIMATE.start_remove_one_#t~ret20#1|)} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 21: Hoare triple {105149#(<= 1 |ULTIMATE.start_remove_one_#t~ret20#1|)} assume !(0 != remove_one_#t~ret20#1);havoc remove_one_#t~ret20#1; {105073#false} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 22: Hoare triple {105073#false} 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_BEG, 4); srcloc: L700 {105073#false} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 23: Hoare triple {105073#false} 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_END, 4); srcloc: L700-1 {105073#false} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 24: Hoare triple {105073#false} assume remove_one_#t~mem21#1.base == remove_one_#t~mem22#1.base && remove_one_#t~mem21#1.offset == remove_one_#t~mem22#1.offset;havoc remove_one_#t~mem21#1.base, remove_one_#t~mem21#1.offset;havoc remove_one_#t~mem22#1.base, remove_one_#t~mem22#1.offset; {105073#false} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 25: Hoare triple {105073#false} SUMMARY for call remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset := read~$Pointer$(remove_one_~list#1.base, remove_one_~list#1.offset + 4 * ~unnamed1~0~LIST_BEG, 4); srcloc: L701 {105073#false} is VALID [2022-02-20 23:45:50,197 INFO L290 TraceCheckUtils]: 26: Hoare triple {105073#false} assume 0 == remove_one_#t~mem23#1.offset; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 27: Hoare triple {105073#false} assume remove_one_#t~mem23#1.base < #StackHeapBarrier; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 28: Hoare triple {105073#false} assume 0 == remove_one_#t~mem23#1.base || 1 == #valid[remove_one_#t~mem23#1.base];call ULTIMATE.dealloc(remove_one_#t~mem23#1.base, remove_one_#t~mem23#1.offset);havoc remove_one_#t~mem23#1.base, remove_one_#t~mem23#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; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 29: Hoare triple {105073#false} assume 1 == #valid[#Ultimate.C_memset_#ptr#1.base]; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 30: Hoare triple {105073#false} 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~loopctr39#1;#Ultimate.C_memset_#t~loopctr39#1 := 0; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 31: Hoare triple {105073#false} assume #Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296;#memory_$Pointer$.base, #memory_$Pointer$.offset := #memory_$Pointer$.base[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := 0], #memory_$Pointer$.offset[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1 % 256];#memory_int := #memory_int[#Ultimate.C_memset_#ptr#1.base,#Ultimate.C_memset_#ptr#1.offset + #Ultimate.C_memset_#t~loopctr39#1 := #Ultimate.C_memset_#value#1];#Ultimate.C_memset_#t~loopctr39#1 := 1 + #Ultimate.C_memset_#t~loopctr39#1; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 32: Hoare triple {105073#false} assume !(#Ultimate.C_memset_#t~loopctr39#1 % 4294967296 < #Ultimate.C_memset_#amount#1 % 4294967296); {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 33: Hoare triple {105073#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~res24#1.base, remove_one_#t~memset~res24#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~res24#1.base, remove_one_#t~memset~res24#1.offset; {105073#false} is VALID [2022-02-20 23:45:50,198 INFO L290 TraceCheckUtils]: 34: Hoare triple {105073#false} assume { :end_inline_remove_one } true;havoc main_#t~ret34#1; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 35: Hoare triple {105073#false} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 36: Hoare triple {105073#false} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 37: Hoare triple {105073#false} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 38: Hoare triple {105073#false} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 39: Hoare triple {105073#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 40: Hoare triple {105073#false} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 41: Hoare triple {105073#false} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 42: Hoare triple {105073#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {105073#false} is VALID [2022-02-20 23:45:50,199 INFO L290 TraceCheckUtils]: 43: Hoare triple {105073#false} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {105073#false} is VALID [2022-02-20 23:45:50,200 INFO L290 TraceCheckUtils]: 44: Hoare triple {105073#false} assume !(1 == #valid[main_~cursor~1#1.base]); {105073#false} is VALID [2022-02-20 23:45:50,200 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2022-02-20 23:45:50,200 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 23:45:50,200 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2027466089] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:50,200 INFO L191 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2022-02-20 23:45:50,200 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [5] total 11 [2022-02-20 23:45:50,200 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442957699] [2022-02-20 23:45:50,201 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:50,201 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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 45 [2022-02-20 23:45:50,201 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:50,201 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:45:50,233 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 45 edges. 45 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:50,234 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2022-02-20 23:45:50,234 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:50,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2022-02-20 23:45:50,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:50,234 INFO L87 Difference]: Start difference. First operand 664 states and 846 transitions. Second operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:45:51,178 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:51,179 INFO L93 Difference]: Finished difference Result 634 states and 793 transitions. [2022-02-20 23:45:51,179 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 23:45:51,179 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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 45 [2022-02-20 23:45:51,179 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:51,179 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:45:51,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 315 transitions. [2022-02-20 23:45:51,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:45:51,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 315 transitions. [2022-02-20 23:45:51,182 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 315 transitions. [2022-02-20 23:45:51,385 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 315 edges. 315 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:51,396 INFO L225 Difference]: With dead ends: 634 [2022-02-20 23:45:51,396 INFO L226 Difference]: Without dead ends: 634 [2022-02-20 23:45:51,396 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=62, Invalid=210, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:45:51,397 INFO L933 BasicCegarLoop]: 228 mSDtfsCounter, 280 mSDsluCounter, 1130 mSDsCounter, 0 mSdLazyCounter, 185 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 280 SdHoareTripleChecker+Valid, 1358 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 185 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:51,397 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [280 Valid, 1358 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 185 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 23:45:51,397 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 634 states. [2022-02-20 23:45:51,401 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 634 to 476. [2022-02-20 23:45:51,401 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:51,401 INFO L82 GeneralOperation]: Start isEquivalent. First operand 634 states. Second operand has 476 states, 427 states have (on average 1.3536299765807962) internal successors, (578), 456 states have internal predecessors, (578), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:51,401 INFO L74 IsIncluded]: Start isIncluded. First operand 634 states. Second operand has 476 states, 427 states have (on average 1.3536299765807962) internal successors, (578), 456 states have internal predecessors, (578), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:51,402 INFO L87 Difference]: Start difference. First operand 634 states. Second operand has 476 states, 427 states have (on average 1.3536299765807962) internal successors, (578), 456 states have internal predecessors, (578), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:51,412 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:51,412 INFO L93 Difference]: Finished difference Result 634 states and 793 transitions. [2022-02-20 23:45:51,413 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 793 transitions. [2022-02-20 23:45:51,413 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:51,413 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:51,413 INFO L74 IsIncluded]: Start isIncluded. First operand has 476 states, 427 states have (on average 1.3536299765807962) internal successors, (578), 456 states have internal predecessors, (578), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) Second operand 634 states. [2022-02-20 23:45:51,414 INFO L87 Difference]: Start difference. First operand has 476 states, 427 states have (on average 1.3536299765807962) internal successors, (578), 456 states have internal predecessors, (578), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) Second operand 634 states. [2022-02-20 23:45:51,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:51,424 INFO L93 Difference]: Finished difference Result 634 states and 793 transitions. [2022-02-20 23:45:51,424 INFO L276 IsEmpty]: Start isEmpty. Operand 634 states and 793 transitions. [2022-02-20 23:45:51,425 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:51,425 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:51,425 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:51,425 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:51,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 476 states, 427 states have (on average 1.3536299765807962) internal successors, (578), 456 states have internal predecessors, (578), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:51,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 476 states to 476 states and 602 transitions. [2022-02-20 23:45:51,432 INFO L78 Accepts]: Start accepts. Automaton has 476 states and 602 transitions. Word has length 45 [2022-02-20 23:45:51,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:51,432 INFO L470 AbstractCegarLoop]: Abstraction has 476 states and 602 transitions. [2022-02-20 23:45:51,432 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 5.375) internal successors, (43), 7 states have internal predecessors, (43), 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:45:51,432 INFO L276 IsEmpty]: Start isEmpty. Operand 476 states and 602 transitions. [2022-02-20 23:45:51,432 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2022-02-20 23:45:51,432 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:51,433 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] [2022-02-20 23:45:51,456 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2022-02-20 23:45:51,633 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,SelfDestructingSolverStorable43 [2022-02-20 23:45:51,633 INFO L402 AbstractCegarLoop]: === Iteration 45 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:51,633 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:51,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1377360706, now seen corresponding path program 1 times [2022-02-20 23:45:51,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:51,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1735003038] [2022-02-20 23:45:51,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:51,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:51,656 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:52,163 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:52,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:52,168 INFO L290 TraceCheckUtils]: 0: Hoare triple {107611#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {107611#true} is VALID [2022-02-20 23:45:52,168 INFO L290 TraceCheckUtils]: 1: Hoare triple {107611#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {107611#true} is VALID [2022-02-20 23:45:52,168 INFO L290 TraceCheckUtils]: 2: Hoare triple {107611#true} assume true; {107611#true} is VALID [2022-02-20 23:45:52,169 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {107611#true} {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #306#return; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,170 INFO L290 TraceCheckUtils]: 0: Hoare triple {107611#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(12, 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); {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,170 INFO L290 TraceCheckUtils]: 1: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,171 INFO L290 TraceCheckUtils]: 2: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,171 INFO L290 TraceCheckUtils]: 3: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,172 INFO L290 TraceCheckUtils]: 4: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,172 INFO L290 TraceCheckUtils]: 5: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,172 INFO L272 TraceCheckUtils]: 6: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} call main_#t~ret32#1 := rand_end_point(); {107611#true} is VALID [2022-02-20 23:45:52,172 INFO L290 TraceCheckUtils]: 7: Hoare triple {107611#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {107611#true} is VALID [2022-02-20 23:45:52,172 INFO L290 TraceCheckUtils]: 8: Hoare triple {107611#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {107611#true} is VALID [2022-02-20 23:45:52,173 INFO L290 TraceCheckUtils]: 9: Hoare triple {107611#true} assume true; {107611#true} is VALID [2022-02-20 23:45:52,173 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {107611#true} {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} #306#return; {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:52,176 INFO L290 TraceCheckUtils]: 11: Hoare triple {107613#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= 3 |~#list~0.base|) (= (select |#valid| 3) 1) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {107618#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (or (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (or (and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)))) (or (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)) (and (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,177 INFO L290 TraceCheckUtils]: 12: Hoare triple {107618#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (or (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (or (and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)))) (or (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)) (and (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {107618#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (or (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (or (and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)))) (or (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)) (and (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,178 INFO L290 TraceCheckUtils]: 13: Hoare triple {107618#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (or (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (or (and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)))) (or (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)) (and (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |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; {107619#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (or (and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)))) (or (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)) (and (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (not |ULTIMATE.start_create_item_#t~switch6#1|)))} is VALID [2022-02-20 23:45:52,178 INFO L290 TraceCheckUtils]: 14: Hoare triple {107619#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (or (and (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|)) (not (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)))) (or (= |ULTIMATE.start_create_item_~cursor#1.offset| (+ |~#list~0.offset| 4)) (and (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (or (and (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0)) (not |ULTIMATE.start_create_item_#t~switch6#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; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,179 INFO L290 TraceCheckUtils]: 15: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,179 INFO L290 TraceCheckUtils]: 16: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |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: L677-12 {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,180 INFO L290 TraceCheckUtils]: 17: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,180 INFO L290 TraceCheckUtils]: 18: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short10#1; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,181 INFO L290 TraceCheckUtils]: 19: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#t~short12#1 := create_item_#t~short10#1; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,181 INFO L290 TraceCheckUtils]: 20: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short12#1; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,182 INFO L290 TraceCheckUtils]: 21: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,183 INFO L290 TraceCheckUtils]: 22: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,183 INFO L290 TraceCheckUtils]: 23: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,184 INFO L290 TraceCheckUtils]: 24: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#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: L680 {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,185 INFO L290 TraceCheckUtils]: 25: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,186 INFO L290 TraceCheckUtils]: 26: Hoare triple {107620#(and (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |~#list~0.base|) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {107621#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,186 INFO L290 TraceCheckUtils]: 27: Hoare triple {107621#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {107621#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,187 INFO L290 TraceCheckUtils]: 28: Hoare triple {107621#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {107621#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,187 INFO L290 TraceCheckUtils]: 29: Hoare triple {107621#(and (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_create_item_~cursor#1.base|) (+ |~#list~0.offset| 4)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {107622#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,188 INFO L290 TraceCheckUtils]: 30: Hoare triple {107622#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (not (= |ULTIMATE.start_create_item_~item~0#1.base| |~#list~0.base|)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,188 INFO L290 TraceCheckUtils]: 31: Hoare triple {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,189 INFO L290 TraceCheckUtils]: 32: Hoare triple {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,190 INFO L290 TraceCheckUtils]: 33: Hoare triple {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 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; {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:52,190 INFO L290 TraceCheckUtils]: 34: Hoare triple {107623#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |~#list~0.offset| 0) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_append_one_~list#1.base|) (+ (* ~unnamed2~0~ITEM_NEXT 4) |ULTIMATE.start_append_one_~list#1.offset|)) 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L691-2 {107624#(and (= |ULTIMATE.start_append_one_#t~mem19#1.base| 0) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_#t~mem19#1.offset| 0))} is VALID [2022-02-20 23:45:52,190 INFO L290 TraceCheckUtils]: 35: Hoare triple {107624#(and (= |ULTIMATE.start_append_one_#t~mem19#1.base| 0) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_#t~mem19#1.offset| 0))} assume !(0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset);havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 36: Hoare triple {107612#false} assume { :end_inline_append_one } true;havoc main_#t~ret32#1; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 37: Hoare triple {107612#false} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 38: Hoare triple {107612#false} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 39: Hoare triple {107612#false} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 40: Hoare triple {107612#false} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 41: Hoare triple {107612#false} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 42: Hoare triple {107612#false} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {107612#false} is VALID [2022-02-20 23:45:52,191 INFO L290 TraceCheckUtils]: 43: Hoare triple {107612#false} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {107612#false} is VALID [2022-02-20 23:45:52,192 INFO L290 TraceCheckUtils]: 44: Hoare triple {107612#false} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {107612#false} is VALID [2022-02-20 23:45:52,192 INFO L290 TraceCheckUtils]: 45: Hoare triple {107612#false} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {107612#false} is VALID [2022-02-20 23:45:52,192 INFO L290 TraceCheckUtils]: 46: Hoare triple {107612#false} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {107612#false} is VALID [2022-02-20 23:45:52,192 INFO L290 TraceCheckUtils]: 47: Hoare triple {107612#false} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {107612#false} is VALID [2022-02-20 23:45:52,192 INFO L290 TraceCheckUtils]: 48: Hoare triple {107612#false} assume !(1 == #valid[main_~cursor~1#1.base]); {107612#false} is VALID [2022-02-20 23:45:52,192 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:52,193 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:52,193 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1735003038] [2022-02-20 23:45:52,193 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1735003038] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:52,193 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:52,193 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:45:52,193 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1750916553] [2022-02-20 23:45:52,193 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:52,194 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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 49 [2022-02-20 23:45:52,194 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:52,194 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:45:52,235 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 49 edges. 49 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:52,235 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:52,235 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:52,235 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:52,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=65, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:52,236 INFO L87 Difference]: Start difference. First operand 476 states and 602 transitions. Second operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:45:53,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,706 INFO L93 Difference]: Finished difference Result 674 states and 844 transitions. [2022-02-20 23:45:53,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 23:45:53,706 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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 49 [2022-02-20 23:45:53,706 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:53,706 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:45:53,707 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 321 transitions. [2022-02-20 23:45:53,707 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:45:53,708 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 321 transitions. [2022-02-20 23:45:53,708 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 321 transitions. [2022-02-20 23:45:53,958 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 321 edges. 321 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:53,970 INFO L225 Difference]: With dead ends: 674 [2022-02-20 23:45:53,970 INFO L226 Difference]: Without dead ends: 674 [2022-02-20 23:45:53,971 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=63, Invalid=119, Unknown=0, NotChecked=0, Total=182 [2022-02-20 23:45:53,971 INFO L933 BasicCegarLoop]: 203 mSDtfsCounter, 262 mSDsluCounter, 818 mSDsCounter, 0 mSdLazyCounter, 341 mSolverCounterSat, 47 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 264 SdHoareTripleChecker+Valid, 1021 SdHoareTripleChecker+Invalid, 388 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 47 IncrementalHoareTripleChecker+Valid, 341 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:53,971 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [264 Valid, 1021 Invalid, 388 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [47 Valid, 341 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:53,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 674 states. [2022-02-20 23:45:53,975 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 674 to 498. [2022-02-20 23:45:53,975 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:53,976 INFO L82 GeneralOperation]: Start isEquivalent. First operand 674 states. Second operand has 498 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 478 states have internal predecessors, (601), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:53,976 INFO L74 IsIncluded]: Start isIncluded. First operand 674 states. Second operand has 498 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 478 states have internal predecessors, (601), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:53,976 INFO L87 Difference]: Start difference. First operand 674 states. Second operand has 498 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 478 states have internal predecessors, (601), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:53,989 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:53,989 INFO L93 Difference]: Finished difference Result 674 states and 844 transitions. [2022-02-20 23:45:53,989 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 844 transitions. [2022-02-20 23:45:53,989 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:53,990 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:53,990 INFO L74 IsIncluded]: Start isIncluded. First operand has 498 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 478 states have internal predecessors, (601), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) Second operand 674 states. [2022-02-20 23:45:53,990 INFO L87 Difference]: Start difference. First operand has 498 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 478 states have internal predecessors, (601), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) Second operand 674 states. [2022-02-20 23:45:54,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:54,003 INFO L93 Difference]: Finished difference Result 674 states and 844 transitions. [2022-02-20 23:45:54,003 INFO L276 IsEmpty]: Start isEmpty. Operand 674 states and 844 transitions. [2022-02-20 23:45:54,004 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:54,004 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:54,004 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:54,004 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:54,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 498 states, 449 states have (on average 1.3385300668151447) internal successors, (601), 478 states have internal predecessors, (601), 8 states have call successors, (8), 4 states have call predecessors, (8), 8 states have return successors, (16), 15 states have call predecessors, (16), 8 states have call successors, (16) [2022-02-20 23:45:54,012 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 498 states to 498 states and 625 transitions. [2022-02-20 23:45:54,012 INFO L78 Accepts]: Start accepts. Automaton has 498 states and 625 transitions. Word has length 49 [2022-02-20 23:45:54,013 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:54,013 INFO L470 AbstractCegarLoop]: Abstraction has 498 states and 625 transitions. [2022-02-20 23:45:54,013 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 4.7) internal successors, (47), 10 states have internal predecessors, (47), 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:45:54,013 INFO L276 IsEmpty]: Start isEmpty. Operand 498 states and 625 transitions. [2022-02-20 23:45:54,013 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:45:54,013 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:54,013 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] [2022-02-20 23:45:54,014 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable44 [2022-02-20 23:45:54,014 INFO L402 AbstractCegarLoop]: === Iteration 46 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:54,014 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:54,014 INFO L85 PathProgramCache]: Analyzing trace with hash 399799259, now seen corresponding path program 1 times [2022-02-20 23:45:54,014 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:54,014 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849721995] [2022-02-20 23:45:54,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:54,015 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:54,033 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,213 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:54,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:54,217 INFO L290 TraceCheckUtils]: 0: Hoare triple {110155#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {110155#true} is VALID [2022-02-20 23:45:54,217 INFO L290 TraceCheckUtils]: 1: Hoare triple {110155#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {110155#true} is VALID [2022-02-20 23:45:54,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {110155#true} assume true; {110155#true} is VALID [2022-02-20 23:45:54,218 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {110155#true} {110157#(= |~#list~0.offset| 0)} #306#return; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {110155#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(12, 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); {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,219 INFO L290 TraceCheckUtils]: 1: Hoare triple {110157#(= |~#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,219 INFO L290 TraceCheckUtils]: 2: Hoare triple {110157#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,219 INFO L290 TraceCheckUtils]: 3: Hoare triple {110157#(= |~#list~0.offset| 0)} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,219 INFO L290 TraceCheckUtils]: 4: Hoare triple {110157#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,220 INFO L290 TraceCheckUtils]: 5: Hoare triple {110157#(= |~#list~0.offset| 0)} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,220 INFO L272 TraceCheckUtils]: 6: Hoare triple {110157#(= |~#list~0.offset| 0)} call main_#t~ret32#1 := rand_end_point(); {110155#true} is VALID [2022-02-20 23:45:54,220 INFO L290 TraceCheckUtils]: 7: Hoare triple {110155#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {110155#true} is VALID [2022-02-20 23:45:54,220 INFO L290 TraceCheckUtils]: 8: Hoare triple {110155#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {110155#true} is VALID [2022-02-20 23:45:54,220 INFO L290 TraceCheckUtils]: 9: Hoare triple {110155#true} assume true; {110155#true} is VALID [2022-02-20 23:45:54,221 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {110155#true} {110157#(= |~#list~0.offset| 0)} #306#return; {110157#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:54,221 INFO L290 TraceCheckUtils]: 11: Hoare triple {110157#(= |~#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,222 INFO L290 TraceCheckUtils]: 12: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,222 INFO L290 TraceCheckUtils]: 13: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |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; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,223 INFO L290 TraceCheckUtils]: 14: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |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; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,223 INFO L290 TraceCheckUtils]: 15: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,224 INFO L290 TraceCheckUtils]: 16: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |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: L677-12 {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,224 INFO L290 TraceCheckUtils]: 17: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,224 INFO L290 TraceCheckUtils]: 18: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short10#1; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,225 INFO L290 TraceCheckUtils]: 19: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#t~short12#1 := create_item_#t~short10#1; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,225 INFO L290 TraceCheckUtils]: 20: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short12#1; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,226 INFO L290 TraceCheckUtils]: 21: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,226 INFO L290 TraceCheckUtils]: 22: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,226 INFO L290 TraceCheckUtils]: 23: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,227 INFO L290 TraceCheckUtils]: 24: Hoare triple {110162#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#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: L680 {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,229 INFO L290 TraceCheckUtils]: 28: Hoare triple {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,230 INFO L290 TraceCheckUtils]: 30: Hoare triple {110163#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {110164#(and (= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {110164#(and (= (select |#valid| |ULTIMATE.start_create_item_#res#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,231 INFO L290 TraceCheckUtils]: 32: Hoare triple {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,231 INFO L290 TraceCheckUtils]: 33: Hoare triple {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 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; {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,232 INFO L290 TraceCheckUtils]: 34: Hoare triple {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L691-2 {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,232 INFO L290 TraceCheckUtils]: 35: Hoare triple {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume 0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset;havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:54,233 INFO L290 TraceCheckUtils]: 36: Hoare triple {110165#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= (select |#valid| |ULTIMATE.start_append_one_~item~1#1.base|) 1) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L694 {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,234 INFO L290 TraceCheckUtils]: 37: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume { :end_inline_append_one } true;havoc main_#t~ret32#1; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,234 INFO L290 TraceCheckUtils]: 38: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,234 INFO L290 TraceCheckUtils]: 39: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,235 INFO L290 TraceCheckUtils]: 40: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,235 INFO L290 TraceCheckUtils]: 41: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,236 INFO L290 TraceCheckUtils]: 42: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,236 INFO L290 TraceCheckUtils]: 43: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,236 INFO L290 TraceCheckUtils]: 44: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} is VALID [2022-02-20 23:45:54,237 INFO L290 TraceCheckUtils]: 45: Hoare triple {110166#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4))) 1))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {110167#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 1) (= (* |ULTIMATE.start_main_~end_point~0#1| 4) 4))} is VALID [2022-02-20 23:45:54,237 INFO L290 TraceCheckUtils]: 46: Hoare triple {110167#(and (= |~#list~0.offset| 0) (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 1) (= (* |ULTIMATE.start_main_~end_point~0#1| 4) 4))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {110168#(= (select |#valid| |ULTIMATE.start_main_#t~mem36#1.base|) 1)} is VALID [2022-02-20 23:45:54,238 INFO L290 TraceCheckUtils]: 47: Hoare triple {110168#(= (select |#valid| |ULTIMATE.start_main_#t~mem36#1.base|) 1)} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {110169#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} is VALID [2022-02-20 23:45:54,238 INFO L290 TraceCheckUtils]: 48: Hoare triple {110169#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {110169#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} is VALID [2022-02-20 23:45:54,238 INFO L290 TraceCheckUtils]: 49: Hoare triple {110169#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} assume !(1 == #valid[main_~cursor~1#1.base]); {110156#false} is VALID [2022-02-20 23:45:54,239 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:54,239 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:54,239 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849721995] [2022-02-20 23:45:54,239 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849721995] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:54,239 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:54,239 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2022-02-20 23:45:54,239 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2083981256] [2022-02-20 23:45:54,240 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:54,240 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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 50 [2022-02-20 23:45:54,240 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:54,240 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:45:54,285 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:54,286 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2022-02-20 23:45:54,286 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:54,286 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2022-02-20 23:45:54,286 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=81, Unknown=0, NotChecked=0, Total=110 [2022-02-20 23:45:54,286 INFO L87 Difference]: Start difference. First operand 498 states and 625 transitions. Second operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:45:55,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:55,856 INFO L93 Difference]: Finished difference Result 962 states and 1198 transitions. [2022-02-20 23:45:55,856 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2022-02-20 23:45:55,856 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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 50 [2022-02-20 23:45:55,856 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:55,857 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:45:55,858 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 391 transitions. [2022-02-20 23:45:55,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:45:55,860 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 391 transitions. [2022-02-20 23:45:55,860 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 16 states and 391 transitions. [2022-02-20 23:45:56,153 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 391 edges. 391 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:56,178 INFO L225 Difference]: With dead ends: 962 [2022-02-20 23:45:56,178 INFO L226 Difference]: Without dead ends: 962 [2022-02-20 23:45:56,178 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=137, Invalid=283, Unknown=0, NotChecked=0, Total=420 [2022-02-20 23:45:56,178 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 961 mSDsluCounter, 826 mSDsCounter, 0 mSdLazyCounter, 562 mSolverCounterSat, 44 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 963 SdHoareTripleChecker+Valid, 963 SdHoareTripleChecker+Invalid, 606 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 44 IncrementalHoareTripleChecker+Valid, 562 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:56,178 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [963 Valid, 963 Invalid, 606 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [44 Valid, 562 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 23:45:56,179 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 962 states. [2022-02-20 23:45:56,189 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 962 to 608. [2022-02-20 23:45:56,190 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:56,190 INFO L82 GeneralOperation]: Start isEquivalent. First operand 962 states. Second operand has 608 states, 548 states have (on average 1.332116788321168) internal successors, (730), 579 states have internal predecessors, (730), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:56,191 INFO L74 IsIncluded]: Start isIncluded. First operand 962 states. Second operand has 608 states, 548 states have (on average 1.332116788321168) internal successors, (730), 579 states have internal predecessors, (730), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:56,191 INFO L87 Difference]: Start difference. First operand 962 states. Second operand has 608 states, 548 states have (on average 1.332116788321168) internal successors, (730), 579 states have internal predecessors, (730), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:56,216 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:56,216 INFO L93 Difference]: Finished difference Result 962 states and 1198 transitions. [2022-02-20 23:45:56,216 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1198 transitions. [2022-02-20 23:45:56,217 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:56,217 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:56,217 INFO L74 IsIncluded]: Start isIncluded. First operand has 608 states, 548 states have (on average 1.332116788321168) internal successors, (730), 579 states have internal predecessors, (730), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) Second operand 962 states. [2022-02-20 23:45:56,218 INFO L87 Difference]: Start difference. First operand has 608 states, 548 states have (on average 1.332116788321168) internal successors, (730), 579 states have internal predecessors, (730), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) Second operand 962 states. [2022-02-20 23:45:56,245 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:56,245 INFO L93 Difference]: Finished difference Result 962 states and 1198 transitions. [2022-02-20 23:45:56,246 INFO L276 IsEmpty]: Start isEmpty. Operand 962 states and 1198 transitions. [2022-02-20 23:45:56,246 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:56,246 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:56,246 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:56,246 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:56,247 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 608 states, 548 states have (on average 1.332116788321168) internal successors, (730), 579 states have internal predecessors, (730), 14 states have call successors, (14), 7 states have call predecessors, (14), 14 states have return successors, (28), 21 states have call predecessors, (28), 14 states have call successors, (28) [2022-02-20 23:45:56,257 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 608 states to 608 states and 772 transitions. [2022-02-20 23:45:56,257 INFO L78 Accepts]: Start accepts. Automaton has 608 states and 772 transitions. Word has length 50 [2022-02-20 23:45:56,257 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:56,257 INFO L470 AbstractCegarLoop]: Abstraction has 608 states and 772 transitions. [2022-02-20 23:45:56,257 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 4.8) internal successors, (48), 11 states have internal predecessors, (48), 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:45:56,257 INFO L276 IsEmpty]: Start isEmpty. Operand 608 states and 772 transitions. [2022-02-20 23:45:56,257 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:45:56,258 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:56,258 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] [2022-02-20 23:45:56,258 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable45 [2022-02-20 23:45:56,258 INFO L402 AbstractCegarLoop]: === Iteration 47 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:56,258 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:56,258 INFO L85 PathProgramCache]: Analyzing trace with hash 399799260, now seen corresponding path program 1 times [2022-02-20 23:45:56,259 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:56,259 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [251778111] [2022-02-20 23:45:56,259 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:56,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:56,286 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,522 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:56,524 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:56,526 INFO L290 TraceCheckUtils]: 0: Hoare triple {113686#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {113686#true} is VALID [2022-02-20 23:45:56,526 INFO L290 TraceCheckUtils]: 1: Hoare triple {113686#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {113686#true} is VALID [2022-02-20 23:45:56,526 INFO L290 TraceCheckUtils]: 2: Hoare triple {113686#true} assume true; {113686#true} is VALID [2022-02-20 23:45:56,527 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {113686#true} {113688#(= |~#list~0.offset| 0)} #306#return; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,527 INFO L290 TraceCheckUtils]: 0: Hoare triple {113686#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(12, 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); {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,528 INFO L290 TraceCheckUtils]: 1: Hoare triple {113688#(= |~#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,528 INFO L290 TraceCheckUtils]: 2: Hoare triple {113688#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,528 INFO L290 TraceCheckUtils]: 3: Hoare triple {113688#(= |~#list~0.offset| 0)} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,529 INFO L290 TraceCheckUtils]: 4: Hoare triple {113688#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,529 INFO L290 TraceCheckUtils]: 5: Hoare triple {113688#(= |~#list~0.offset| 0)} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,529 INFO L272 TraceCheckUtils]: 6: Hoare triple {113688#(= |~#list~0.offset| 0)} call main_#t~ret32#1 := rand_end_point(); {113686#true} is VALID [2022-02-20 23:45:56,529 INFO L290 TraceCheckUtils]: 7: Hoare triple {113686#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {113686#true} is VALID [2022-02-20 23:45:56,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {113686#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {113686#true} is VALID [2022-02-20 23:45:56,530 INFO L290 TraceCheckUtils]: 9: Hoare triple {113686#true} assume true; {113686#true} is VALID [2022-02-20 23:45:56,530 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {113686#true} {113688#(= |~#list~0.offset| 0)} #306#return; {113688#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:56,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {113688#(= |~#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,532 INFO L290 TraceCheckUtils]: 12: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |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; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,533 INFO L290 TraceCheckUtils]: 14: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |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; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,533 INFO L290 TraceCheckUtils]: 15: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~switch6#1; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,534 INFO L290 TraceCheckUtils]: 16: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |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: L677-12 {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,534 INFO L290 TraceCheckUtils]: 17: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,535 INFO L290 TraceCheckUtils]: 18: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short10#1; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,535 INFO L290 TraceCheckUtils]: 19: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#t~short12#1 := create_item_#t~short10#1; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,536 INFO L290 TraceCheckUtils]: 20: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short12#1; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,536 INFO L290 TraceCheckUtils]: 21: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,537 INFO L290 TraceCheckUtils]: 22: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,537 INFO L290 TraceCheckUtils]: 23: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,538 INFO L290 TraceCheckUtils]: 24: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#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: L680 {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,538 INFO L290 TraceCheckUtils]: 25: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,539 INFO L290 TraceCheckUtils]: 26: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,539 INFO L290 TraceCheckUtils]: 27: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,540 INFO L290 TraceCheckUtils]: 28: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,540 INFO L290 TraceCheckUtils]: 29: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,541 INFO L290 TraceCheckUtils]: 30: Hoare triple {113693#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_create_item_~item~0#1.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {113694#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} is VALID [2022-02-20 23:45:56,541 INFO L290 TraceCheckUtils]: 31: Hoare triple {113694#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= 8 (select |#length| |ULTIMATE.start_create_item_#res#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (= |ULTIMATE.start_create_item_#res#1.offset| 0))} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,542 INFO L290 TraceCheckUtils]: 32: Hoare triple {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,542 INFO L290 TraceCheckUtils]: 33: Hoare triple {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 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; {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,543 INFO L290 TraceCheckUtils]: 34: Hoare triple {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L691-2 {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,543 INFO L290 TraceCheckUtils]: 35: Hoare triple {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume 0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset;havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:56,544 INFO L290 TraceCheckUtils]: 36: Hoare triple {113695#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |~#list~0.offset| 0) (= |ULTIMATE.start_append_one_~item~1#1.offset| 0) (= (select |#length| |ULTIMATE.start_append_one_~item~1#1.base|) 8) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L694 {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,545 INFO L290 TraceCheckUtils]: 37: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume { :end_inline_append_one } true;havoc main_#t~ret32#1; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,545 INFO L290 TraceCheckUtils]: 38: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,545 INFO L290 TraceCheckUtils]: 39: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,546 INFO L290 TraceCheckUtils]: 40: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,546 INFO L290 TraceCheckUtils]: 41: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,547 INFO L290 TraceCheckUtils]: 42: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,547 INFO L290 TraceCheckUtils]: 43: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,548 INFO L290 TraceCheckUtils]: 44: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} is VALID [2022-02-20 23:45:56,548 INFO L290 TraceCheckUtils]: 45: Hoare triple {113696#(and (= |~#list~0.offset| 0) (= 8 (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ |~#list~0.offset| 4)))) (= 0 (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ |~#list~0.offset| 4))))} assume !(0 != main_#t~nondet35#1);havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_END;main_~direction~0#1 := ~unnamed2~0~ITEM_PREV; {113697#(and (= |~#list~0.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 8) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) 0) (= (* |ULTIMATE.start_main_~end_point~0#1| 4) 4))} is VALID [2022-02-20 23:45:56,549 INFO L290 TraceCheckUtils]: 46: Hoare triple {113697#(and (= |~#list~0.offset| 0) (= (select |#length| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 8) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV) (= (select (select |#memory_$Pointer$.offset| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|)) 0) (= (* |ULTIMATE.start_main_~end_point~0#1| 4) 4))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {113698#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_#t~mem36#1.base|) 8) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:56,549 INFO L290 TraceCheckUtils]: 47: Hoare triple {113698#(and (= |ULTIMATE.start_main_#t~mem36#1.offset| 0) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_#t~mem36#1.base|) 8) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV))} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {113699#(and (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|) 8) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:56,550 INFO L290 TraceCheckUtils]: 48: Hoare triple {113699#(and (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|) 8) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV))} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {113699#(and (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|) 8) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV))} is VALID [2022-02-20 23:45:56,550 INFO L290 TraceCheckUtils]: 49: Hoare triple {113699#(and (= |ULTIMATE.start_main_~cursor~1#1.offset| 0) (<= ~unnamed2~0~ITEM_PREV |ULTIMATE.start_main_~direction~0#1|) (= (select |#length| |ULTIMATE.start_main_~cursor~1#1.base|) 8) (<= |ULTIMATE.start_main_~direction~0#1| ~unnamed2~0~ITEM_PREV))} assume !(4 + (main_~cursor~1#1.offset + 4 * main_~direction~0#1) <= #length[main_~cursor~1#1.base] && 0 <= main_~cursor~1#1.offset + 4 * main_~direction~0#1); {113687#false} is VALID [2022-02-20 23:45:56,551 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:56,551 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:56,551 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [251778111] [2022-02-20 23:45:56,551 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [251778111] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 23:45:56,551 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 23:45:56,551 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2022-02-20 23:45:56,551 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2117100033] [2022-02-20 23:45:56,551 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 23:45:56,552 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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 50 [2022-02-20 23:45:56,552 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 23:45:56,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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:45:56,595 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 50 edges. 50 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:56,595 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2022-02-20 23:45:56,595 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 23:45:56,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2022-02-20 23:45:56,595 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=67, Unknown=0, NotChecked=0, Total=90 [2022-02-20 23:45:56,596 INFO L87 Difference]: Start difference. First operand 608 states and 772 transitions. Second operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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:45:58,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:58,052 INFO L93 Difference]: Finished difference Result 928 states and 1162 transitions. [2022-02-20 23:45:58,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2022-02-20 23:45:58,052 INFO L78 Accepts]: Start accepts. Automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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 50 [2022-02-20 23:45:58,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 23:45:58,053 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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:45:58,054 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 322 transitions. [2022-02-20 23:45:58,054 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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:45:58,055 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 322 transitions. [2022-02-20 23:45:58,055 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 12 states and 322 transitions. [2022-02-20 23:45:58,307 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 322 edges. 322 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 23:45:58,330 INFO L225 Difference]: With dead ends: 928 [2022-02-20 23:45:58,330 INFO L226 Difference]: Without dead ends: 928 [2022-02-20 23:45:58,330 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 20 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=90, Invalid=182, Unknown=0, NotChecked=0, Total=272 [2022-02-20 23:45:58,330 INFO L933 BasicCegarLoop]: 137 mSDtfsCounter, 966 mSDsluCounter, 600 mSDsCounter, 0 mSdLazyCounter, 388 mSolverCounterSat, 37 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 966 SdHoareTripleChecker+Valid, 737 SdHoareTripleChecker+Invalid, 425 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 37 IncrementalHoareTripleChecker+Valid, 388 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2022-02-20 23:45:58,330 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [966 Valid, 737 Invalid, 425 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [37 Valid, 388 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2022-02-20 23:45:58,331 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 928 states. [2022-02-20 23:45:58,336 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 928 to 707. [2022-02-20 23:45:58,336 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 23:45:58,337 INFO L82 GeneralOperation]: Start isEquivalent. First operand 928 states. Second operand has 707 states, 639 states have (on average 1.3364632237871674) internal successors, (854), 672 states have internal predecessors, (854), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) [2022-02-20 23:45:58,337 INFO L74 IsIncluded]: Start isIncluded. First operand 928 states. Second operand has 707 states, 639 states have (on average 1.3364632237871674) internal successors, (854), 672 states have internal predecessors, (854), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) [2022-02-20 23:45:58,338 INFO L87 Difference]: Start difference. First operand 928 states. Second operand has 707 states, 639 states have (on average 1.3364632237871674) internal successors, (854), 672 states have internal predecessors, (854), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) [2022-02-20 23:45:58,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:58,361 INFO L93 Difference]: Finished difference Result 928 states and 1162 transitions. [2022-02-20 23:45:58,361 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1162 transitions. [2022-02-20 23:45:58,362 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:58,362 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:58,363 INFO L74 IsIncluded]: Start isIncluded. First operand has 707 states, 639 states have (on average 1.3364632237871674) internal successors, (854), 672 states have internal predecessors, (854), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) Second operand 928 states. [2022-02-20 23:45:58,363 INFO L87 Difference]: Start difference. First operand has 707 states, 639 states have (on average 1.3364632237871674) internal successors, (854), 672 states have internal predecessors, (854), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) Second operand 928 states. [2022-02-20 23:45:58,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 23:45:58,386 INFO L93 Difference]: Finished difference Result 928 states and 1162 transitions. [2022-02-20 23:45:58,386 INFO L276 IsEmpty]: Start isEmpty. Operand 928 states and 1162 transitions. [2022-02-20 23:45:58,387 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 23:45:58,387 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 23:45:58,387 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 23:45:58,387 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 23:45:58,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 707 states, 639 states have (on average 1.3364632237871674) internal successors, (854), 672 states have internal predecessors, (854), 18 states have call successors, (18), 9 states have call predecessors, (18), 18 states have return successors, (36), 25 states have call predecessors, (36), 18 states have call successors, (36) [2022-02-20 23:45:58,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 707 states to 707 states and 908 transitions. [2022-02-20 23:45:58,401 INFO L78 Accepts]: Start accepts. Automaton has 707 states and 908 transitions. Word has length 50 [2022-02-20 23:45:58,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 23:45:58,402 INFO L470 AbstractCegarLoop]: Abstraction has 707 states and 908 transitions. [2022-02-20 23:45:58,402 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 9 states have (on average 5.333333333333333) internal successors, (48), 10 states have internal predecessors, (48), 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:45:58,402 INFO L276 IsEmpty]: Start isEmpty. Operand 707 states and 908 transitions. [2022-02-20 23:45:58,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2022-02-20 23:45:58,402 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 23:45:58,403 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] [2022-02-20 23:45:58,403 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable46 [2022-02-20 23:45:58,403 INFO L402 AbstractCegarLoop]: === Iteration 48 === Targeting ULTIMATE.startErr59REQUIRES_VIOLATION === [ULTIMATE.startErr0REQUIRES_VIOLATION, ULTIMATE.startErr1REQUIRES_VIOLATION, ULTIMATE.startErr2REQUIRES_VIOLATION, ULTIMATE.startErr3REQUIRES_VIOLATION (and 61 more)] === [2022-02-20 23:45:58,403 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 23:45:58,403 INFO L85 PathProgramCache]: Analyzing trace with hash 397952217, now seen corresponding path program 1 times [2022-02-20 23:45:58,403 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 23:45:58,403 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [571579801] [2022-02-20 23:45:58,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:58,404 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 23:45:58,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,689 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 6 [2022-02-20 23:45:58,691 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,693 INFO L290 TraceCheckUtils]: 0: Hoare triple {117207#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {117207#true} is VALID [2022-02-20 23:45:58,694 INFO L290 TraceCheckUtils]: 1: Hoare triple {117207#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {117207#true} is VALID [2022-02-20 23:45:58,694 INFO L290 TraceCheckUtils]: 2: Hoare triple {117207#true} assume true; {117207#true} is VALID [2022-02-20 23:45:58,694 INFO L284 TraceCheckUtils]: 3: Hoare quadruple {117207#true} {117209#(= |~#list~0.offset| 0)} #306#return; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,695 INFO L290 TraceCheckUtils]: 0: Hoare triple {117207#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(12, 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); {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,695 INFO L290 TraceCheckUtils]: 1: Hoare triple {117209#(= |~#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~nondet31#1, main_#t~ret34#1, main_#t~nondet33#1, main_#t~nondet30#1, main_#t~nondet35#1, main_#t~mem36#1.base, main_#t~mem36#1.offset, main_#t~mem37#1.base, main_#t~mem37#1.offset, main_~next~1#1.base, main_~next~1#1.offset, main_~end_point~0#1, main_~direction~0#1, main_~cursor~1#1.base, main_~cursor~1#1.offset; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,695 INFO L290 TraceCheckUtils]: 2: Hoare triple {117209#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,696 INFO L290 TraceCheckUtils]: 3: Hoare triple {117209#(= |~#list~0.offset| 0)} assume !!(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,696 INFO L290 TraceCheckUtils]: 4: Hoare triple {117209#(= |~#list~0.offset| 0)} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,696 INFO L290 TraceCheckUtils]: 5: Hoare triple {117209#(= |~#list~0.offset| 0)} assume !!(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,696 INFO L272 TraceCheckUtils]: 6: Hoare triple {117209#(= |~#list~0.offset| 0)} call main_#t~ret32#1 := rand_end_point(); {117207#true} is VALID [2022-02-20 23:45:58,696 INFO L290 TraceCheckUtils]: 7: Hoare triple {117207#true} assume -2147483648 <= #t~nondet29 && #t~nondet29 <= 2147483647; {117207#true} is VALID [2022-02-20 23:45:58,697 INFO L290 TraceCheckUtils]: 8: Hoare triple {117207#true} assume 0 != #t~nondet29;havoc #t~nondet29;#res := ~unnamed1~0~LIST_BEG; {117207#true} is VALID [2022-02-20 23:45:58,697 INFO L290 TraceCheckUtils]: 9: Hoare triple {117207#true} assume true; {117207#true} is VALID [2022-02-20 23:45:58,697 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {117207#true} {117209#(= |~#list~0.offset| 0)} #306#return; {117209#(= |~#list~0.offset| 0)} is VALID [2022-02-20 23:45:58,698 INFO L290 TraceCheckUtils]: 11: Hoare triple {117209#(= |~#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~ret17#1.base, append_one_#t~ret17#1.offset, append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset, append_one_#t~mem19#1.base, append_one_#t~mem19#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~mem13#1.base, create_item_#t~mem13#1.offset, 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~nondet11#1, create_item_#t~short12#1, create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset, create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_#t~mem15#1.base, create_item_#t~mem15#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_~link~0#1.base, create_item_~link~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(8);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; {117214#(and (or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (<= |~#list~0.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:58,699 INFO L290 TraceCheckUtils]: 12: Hoare triple {117214#(and (or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (<= |~#list~0.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} assume !(create_item_~item~0#1.base == 0 && create_item_~item~0#1.offset == 0); {117214#(and (or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (<= |~#list~0.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= |ULTIMATE.start_append_one_~list#1.offset| 0))} is VALID [2022-02-20 23:45:58,700 INFO L290 TraceCheckUtils]: 13: Hoare triple {117214#(and (or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (<= |~#list~0.offset| 0)) (not (= |ULTIMATE.start_create_item_~at#1| 0))) (= |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; {117215#(or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0)) (not |ULTIMATE.start_create_item_#t~switch6#1|))} is VALID [2022-02-20 23:45:58,700 INFO L290 TraceCheckUtils]: 14: Hoare triple {117215#(or (and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0)) (not |ULTIMATE.start_create_item_#t~switch6#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; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,701 INFO L290 TraceCheckUtils]: 15: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} havoc create_item_#t~switch6#1; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,702 INFO L290 TraceCheckUtils]: 16: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.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: L677-12 {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,702 INFO L290 TraceCheckUtils]: 17: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} create_item_#t~short10#1 := create_item_#t~mem8#1.base != 0 || create_item_#t~mem8#1.offset != 0; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,703 INFO L290 TraceCheckUtils]: 18: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} assume !create_item_#t~short10#1; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,703 INFO L290 TraceCheckUtils]: 19: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} create_item_#t~short12#1 := create_item_#t~short10#1; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,704 INFO L290 TraceCheckUtils]: 20: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} assume !create_item_#t~short12#1; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,704 INFO L290 TraceCheckUtils]: 21: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} assume !create_item_#t~short12#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;havoc create_item_#t~nondet11#1;havoc create_item_#t~short12#1; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,705 INFO L290 TraceCheckUtils]: 22: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} SUMMARY for call create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset := read~$Pointer$(create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L677-13 {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,705 INFO L290 TraceCheckUtils]: 23: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} create_item_~link~0#1.base, create_item_~link~0#1.offset := create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset;havoc create_item_#t~mem14#1.base, create_item_#t~mem14#1.offset; {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,706 INFO L290 TraceCheckUtils]: 24: Hoare triple {117216#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.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: L680 {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,707 INFO L290 TraceCheckUtils]: 25: Hoare triple {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0);create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset := 0, 0; {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,708 INFO L290 TraceCheckUtils]: 26: Hoare triple {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} SUMMARY for call write~$Pointer$(create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset, create_item_~item~0#1.base, create_item_~item~0#1.offset + 4 * create_item_~term_field~0#1, 4); srcloc: L681-3 {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,708 INFO L290 TraceCheckUtils]: 27: Hoare triple {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} havoc create_item_#t~ite16#1.base, create_item_#t~ite16#1.offset;havoc create_item_#t~mem15#1.base, create_item_#t~mem15#1.offset; {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,709 INFO L290 TraceCheckUtils]: 28: Hoare triple {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} assume !(create_item_~link~0#1.base != 0 || create_item_~link~0#1.offset != 0); {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,710 INFO L290 TraceCheckUtils]: 29: Hoare triple {117217#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_create_item_~cursor#1.offset| 0) (= |ULTIMATE.start_create_item_~cursor#1.base| |ULTIMATE.start_append_one_~list#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} SUMMARY for call write~$Pointer$(create_item_~item~0#1.base, create_item_~item~0#1.offset, create_item_~cursor#1.base, create_item_~cursor#1.offset, 4); srcloc: L682-1 {117218#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0) |ULTIMATE.start_create_item_~item~0#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,710 INFO L290 TraceCheckUtils]: 30: Hoare triple {117218#(and (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0) |ULTIMATE.start_create_item_~item~0#1.base|) (= 1 (select |#valid| |ULTIMATE.start_create_item_~item~0#1.base|)) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} create_item_#res#1.base, create_item_#res#1.offset := create_item_~item~0#1.base, create_item_~item~0#1.offset; {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,711 INFO L290 TraceCheckUtils]: 31: Hoare triple {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} append_one_#t~ret17#1.base, append_one_#t~ret17#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~ret17#1.base, append_one_#t~ret17#1.offset;havoc append_one_#t~ret17#1.base, append_one_#t~ret17#1.offset; {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,712 INFO L290 TraceCheckUtils]: 32: Hoare triple {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} SUMMARY for call append_one_#t~mem18#1.base, append_one_#t~mem18#1.offset := read~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset + 4 * ~unnamed2~0~ITEM_PREV, 4); srcloc: L691 {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,712 INFO L290 TraceCheckUtils]: 33: Hoare triple {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 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; {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,713 INFO L290 TraceCheckUtils]: 34: Hoare triple {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} SUMMARY for call append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset := read~$Pointer$(append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed2~0~ITEM_NEXT, 4); srcloc: L691-2 {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,713 INFO L290 TraceCheckUtils]: 35: Hoare triple {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} assume 0 == append_one_#t~mem19#1.base && 0 == append_one_#t~mem19#1.offset;havoc append_one_#t~mem19#1.base, append_one_#t~mem19#1.offset; {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,714 INFO L290 TraceCheckUtils]: 36: Hoare triple {117219#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_append_one_~list#1.base|) 0)) 1) (= |ULTIMATE.start_append_one_~list#1.base| |~#list~0.base|) (= |ULTIMATE.start_append_one_~list#1.offset| 0) (<= |~#list~0.offset| 0))} SUMMARY for call write~$Pointer$(append_one_~item~1#1.base, append_one_~item~1#1.offset, append_one_~list#1.base, append_one_~list#1.offset + 4 * ~unnamed1~0~LIST_END, 4); srcloc: L694 {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,715 INFO L290 TraceCheckUtils]: 37: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume { :end_inline_append_one } true;havoc main_#t~ret32#1; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,715 INFO L290 TraceCheckUtils]: 38: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet31#1 && main_#t~nondet31#1 <= 2147483647; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,716 INFO L290 TraceCheckUtils]: 39: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet31#1);havoc main_#t~nondet31#1; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,716 INFO L290 TraceCheckUtils]: 40: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet33#1 && main_#t~nondet33#1 <= 2147483647; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,717 INFO L290 TraceCheckUtils]: 41: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet33#1);havoc main_#t~nondet33#1; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,718 INFO L290 TraceCheckUtils]: 42: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume -2147483648 <= main_#t~nondet30#1 && main_#t~nondet30#1 <= 2147483647; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,718 INFO L290 TraceCheckUtils]: 43: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume !(0 != main_#t~nondet30#1);havoc main_#t~nondet30#1; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,719 INFO L290 TraceCheckUtils]: 44: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} havoc main_~end_point~0#1;havoc main_~direction~0#1;assume -2147483648 <= main_#t~nondet35#1 && main_#t~nondet35#1 <= 2147483647; {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} is VALID [2022-02-20 23:45:58,719 INFO L290 TraceCheckUtils]: 45: Hoare triple {117220#(and (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) 0)) 1) (<= |~#list~0.offset| 0))} assume 0 != main_#t~nondet35#1;havoc main_#t~nondet35#1;main_~end_point~0#1 := ~unnamed1~0~LIST_BEG;main_~direction~0#1 := ~unnamed2~0~ITEM_NEXT; {117221#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 1) (and (= |ULTIMATE.start_main_~end_point~0#1| 0) (not (= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) 0)) (<= |~#list~0.offset| 0)))} is VALID [2022-02-20 23:45:58,720 INFO L290 TraceCheckUtils]: 46: Hoare triple {117221#(or (= (select |#valid| (select (select |#memory_$Pointer$.base| |~#list~0.base|) (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|))) 1) (and (= |ULTIMATE.start_main_~end_point~0#1| 0) (not (= (+ (* |ULTIMATE.start_main_~end_point~0#1| 4) |~#list~0.offset|) 0)) (<= |~#list~0.offset| 0)))} SUMMARY for call main_#t~mem36#1.base, main_#t~mem36#1.offset := read~$Pointer$(~#list~0.base, ~#list~0.offset + 4 * main_~end_point~0#1, 4); srcloc: L731-2 {117222#(= (select |#valid| |ULTIMATE.start_main_#t~mem36#1.base|) 1)} is VALID [2022-02-20 23:45:58,721 INFO L290 TraceCheckUtils]: 47: Hoare triple {117222#(= (select |#valid| |ULTIMATE.start_main_#t~mem36#1.base|) 1)} main_~cursor~1#1.base, main_~cursor~1#1.offset := main_#t~mem36#1.base, main_#t~mem36#1.offset;havoc main_#t~mem36#1.base, main_#t~mem36#1.offset; {117223#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} is VALID [2022-02-20 23:45:58,721 INFO L290 TraceCheckUtils]: 48: Hoare triple {117223#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} assume !!(main_~cursor~1#1.base != 0 || main_~cursor~1#1.offset != 0); {117223#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} is VALID [2022-02-20 23:45:58,722 INFO L290 TraceCheckUtils]: 49: Hoare triple {117223#(= (select |#valid| |ULTIMATE.start_main_~cursor~1#1.base|) 1)} assume !(1 == #valid[main_~cursor~1#1.base]); {117208#false} is VALID [2022-02-20 23:45:58,722 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 23:45:58,722 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 23:45:58,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [571579801] [2022-02-20 23:45:58,723 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [571579801] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 23:45:58,723 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [206328397] [2022-02-20 23:45:58,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 23:45:58,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 23:45:58,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 23:45:58,733 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:45:58,735 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:45:58,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,823 INFO L263 TraceCheckSpWp]: Trace formula consists of 270 conjuncts, 47 conjunts are in the unsatisfiable core [2022-02-20 23:45:58,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 23:45:58,838 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 23:45:58,921 INFO L356 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2022-02-20 23:45:58,921 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2022-02-20 23:45:59,172 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 23:45:59,176 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 11 [2022-02-20 23:45:59,234 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:45:59,244 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 20 [2022-02-20 23:45:59,362 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7