./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i --full-output -ea --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability 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/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-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 ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:56:22,135 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:56:22,140 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:56:22,162 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:56:22,164 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:56:22,167 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:56:22,169 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:56:22,175 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:56:22,176 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:56:22,180 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:56:22,181 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:56:22,182 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:56:22,182 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:56:22,185 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:56:22,186 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:56:22,188 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:56:22,189 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:56:22,189 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:56:22,193 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:56:22,194 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:56:22,196 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:56:22,198 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:56:22,199 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:56:22,200 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:56:22,202 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:56:22,203 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:56:22,204 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:56:22,204 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:56:22,205 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:56:22,206 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:56:22,206 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:56:22,207 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:56:22,208 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:56:22,209 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:56:22,210 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:56:22,210 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:56:22,210 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:56:22,211 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:56:22,211 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:56:22,211 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:56:22,212 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:56:22,212 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2022-02-20 16:56:22,231 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:56:22,236 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:56:22,236 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:56:22,236 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:56:22,237 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:56:22,237 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:56:22,238 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:56:22,238 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:56:22,238 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:56:22,238 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:56:22,239 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:56:22,239 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:56:22,239 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:56:22,239 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:56:22,239 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:56:22,240 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:56:22,240 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:56:22,240 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:56:22,240 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:56:22,240 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:56:22,240 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:56:22,241 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:56:22,241 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:56:22,241 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:56:22,241 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:22,241 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:56:22,241 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:56:22,241 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:56:22,242 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:56:22,242 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:56:22,242 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:56:22,242 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:56:22,242 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:56:22,242 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 ! call(reach_error())) ) 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-02-20 16:56:22,441 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:56:22,466 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:56:22,467 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:56:22,470 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:56:22,471 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:56:22,472 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-02-20 16:56:22,537 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7e105f7/1a20699a229e41e487a1dfadace1d987/FLAG6b111d679 [2022-02-20 16:56:23,008 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:56:23,009 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-02-20 16:56:23,017 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7e105f7/1a20699a229e41e487a1dfadace1d987/FLAG6b111d679 [2022-02-20 16:56:23,336 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/1f7e105f7/1a20699a229e41e487a1dfadace1d987 [2022-02-20 16:56:23,338 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:56:23,340 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:56:23,342 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:23,343 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:56:23,345 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:56:23,346 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,348 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1254b3a1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23, skipping insertion in model container [2022-02-20 16:56:23,348 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,353 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:56:23,386 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:56:23,578 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-02-20 16:56:23,580 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:23,584 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:56:23,636 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-02-20 16:56:23,645 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:23,668 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:56:23,669 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23 WrapperNode [2022-02-20 16:56:23,669 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:23,670 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:23,670 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:56:23,670 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:56:23,675 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,696 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,718 INFO L137 Inliner]: procedures = 127, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 119 [2022-02-20 16:56:23,718 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:23,718 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:56:23,719 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:56:23,719 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:56:23,723 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,723 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,725 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,726 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,731 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,733 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,741 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,747 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:56:23,752 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:56:23,752 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:56:23,752 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:56:23,753 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (1/1) ... [2022-02-20 16:56:23,757 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:23,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:23,777 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 16:56:23,782 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 16:56:23,807 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:56:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:56:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:56:23,808 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:56:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:56:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:56:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:56:23,808 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:56:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:56:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:56:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:56:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:56:23,809 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:56:23,809 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:56:23,875 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:56:23,876 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:56:24,077 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:56:24,082 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:56:24,083 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:56:24,084 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:24 BoogieIcfgContainer [2022-02-20 16:56:24,084 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:56:24,085 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:56:24,085 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:56:24,088 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:56:24,088 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:56:23" (1/3) ... [2022-02-20 16:56:24,088 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d670ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:24, skipping insertion in model container [2022-02-20 16:56:24,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:23" (2/3) ... [2022-02-20 16:56:24,089 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@11d670ee and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:24, skipping insertion in model container [2022-02-20 16:56:24,089 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:24" (3/3) ... [2022-02-20 16:56:24,090 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-02-20 16:56:24,093 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:56:24,094 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:56:24,122 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:56:24,128 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:56:24,128 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:56:24,142 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 16:56:24,146 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:56:24,148 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:24,148 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:24,149 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:24,171 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:24,171 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-02-20 16:56:24,178 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:24,178 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2032124710] [2022-02-20 16:56:24,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:24,179 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:24,298 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:24,386 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 16:56:24,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:24,429 INFO L290 TraceCheckUtils]: 0: Hoare triple {40#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {33#true} is VALID [2022-02-20 16:56:24,429 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {33#true} is VALID [2022-02-20 16:56:24,430 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {33#true} is VALID [2022-02-20 16:56:24,430 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 16:56:24,431 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {33#true} {34#false} #99#return; {34#false} is VALID [2022-02-20 16:56:24,431 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#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(21, 2); {33#true} is VALID [2022-02-20 16:56:24,432 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {33#true} is VALID [2022-02-20 16:56:24,433 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:56:24,433 INFO L290 TraceCheckUtils]: 3: Hoare triple {34#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {34#false} is VALID [2022-02-20 16:56:24,434 INFO L290 TraceCheckUtils]: 4: Hoare triple {34#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {34#false} is VALID [2022-02-20 16:56:24,434 INFO L272 TraceCheckUtils]: 5: Hoare triple {34#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {40#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:24,435 INFO L290 TraceCheckUtils]: 6: Hoare triple {40#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {33#true} is VALID [2022-02-20 16:56:24,435 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {33#true} is VALID [2022-02-20 16:56:24,436 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {33#true} is VALID [2022-02-20 16:56:24,436 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 16:56:24,436 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#true} {34#false} #99#return; {34#false} is VALID [2022-02-20 16:56:24,436 INFO L290 TraceCheckUtils]: 11: Hoare triple {34#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {34#false} is VALID [2022-02-20 16:56:24,436 INFO L290 TraceCheckUtils]: 12: Hoare triple {34#false} assume !true; {34#false} is VALID [2022-02-20 16:56:24,437 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {34#false} is VALID [2022-02-20 16:56:24,437 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {34#false} is VALID [2022-02-20 16:56:24,437 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {34#false} is VALID [2022-02-20 16:56:24,437 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {34#false} is VALID [2022-02-20 16:56:24,438 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume main_~count~0#1 != 1 + main_~len~0#1; {34#false} is VALID [2022-02-20 16:56:24,438 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:56:24,438 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 16:56:24,438 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:24,439 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2032124710] [2022-02-20 16:56:24,439 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2032124710] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:24,439 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:24,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:56:24,442 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [817379608] [2022-02-20 16:56:24,443 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:24,447 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:24,448 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:24,451 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:24,477 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:24,477 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:56:24,477 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:24,495 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:56:24,496 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:56:24,499 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:24,638 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:24,639 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-02-20 16:56:24,639 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:56:24,639 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:24,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:24,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:24,646 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-20 16:56:24,649 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:24,651 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 75 transitions. [2022-02-20 16:56:24,654 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 75 transitions. [2022-02-20 16:56:24,721 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:24,729 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:56:24,729 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:56:24,734 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 16:56:24,738 INFO L933 BasicCegarLoop]: 36 mSDtfsCounter, 0 mSDsluCounter, 19 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 55 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:24,739 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 55 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:24,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:56:24,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:56:24,759 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:24,760 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:24,760 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:24,761 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:24,766 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:24,766 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 16:56:24,766 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:56:24,767 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:24,767 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:24,770 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 24 states. [2022-02-20 16:56:24,771 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 24 states. [2022-02-20 16:56:24,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:24,781 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 16:56:24,782 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:56:24,782 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:24,782 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:24,782 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:24,782 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:24,785 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:24,787 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 16:56:24,789 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-02-20 16:56:24,789 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:24,789 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 16:56:24,789 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:24,790 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:56:24,790 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:56:24,790 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:24,790 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:24,791 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:56:24,791 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:24,792 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:24,793 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-02-20 16:56:24,793 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:24,793 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1709228408] [2022-02-20 16:56:24,793 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:24,793 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:24,839 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:24,884 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 5 [2022-02-20 16:56:24,893 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:24,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {205#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {197#true} is VALID [2022-02-20 16:56:24,903 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {197#true} is VALID [2022-02-20 16:56:24,903 INFO L290 TraceCheckUtils]: 2: Hoare triple {197#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {197#true} is VALID [2022-02-20 16:56:24,903 INFO L290 TraceCheckUtils]: 3: Hoare triple {197#true} assume true; {197#true} is VALID [2022-02-20 16:56:24,903 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {197#true} {198#false} #99#return; {198#false} is VALID [2022-02-20 16:56:24,903 INFO L290 TraceCheckUtils]: 0: Hoare triple {197#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(21, 2); {197#true} is VALID [2022-02-20 16:56:24,904 INFO L290 TraceCheckUtils]: 1: Hoare triple {197#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {199#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:24,905 INFO L290 TraceCheckUtils]: 2: Hoare triple {199#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !(sll_create_~len#1 > 0); {198#false} is VALID [2022-02-20 16:56:24,905 INFO L290 TraceCheckUtils]: 3: Hoare triple {198#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {198#false} is VALID [2022-02-20 16:56:24,905 INFO L290 TraceCheckUtils]: 4: Hoare triple {198#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {198#false} is VALID [2022-02-20 16:56:24,905 INFO L272 TraceCheckUtils]: 5: Hoare triple {198#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {205#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:24,905 INFO L290 TraceCheckUtils]: 6: Hoare triple {205#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {197#true} is VALID [2022-02-20 16:56:24,905 INFO L290 TraceCheckUtils]: 7: Hoare triple {197#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {197#true} is VALID [2022-02-20 16:56:24,905 INFO L290 TraceCheckUtils]: 8: Hoare triple {197#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {197#true} is VALID [2022-02-20 16:56:24,906 INFO L290 TraceCheckUtils]: 9: Hoare triple {197#true} assume true; {197#true} is VALID [2022-02-20 16:56:24,906 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {197#true} {198#false} #99#return; {198#false} is VALID [2022-02-20 16:56:24,906 INFO L290 TraceCheckUtils]: 11: Hoare triple {198#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {198#false} is VALID [2022-02-20 16:56:24,906 INFO L290 TraceCheckUtils]: 12: Hoare triple {198#false} assume !(sll_insert_~index#1 > 0); {198#false} is VALID [2022-02-20 16:56:24,906 INFO L290 TraceCheckUtils]: 13: Hoare triple {198#false} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {198#false} is VALID [2022-02-20 16:56:24,906 INFO L290 TraceCheckUtils]: 14: Hoare triple {198#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {198#false} is VALID [2022-02-20 16:56:24,907 INFO L290 TraceCheckUtils]: 15: Hoare triple {198#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {198#false} is VALID [2022-02-20 16:56:24,907 INFO L290 TraceCheckUtils]: 16: Hoare triple {198#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {198#false} is VALID [2022-02-20 16:56:24,907 INFO L290 TraceCheckUtils]: 17: Hoare triple {198#false} assume main_~count~0#1 != 1 + main_~len~0#1; {198#false} is VALID [2022-02-20 16:56:24,907 INFO L290 TraceCheckUtils]: 18: Hoare triple {198#false} assume !false; {198#false} is VALID [2022-02-20 16:56:24,907 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:24,908 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:24,908 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1709228408] [2022-02-20 16:56:24,908 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1709228408] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:24,908 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:24,908 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:56:24,908 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [933465769] [2022-02-20 16:56:24,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:24,909 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:24,910 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:24,910 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:24,930 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:24,930 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:56:24,930 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:24,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:56:24,931 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:56:24,931 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:25,014 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:25,015 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-20 16:56:25,015 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:25,015 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:25,015 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:25,016 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:25,018 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 16:56:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:25,021 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 56 transitions. [2022-02-20 16:56:25,021 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 56 transitions. [2022-02-20 16:56:25,067 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:25,069 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:56:25,069 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:56:25,069 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:56:25,070 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 2 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 22 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 25 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 22 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:25,071 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 64 Invalid, 25 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 22 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:25,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:56:25,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:56:25,074 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:25,074 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:25,075 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:25,075 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:25,076 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:25,077 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:56:25,077 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:56:25,077 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:25,077 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:25,077 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-02-20 16:56:25,078 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-02-20 16:56:25,079 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:25,079 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:56:25,079 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:56:25,080 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:25,080 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:25,080 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:25,080 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:25,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:25,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-02-20 16:56:25,081 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-02-20 16:56:25,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:25,081 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-02-20 16:56:25,082 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 4.25) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:25,082 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 16:56:25,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:56:25,082 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:25,083 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:25,083 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:56:25,083 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:25,086 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:25,087 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-02-20 16:56:25,087 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:25,087 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1151573994] [2022-02-20 16:56:25,087 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:25,087 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:25,133 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:25,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 16:56:25,209 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:25,229 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,230 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,230 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,230 INFO L290 TraceCheckUtils]: 3: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,231 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {360#true} {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} #97#return; {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:25,231 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 14 [2022-02-20 16:56:25,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:25,242 INFO L290 TraceCheckUtils]: 0: Hoare triple {374#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,243 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,243 INFO L290 TraceCheckUtils]: 2: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,243 INFO L290 TraceCheckUtils]: 3: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,243 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {360#true} {361#false} #99#return; {361#false} is VALID [2022-02-20 16:56:25,243 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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(21, 2); {360#true} is VALID [2022-02-20 16:56:25,244 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:25,244 INFO L290 TraceCheckUtils]: 2: Hoare triple {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} assume !!(sll_create_~len#1 > 0); {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:25,245 INFO L272 TraceCheckUtils]: 3: Hoare triple {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {374#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:25,245 INFO L290 TraceCheckUtils]: 4: Hoare triple {374#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,245 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,246 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,246 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,247 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {360#true} {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} #97#return; {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:25,247 INFO L290 TraceCheckUtils]: 9: Hoare triple {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} is VALID [2022-02-20 16:56:25,247 INFO L290 TraceCheckUtils]: 10: Hoare triple {362#(= (+ (- 2) |ULTIMATE.start_sll_create_~len#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {368#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,248 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {361#false} is VALID [2022-02-20 16:56:25,248 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {361#false} is VALID [2022-02-20 16:56:25,248 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {361#false} is VALID [2022-02-20 16:56:25,248 INFO L272 TraceCheckUtils]: 14: Hoare triple {361#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {374#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:25,248 INFO L290 TraceCheckUtils]: 15: Hoare triple {374#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,249 INFO L290 TraceCheckUtils]: 16: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,249 INFO L290 TraceCheckUtils]: 17: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,249 INFO L290 TraceCheckUtils]: 18: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,249 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {360#true} {361#false} #99#return; {361#false} is VALID [2022-02-20 16:56:25,249 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {361#false} is VALID [2022-02-20 16:56:25,249 INFO L290 TraceCheckUtils]: 21: Hoare triple {361#false} assume !(sll_insert_~index#1 > 0); {361#false} is VALID [2022-02-20 16:56:25,250 INFO L290 TraceCheckUtils]: 22: Hoare triple {361#false} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {361#false} is VALID [2022-02-20 16:56:25,250 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {361#false} is VALID [2022-02-20 16:56:25,250 INFO L290 TraceCheckUtils]: 24: Hoare triple {361#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {361#false} is VALID [2022-02-20 16:56:25,250 INFO L290 TraceCheckUtils]: 25: Hoare triple {361#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {361#false} is VALID [2022-02-20 16:56:25,250 INFO L290 TraceCheckUtils]: 26: Hoare triple {361#false} assume main_~count~0#1 != 1 + main_~len~0#1; {361#false} is VALID [2022-02-20 16:56:25,250 INFO L290 TraceCheckUtils]: 27: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 16:56:25,251 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:56:25,251 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:25,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1151573994] [2022-02-20 16:56:25,251 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1151573994] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:25,251 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406835053] [2022-02-20 16:56:25,251 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:25,252 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:25,252 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:25,287 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 16:56:25,303 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 16:56:25,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:25,398 INFO L263 TraceCheckSpWp]: Trace formula consists of 259 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:56:25,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:25,428 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:25,568 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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(21, 2); {360#true} is VALID [2022-02-20 16:56:25,569 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,570 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0); {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,570 INFO L272 TraceCheckUtils]: 3: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {360#true} is VALID [2022-02-20 16:56:25,570 INFO L290 TraceCheckUtils]: 4: Hoare triple {360#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,570 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,570 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,571 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,571 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {360#true} {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} #97#return; {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,572 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,572 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {368#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {361#false} is VALID [2022-02-20 16:56:25,573 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {361#false} is VALID [2022-02-20 16:56:25,573 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {361#false} is VALID [2022-02-20 16:56:25,573 INFO L272 TraceCheckUtils]: 14: Hoare triple {361#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {361#false} is VALID [2022-02-20 16:56:25,574 INFO L290 TraceCheckUtils]: 15: Hoare triple {361#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {361#false} is VALID [2022-02-20 16:56:25,574 INFO L290 TraceCheckUtils]: 16: Hoare triple {361#false} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {361#false} is VALID [2022-02-20 16:56:25,574 INFO L290 TraceCheckUtils]: 17: Hoare triple {361#false} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {361#false} is VALID [2022-02-20 16:56:25,574 INFO L290 TraceCheckUtils]: 18: Hoare triple {361#false} assume true; {361#false} is VALID [2022-02-20 16:56:25,574 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {361#false} {361#false} #99#return; {361#false} is VALID [2022-02-20 16:56:25,574 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {361#false} is VALID [2022-02-20 16:56:25,575 INFO L290 TraceCheckUtils]: 21: Hoare triple {361#false} assume !(sll_insert_~index#1 > 0); {361#false} is VALID [2022-02-20 16:56:25,575 INFO L290 TraceCheckUtils]: 22: Hoare triple {361#false} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {361#false} is VALID [2022-02-20 16:56:25,575 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {361#false} is VALID [2022-02-20 16:56:25,575 INFO L290 TraceCheckUtils]: 24: Hoare triple {361#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {361#false} is VALID [2022-02-20 16:56:25,575 INFO L290 TraceCheckUtils]: 25: Hoare triple {361#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {361#false} is VALID [2022-02-20 16:56:25,575 INFO L290 TraceCheckUtils]: 26: Hoare triple {361#false} assume main_~count~0#1 != 1 + main_~len~0#1; {361#false} is VALID [2022-02-20 16:56:25,576 INFO L290 TraceCheckUtils]: 27: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 16:56:25,576 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:25,576 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:25,690 INFO L290 TraceCheckUtils]: 27: Hoare triple {361#false} assume !false; {361#false} is VALID [2022-02-20 16:56:25,691 INFO L290 TraceCheckUtils]: 26: Hoare triple {361#false} assume main_~count~0#1 != 1 + main_~len~0#1; {361#false} is VALID [2022-02-20 16:56:25,691 INFO L290 TraceCheckUtils]: 25: Hoare triple {361#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {361#false} is VALID [2022-02-20 16:56:25,691 INFO L290 TraceCheckUtils]: 24: Hoare triple {361#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {361#false} is VALID [2022-02-20 16:56:25,691 INFO L290 TraceCheckUtils]: 23: Hoare triple {361#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {361#false} is VALID [2022-02-20 16:56:25,691 INFO L290 TraceCheckUtils]: 22: Hoare triple {361#false} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {361#false} is VALID [2022-02-20 16:56:25,691 INFO L290 TraceCheckUtils]: 21: Hoare triple {361#false} assume !(sll_insert_~index#1 > 0); {361#false} is VALID [2022-02-20 16:56:25,692 INFO L290 TraceCheckUtils]: 20: Hoare triple {361#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {361#false} is VALID [2022-02-20 16:56:25,692 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {360#true} {361#false} #99#return; {361#false} is VALID [2022-02-20 16:56:25,692 INFO L290 TraceCheckUtils]: 18: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,692 INFO L290 TraceCheckUtils]: 17: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,692 INFO L290 TraceCheckUtils]: 16: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,692 INFO L290 TraceCheckUtils]: 15: Hoare triple {360#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,692 INFO L272 TraceCheckUtils]: 14: Hoare triple {361#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {360#true} is VALID [2022-02-20 16:56:25,693 INFO L290 TraceCheckUtils]: 13: Hoare triple {361#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {361#false} is VALID [2022-02-20 16:56:25,693 INFO L290 TraceCheckUtils]: 12: Hoare triple {361#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {361#false} is VALID [2022-02-20 16:56:25,699 INFO L290 TraceCheckUtils]: 11: Hoare triple {368#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} assume !(sll_create_~len#1 > 0); {361#false} is VALID [2022-02-20 16:56:25,700 INFO L290 TraceCheckUtils]: 10: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {368#(<= 1 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,700 INFO L290 TraceCheckUtils]: 9: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,701 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {360#true} {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} #97#return; {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,701 INFO L290 TraceCheckUtils]: 7: Hoare triple {360#true} assume true; {360#true} is VALID [2022-02-20 16:56:25,701 INFO L290 TraceCheckUtils]: 6: Hoare triple {360#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {360#true} is VALID [2022-02-20 16:56:25,702 INFO L290 TraceCheckUtils]: 5: Hoare triple {360#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {360#true} is VALID [2022-02-20 16:56:25,702 INFO L290 TraceCheckUtils]: 4: Hoare triple {360#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {360#true} is VALID [2022-02-20 16:56:25,702 INFO L272 TraceCheckUtils]: 3: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {360#true} is VALID [2022-02-20 16:56:25,702 INFO L290 TraceCheckUtils]: 2: Hoare triple {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} assume !!(sll_create_~len#1 > 0); {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,703 INFO L290 TraceCheckUtils]: 1: Hoare triple {360#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {381#(<= 2 |ULTIMATE.start_sll_create_~len#1|)} is VALID [2022-02-20 16:56:25,703 INFO L290 TraceCheckUtils]: 0: Hoare triple {360#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(21, 2); {360#true} is VALID [2022-02-20 16:56:25,703 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:56:25,703 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406835053] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:25,704 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:56:25,704 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 6 [2022-02-20 16:56:25,704 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [171849343] [2022-02-20 16:56:25,704 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:25,705 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 16:56:25,705 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:25,705 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:25,734 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 38 edges. 38 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:25,734 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:56:25,734 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:25,735 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:56:25,735 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:25,735 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:25,830 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:25,830 INFO L93 Difference]: Finished difference Result 47 states and 57 transitions. [2022-02-20 16:56:25,830 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:56:25,831 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 16:56:25,831 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:25,831 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:25,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 16:56:25,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:25,834 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 57 transitions. [2022-02-20 16:56:25,834 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 57 transitions. [2022-02-20 16:56:25,877 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 57 edges. 57 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:25,878 INFO L225 Difference]: With dead ends: 47 [2022-02-20 16:56:25,878 INFO L226 Difference]: Without dead ends: 29 [2022-02-20 16:56:25,878 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:25,879 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 36 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 63 SdHoareTripleChecker+Invalid, 29 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:25,879 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [5 Valid, 63 Invalid, 29 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:25,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2022-02-20 16:56:25,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2022-02-20 16:56:25,884 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:25,884 INFO L82 GeneralOperation]: Start isEquivalent. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:25,884 INFO L74 IsIncluded]: Start isIncluded. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:25,884 INFO L87 Difference]: Start difference. First operand 29 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:25,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:25,886 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 16:56:25,886 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:56:25,886 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:25,887 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:25,887 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-02-20 16:56:25,887 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 29 states. [2022-02-20 16:56:25,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:25,888 INFO L93 Difference]: Finished difference Result 29 states and 35 transitions. [2022-02-20 16:56:25,888 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:56:25,889 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:25,889 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:25,889 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:25,889 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:25,889 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:25,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-20 16:56:25,890 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2022-02-20 16:56:25,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:25,890 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-20 16:56:25,891 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 5 states have internal predecessors, (29), 3 states have call successors, (5), 3 states have call predecessors, (5), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:25,891 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:56:25,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:56:25,892 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:25,892 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:25,911 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 16:56:26,108 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:26,108 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:26,109 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:26,109 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2022-02-20 16:56:26,109 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:26,109 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [939035805] [2022-02-20 16:56:26,109 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:26,109 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:26,154 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,193 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 16:56:26,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,201 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {702#true} is VALID [2022-02-20 16:56:26,201 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {702#true} is VALID [2022-02-20 16:56:26,201 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,201 INFO L290 TraceCheckUtils]: 3: Hoare triple {702#true} assume true; {702#true} is VALID [2022-02-20 16:56:26,201 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {702#true} {702#true} #97#return; {702#true} is VALID [2022-02-20 16:56:26,201 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:56:26,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,218 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {702#true} is VALID [2022-02-20 16:56:26,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {702#true} is VALID [2022-02-20 16:56:26,218 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,218 INFO L290 TraceCheckUtils]: 3: Hoare triple {702#true} assume true; {702#true} is VALID [2022-02-20 16:56:26,218 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {702#true} {702#true} #97#return; {702#true} is VALID [2022-02-20 16:56:26,218 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:56:26,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {702#true} is VALID [2022-02-20 16:56:26,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {702#true} is VALID [2022-02-20 16:56:26,224 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,224 INFO L290 TraceCheckUtils]: 3: Hoare triple {702#true} assume true; {702#true} is VALID [2022-02-20 16:56:26,224 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {702#true} {702#true} #99#return; {702#true} is VALID [2022-02-20 16:56:26,224 INFO L290 TraceCheckUtils]: 0: Hoare triple {702#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(21, 2); {702#true} is VALID [2022-02-20 16:56:26,224 INFO L290 TraceCheckUtils]: 1: Hoare triple {702#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {702#true} is VALID [2022-02-20 16:56:26,225 INFO L290 TraceCheckUtils]: 2: Hoare triple {702#true} assume !!(sll_create_~len#1 > 0); {702#true} is VALID [2022-02-20 16:56:26,225 INFO L272 TraceCheckUtils]: 3: Hoare triple {702#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:26,225 INFO L290 TraceCheckUtils]: 4: Hoare triple {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {702#true} is VALID [2022-02-20 16:56:26,225 INFO L290 TraceCheckUtils]: 5: Hoare triple {702#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {702#true} is VALID [2022-02-20 16:56:26,225 INFO L290 TraceCheckUtils]: 6: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,226 INFO L290 TraceCheckUtils]: 7: Hoare triple {702#true} assume true; {702#true} is VALID [2022-02-20 16:56:26,226 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {702#true} {702#true} #97#return; {702#true} is VALID [2022-02-20 16:56:26,226 INFO L290 TraceCheckUtils]: 9: Hoare triple {702#true} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,226 INFO L290 TraceCheckUtils]: 10: Hoare triple {702#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {702#true} is VALID [2022-02-20 16:56:26,226 INFO L290 TraceCheckUtils]: 11: Hoare triple {702#true} assume !!(sll_create_~len#1 > 0); {702#true} is VALID [2022-02-20 16:56:26,227 INFO L272 TraceCheckUtils]: 12: Hoare triple {702#true} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 13: Hoare triple {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 14: Hoare triple {702#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 15: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 16: Hoare triple {702#true} assume true; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {702#true} {702#true} #97#return; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 18: Hoare triple {702#true} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 19: Hoare triple {702#true} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 20: Hoare triple {702#true} assume !(sll_create_~len#1 > 0); {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 21: Hoare triple {702#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,227 INFO L290 TraceCheckUtils]: 22: Hoare triple {702#true} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {702#true} is VALID [2022-02-20 16:56:26,228 INFO L272 TraceCheckUtils]: 23: Hoare triple {702#true} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:26,228 INFO L290 TraceCheckUtils]: 24: Hoare triple {720#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {702#true} is VALID [2022-02-20 16:56:26,228 INFO L290 TraceCheckUtils]: 25: Hoare triple {702#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {702#true} is VALID [2022-02-20 16:56:26,228 INFO L290 TraceCheckUtils]: 26: Hoare triple {702#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {702#true} is VALID [2022-02-20 16:56:26,228 INFO L290 TraceCheckUtils]: 27: Hoare triple {702#true} assume true; {702#true} is VALID [2022-02-20 16:56:26,228 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {702#true} {702#true} #99#return; {702#true} is VALID [2022-02-20 16:56:26,229 INFO L290 TraceCheckUtils]: 29: Hoare triple {702#true} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {719#(and (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:56:26,229 INFO L290 TraceCheckUtils]: 30: Hoare triple {719#(and (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))} assume !(sll_insert_~index#1 > 0); {719#(and (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))} is VALID [2022-02-20 16:56:26,230 INFO L290 TraceCheckUtils]: 31: Hoare triple {719#(and (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.offset| 0) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| 0))} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {703#false} is VALID [2022-02-20 16:56:26,230 INFO L290 TraceCheckUtils]: 32: Hoare triple {703#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {703#false} is VALID [2022-02-20 16:56:26,230 INFO L290 TraceCheckUtils]: 33: Hoare triple {703#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {703#false} is VALID [2022-02-20 16:56:26,230 INFO L290 TraceCheckUtils]: 34: Hoare triple {703#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {703#false} is VALID [2022-02-20 16:56:26,230 INFO L290 TraceCheckUtils]: 35: Hoare triple {703#false} assume main_~count~0#1 != 1 + main_~len~0#1; {703#false} is VALID [2022-02-20 16:56:26,230 INFO L290 TraceCheckUtils]: 36: Hoare triple {703#false} assume !false; {703#false} is VALID [2022-02-20 16:56:26,230 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 16:56:26,230 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:26,230 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [939035805] [2022-02-20 16:56:26,231 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [939035805] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:26,231 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:26,231 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:56:26,231 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1442538354] [2022-02-20 16:56:26,231 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:26,231 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-02-20 16:56:26,231 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:26,231 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:26,250 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:26,250 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:56:26,250 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:26,250 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:56:26,250 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:56:26,250 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:26,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:26,321 INFO L93 Difference]: Finished difference Result 45 states and 55 transitions. [2022-02-20 16:56:26,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:26,321 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 37 [2022-02-20 16:56:26,321 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:26,321 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:26,322 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:56:26,322 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:26,323 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 49 transitions. [2022-02-20 16:56:26,323 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 49 transitions. [2022-02-20 16:56:26,364 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 16:56:26,365 INFO L225 Difference]: With dead ends: 45 [2022-02-20 16:56:26,365 INFO L226 Difference]: Without dead ends: 38 [2022-02-20 16:56:26,365 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 7 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:56:26,366 INFO L933 BasicCegarLoop]: 27 mSDtfsCounter, 9 mSDsluCounter, 37 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 64 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:26,366 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 64 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:26,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 38 states. [2022-02-20 16:56:26,369 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 38 to 31. [2022-02-20 16:56:26,369 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:26,370 INFO L82 GeneralOperation]: Start isEquivalent. First operand 38 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,370 INFO L74 IsIncluded]: Start isIncluded. First operand 38 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,370 INFO L87 Difference]: Start difference. First operand 38 states. Second operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,371 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:26,371 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:56:26,371 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:56:26,371 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:26,371 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:26,372 INFO L74 IsIncluded]: Start isIncluded. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 16:56:26,372 INFO L87 Difference]: Start difference. First operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 38 states. [2022-02-20 16:56:26,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:26,373 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:56:26,373 INFO L276 IsEmpty]: Start isEmpty. Operand 38 states and 46 transitions. [2022-02-20 16:56:26,373 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:26,373 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:26,373 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:26,373 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:26,373 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 31 states, 26 states have (on average 1.2307692307692308) internal successors, (32), 26 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,374 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 38 transitions. [2022-02-20 16:56:26,374 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 38 transitions. Word has length 37 [2022-02-20 16:56:26,375 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:26,375 INFO L470 AbstractCegarLoop]: Abstraction has 31 states and 38 transitions. [2022-02-20 16:56:26,375 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 3 states have internal predecessors, (20), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2022-02-20 16:56:26,375 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 38 transitions. [2022-02-20 16:56:26,375 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:56:26,375 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:26,375 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:26,375 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:56:26,376 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:26,376 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:26,376 INFO L85 PathProgramCache]: Analyzing trace with hash -883753534, now seen corresponding path program 1 times [2022-02-20 16:56:26,376 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:26,376 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086474045] [2022-02-20 16:56:26,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:26,376 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:26,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,452 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 16:56:26,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,459 INFO L290 TraceCheckUtils]: 0: Hoare triple {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {903#true} is VALID [2022-02-20 16:56:26,459 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {903#true} is VALID [2022-02-20 16:56:26,460 INFO L290 TraceCheckUtils]: 2: Hoare triple {903#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {903#true} is VALID [2022-02-20 16:56:26,460 INFO L290 TraceCheckUtils]: 3: Hoare triple {903#true} assume true; {903#true} is VALID [2022-02-20 16:56:26,460 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {903#true} {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #97#return; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,460 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:56:26,464 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,467 INFO L290 TraceCheckUtils]: 0: Hoare triple {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {903#true} is VALID [2022-02-20 16:56:26,467 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {903#true} is VALID [2022-02-20 16:56:26,467 INFO L290 TraceCheckUtils]: 2: Hoare triple {903#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {903#true} is VALID [2022-02-20 16:56:26,468 INFO L290 TraceCheckUtils]: 3: Hoare triple {903#true} assume true; {903#true} is VALID [2022-02-20 16:56:26,468 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {903#true} {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #97#return; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,468 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:56:26,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,476 INFO L290 TraceCheckUtils]: 0: Hoare triple {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {903#true} is VALID [2022-02-20 16:56:26,476 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {903#true} is VALID [2022-02-20 16:56:26,476 INFO L290 TraceCheckUtils]: 2: Hoare triple {903#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {903#true} is VALID [2022-02-20 16:56:26,476 INFO L290 TraceCheckUtils]: 3: Hoare triple {903#true} assume true; {903#true} is VALID [2022-02-20 16:56:26,477 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {903#true} {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} #99#return; {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:26,477 INFO L290 TraceCheckUtils]: 0: Hoare triple {903#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(21, 2); {903#true} is VALID [2022-02-20 16:56:26,477 INFO L290 TraceCheckUtils]: 1: Hoare triple {903#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,478 INFO L290 TraceCheckUtils]: 2: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !!(sll_create_~len#1 > 0); {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,478 INFO L272 TraceCheckUtils]: 3: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:26,478 INFO L290 TraceCheckUtils]: 4: Hoare triple {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {903#true} is VALID [2022-02-20 16:56:26,479 INFO L290 TraceCheckUtils]: 5: Hoare triple {903#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {903#true} is VALID [2022-02-20 16:56:26,479 INFO L290 TraceCheckUtils]: 6: Hoare triple {903#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {903#true} is VALID [2022-02-20 16:56:26,479 INFO L290 TraceCheckUtils]: 7: Hoare triple {903#true} assume true; {903#true} is VALID [2022-02-20 16:56:26,479 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {903#true} {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #97#return; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,480 INFO L290 TraceCheckUtils]: 9: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,480 INFO L290 TraceCheckUtils]: 10: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,480 INFO L290 TraceCheckUtils]: 11: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !!(sll_create_~len#1 > 0); {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,481 INFO L272 TraceCheckUtils]: 12: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:26,481 INFO L290 TraceCheckUtils]: 13: Hoare triple {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {903#true} is VALID [2022-02-20 16:56:26,481 INFO L290 TraceCheckUtils]: 14: Hoare triple {903#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {903#true} is VALID [2022-02-20 16:56:26,481 INFO L290 TraceCheckUtils]: 15: Hoare triple {903#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {903#true} is VALID [2022-02-20 16:56:26,482 INFO L290 TraceCheckUtils]: 16: Hoare triple {903#true} assume true; {903#true} is VALID [2022-02-20 16:56:26,482 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {903#true} {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} #97#return; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,483 INFO L290 TraceCheckUtils]: 18: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,483 INFO L290 TraceCheckUtils]: 19: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,483 INFO L290 TraceCheckUtils]: 20: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} assume !(sll_create_~len#1 > 0); {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,484 INFO L290 TraceCheckUtils]: 21: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} is VALID [2022-02-20 16:56:26,484 INFO L290 TraceCheckUtils]: 22: Hoare triple {905#(= (+ (- 2) |ULTIMATE.start_main_~len~0#1|) 0)} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:26,485 INFO L272 TraceCheckUtils]: 23: Hoare triple {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:26,485 INFO L290 TraceCheckUtils]: 24: Hoare triple {922#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {903#true} is VALID [2022-02-20 16:56:26,485 INFO L290 TraceCheckUtils]: 25: Hoare triple {903#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {903#true} is VALID [2022-02-20 16:56:26,485 INFO L290 TraceCheckUtils]: 26: Hoare triple {903#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {903#true} is VALID [2022-02-20 16:56:26,485 INFO L290 TraceCheckUtils]: 27: Hoare triple {903#true} assume true; {903#true} is VALID [2022-02-20 16:56:26,486 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {903#true} {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} #99#return; {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:26,486 INFO L290 TraceCheckUtils]: 29: Hoare triple {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 30: Hoare triple {916#(and (= (div |ULTIMATE.start_main_~len~0#1| 2) |ULTIMATE.start_sll_insert_~index#1|) (= |ULTIMATE.start_main_~len~0#1| 2))} assume !(sll_insert_~index#1 > 0); {904#false} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 31: Hoare triple {904#false} assume !(sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0);call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~head#1.base, sll_insert_~head#1.offset, 4); {904#false} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 32: Hoare triple {904#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {904#false} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 33: Hoare triple {904#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {904#false} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 34: Hoare triple {904#false} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {904#false} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 35: Hoare triple {904#false} assume main_~count~0#1 != 1 + main_~len~0#1; {904#false} is VALID [2022-02-20 16:56:26,487 INFO L290 TraceCheckUtils]: 36: Hoare triple {904#false} assume !false; {904#false} is VALID [2022-02-20 16:56:26,487 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 16:56:26,488 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:26,488 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086474045] [2022-02-20 16:56:26,488 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086474045] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:26,488 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:26,488 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:56:26,488 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743431063] [2022-02-20 16:56:26,488 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:26,488 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-02-20 16:56:26,488 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:26,488 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:26,506 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:26,506 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:56:26,506 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:56:26,506 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:56:26,506 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:56:26,506 INFO L87 Difference]: Start difference. First operand 31 states and 38 transitions. Second operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:26,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:26,586 INFO L93 Difference]: Finished difference Result 38 states and 46 transitions. [2022-02-20 16:56:26,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:56:26,586 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-02-20 16:56:26,586 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:26,587 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:56:26,587 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:26,588 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 40 transitions. [2022-02-20 16:56:26,588 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 40 transitions. [2022-02-20 16:56:26,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 40 edges. 40 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:26,624 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:56:26,624 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:56:26,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:56:26,625 INFO L933 BasicCegarLoop]: 25 mSDtfsCounter, 14 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 58 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:26,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 58 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:26,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:56:26,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:56:26,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:26,629 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,629 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,629 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:26,630 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:56:26,630 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:56:26,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:26,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:26,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 16:56:26,630 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 16:56:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:26,631 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:56:26,631 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:56:26,632 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:26,632 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:26,632 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:26,632 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:26,632 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:26,633 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:56:26,633 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2022-02-20 16:56:26,633 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:26,633 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:56:26,633 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 4.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:26,633 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:56:26,633 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:56:26,634 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:26,634 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:26,634 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:56:26,634 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:26,634 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:26,634 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-02-20 16:56:26,634 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:56:26,634 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819769841] [2022-02-20 16:56:26,634 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:26,634 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:56:26,670 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,866 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 3 [2022-02-20 16:56:26,870 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,874 INFO L290 TraceCheckUtils]: 0: Hoare triple {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1079#true} is VALID [2022-02-20 16:56:26,874 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1079#true} is VALID [2022-02-20 16:56:26,874 INFO L290 TraceCheckUtils]: 2: Hoare triple {1079#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1079#true} is VALID [2022-02-20 16:56:26,874 INFO L290 TraceCheckUtils]: 3: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-02-20 16:56:26,875 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1079#true} {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #97#return; {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:26,875 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2022-02-20 16:56:26,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:26,930 INFO L290 TraceCheckUtils]: 0: Hoare triple {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} is VALID [2022-02-20 16:56:26,930 INFO L290 TraceCheckUtils]: 1: Hoare triple {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} is VALID [2022-02-20 16:56:26,931 INFO L290 TraceCheckUtils]: 2: Hoare triple {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} is VALID [2022-02-20 16:56:26,932 INFO L290 TraceCheckUtils]: 3: Hoare triple {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} assume true; {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} is VALID [2022-02-20 16:56:26,933 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #97#return; {1092#(and (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:26,933 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 23 [2022-02-20 16:56:26,938 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:27,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:56:27,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:56:27,008 INFO L290 TraceCheckUtils]: 2: Hoare triple {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:56:27,009 INFO L290 TraceCheckUtils]: 3: Hoare triple {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:56:27,011 INFO L284 TraceCheckUtils]: 4: Hoare quadruple {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {1095#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #99#return; {1101#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (not (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_sll_insert_#t~ret7#1.base|)) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:56:27,012 INFO L290 TraceCheckUtils]: 0: Hoare triple {1079#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(21, 2); {1079#true} is VALID [2022-02-20 16:56:27,012 INFO L290 TraceCheckUtils]: 1: Hoare triple {1079#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2;main_~data~0#1 := 1;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0, 0; {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:27,013 INFO L290 TraceCheckUtils]: 2: Hoare triple {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_create_~len#1 > 0); {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:27,014 INFO L272 TraceCheckUtils]: 3: Hoare triple {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:27,014 INFO L290 TraceCheckUtils]: 4: Hoare triple {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1079#true} is VALID [2022-02-20 16:56:27,014 INFO L290 TraceCheckUtils]: 5: Hoare triple {1079#true} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1079#true} is VALID [2022-02-20 16:56:27,014 INFO L290 TraceCheckUtils]: 6: Hoare triple {1079#true} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1079#true} is VALID [2022-02-20 16:56:27,014 INFO L290 TraceCheckUtils]: 7: Hoare triple {1079#true} assume true; {1079#true} is VALID [2022-02-20 16:56:27,015 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1079#true} {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #97#return; {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:27,015 INFO L290 TraceCheckUtils]: 9: Hoare triple {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:27,016 INFO L290 TraceCheckUtils]: 10: Hoare triple {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:27,016 INFO L290 TraceCheckUtils]: 11: Hoare triple {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} assume !!(sll_create_~len#1 > 0); {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:27,017 INFO L272 TraceCheckUtils]: 12: Hoare triple {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:27,018 INFO L290 TraceCheckUtils]: 13: Hoare triple {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} is VALID [2022-02-20 16:56:27,018 INFO L290 TraceCheckUtils]: 14: Hoare triple {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} is VALID [2022-02-20 16:56:27,019 INFO L290 TraceCheckUtils]: 15: Hoare triple {1108#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (or (not (<= |node_create_~temp~0#1.base| 0)) (<= (+ |node_create_~temp~0#1.base| 1) 0)))} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} is VALID [2022-02-20 16:56:27,020 INFO L290 TraceCheckUtils]: 16: Hoare triple {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} assume true; {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} is VALID [2022-02-20 16:56:27,021 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1109#(and (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (or (<= (+ |node_create_#res#1.base| 1) 0) (<= 1 |node_create_#res#1.base|)))} {1081#(<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|)} #97#return; {1092#(and (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,022 INFO L290 TraceCheckUtils]: 18: Hoare triple {1092#(and (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, 4 + sll_create_~new_head~0#1.offset, 4);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1093#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,022 INFO L290 TraceCheckUtils]: 19: Hoare triple {1093#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := sll_create_#t~post4#1 - 1;havoc sll_create_#t~post4#1; {1093#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,023 INFO L290 TraceCheckUtils]: 20: Hoare triple {1093#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(sll_create_~len#1 > 0); {1093#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,023 INFO L290 TraceCheckUtils]: 21: Hoare triple {1093#(and (not (= |ULTIMATE.start_sll_create_~head~0#1.base| 0)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1094#(and (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|)))} is VALID [2022-02-20 16:56:27,024 INFO L290 TraceCheckUtils]: 22: Hoare triple {1094#(and (not (= 0 |ULTIMATE.start_sll_create_#res#1.base|)) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (not (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_create_#res#1.base|)))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, (if main_~len~0#1 < 0 && 0 != main_~len~0#1 % 2 then 1 + main_~len~0#1 / 2 else main_~len~0#1 / 2);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {1095#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:56:27,025 INFO L272 TraceCheckUtils]: 23: Hoare triple {1095#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} is VALID [2022-02-20 16:56:27,026 INFO L290 TraceCheckUtils]: 24: Hoare triple {1107#(and (= |old(#length)| |#length|) (= |#memory_int| |old(#memory_int)|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|) (= |#memory_$Pointer$.offset| |old(#memory_$Pointer$.offset)|) (= |old(#valid)| |#valid|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:56:27,027 INFO L290 TraceCheckUtils]: 25: Hoare triple {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} assume !(0 == ~temp~0#1.base && 0 == ~temp~0#1.offset); {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} is VALID [2022-02-20 16:56:27,028 INFO L290 TraceCheckUtils]: 26: Hoare triple {1110#(and (<= (+ |node_create_~temp~0#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|))} call write~$Pointer$(0, 0, ~temp~0#1.base, 4 + ~temp~0#1.offset, 4);call write~int(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:56:27,029 INFO L290 TraceCheckUtils]: 27: Hoare triple {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} assume true; {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} is VALID [2022-02-20 16:56:27,031 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1111#(and (or (<= (+ (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| |old(#memory_$Pointer$.base)|)) (<= (+ |node_create_#res#1.base| 1) |#StackHeapBarrier|) (= |#memory_$Pointer$.base| (store |old(#memory_$Pointer$.base)| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|) (select |#memory_$Pointer$.base| (@diff |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|)))))} {1095#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~head#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|))) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (<= (+ |#StackHeapBarrier| 1) |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} #99#return; {1101#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (not (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_sll_insert_#t~ret7#1.base|)) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} is VALID [2022-02-20 16:56:27,031 INFO L290 TraceCheckUtils]: 29: Hoare triple {1101#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_sll_insert_~head#1.offset|) |ULTIMATE.start_sll_insert_~head#1.base|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_sll_insert_~head#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (not (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_sll_insert_#t~ret7#1.base|)) (= |ULTIMATE.start_sll_insert_~head#1.base| |ULTIMATE.start_main_~#s~0#1.base|))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0, 0;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {1102#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,032 INFO L290 TraceCheckUtils]: 30: Hoare triple {1102#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !!(sll_insert_~index#1 > 0);sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;call sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset := read~$Pointer$(sll_insert_~last~0#1.base, 4 + sll_insert_~last~0#1.offset, 4);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset;havoc sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset;sll_insert_#t~post10#1 := sll_insert_~index#1;sll_insert_~index#1 := sll_insert_#t~post10#1 - 1;havoc sll_insert_#t~post10#1; {1103#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,033 INFO L290 TraceCheckUtils]: 31: Hoare triple {1103#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume !(sll_insert_~index#1 > 0); {1103#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,033 INFO L290 TraceCheckUtils]: 32: Hoare triple {1103#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} assume sll_insert_~snd_to_last~0#1.base != 0 || sll_insert_~snd_to_last~0#1.offset != 0;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, 4 + sll_insert_~snd_to_last~0#1.offset, 4); {1104#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} is VALID [2022-02-20 16:56:27,034 INFO L290 TraceCheckUtils]: 33: Hoare triple {1104#(and (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0)) (not (= |ULTIMATE.start_sll_insert_~new_node~0#1.base| |ULTIMATE.start_main_~#s~0#1.base|)))} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, 4 + sll_insert_~new_node~0#1.offset, 4); {1105#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} is VALID [2022-02-20 16:56:27,034 INFO L290 TraceCheckUtils]: 34: Hoare triple {1105#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) 0))} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0; {1106#(not (= |ULTIMATE.start_main_~ptr~0#1.base| 0))} is VALID [2022-02-20 16:56:27,035 INFO L290 TraceCheckUtils]: 35: Hoare triple {1106#(not (= |ULTIMATE.start_main_~ptr~0#1.base| 0))} assume !(main_~ptr~0#1.base != 0 || main_~ptr~0#1.offset != 0); {1080#false} is VALID [2022-02-20 16:56:27,035 INFO L290 TraceCheckUtils]: 36: Hoare triple {1080#false} assume main_~count~0#1 != 1 + main_~len~0#1; {1080#false} is VALID [2022-02-20 16:56:27,035 INFO L290 TraceCheckUtils]: 37: Hoare triple {1080#false} assume !false; {1080#false} is VALID [2022-02-20 16:56:27,035 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 12 proven. 5 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:56:27,035 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:56:27,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819769841] [2022-02-20 16:56:27,035 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819769841] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:27,035 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1999548722] [2022-02-20 16:56:27,035 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:27,035 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:56:27,036 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:27,037 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 16:56:27,038 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 16:56:27,148 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:27,151 INFO L263 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 38 conjunts are in the unsatisfiable core [2022-02-20 16:56:27,185 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:27,186 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:27,485 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2022-02-20 16:56:27,668 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:27,671 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 17 [2022-02-20 16:56:27,915 INFO L356 Elim1Store]: treesize reduction 36, result has 56.6 percent of original size [2022-02-20 16:56:27,915 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 30 treesize of output 63 [2022-02-20 16:56:28,846 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:28,885 INFO L356 Elim1Store]: treesize reduction 54, result has 49.1 percent of original size [2022-02-20 16:56:28,885 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 2 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 76 treesize of output 122 [2022-02-20 16:56:28,901 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:56:28,920 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 16:56:29,102 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,SelfDestructingSolverStorable5 [2022-02-20 16:56:29,103 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:65) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:56:29,108 INFO L158 Benchmark]: Toolchain (without parser) took 5767.62ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 96.9MB in the beginning and 108.9MB in the end (delta: -12.0MB). Peak memory consumption was 45.3MB. Max. memory is 16.1GB. [2022-02-20 16:56:29,108 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:56:29,108 INFO L158 Benchmark]: CACSL2BoogieTranslator took 327.10ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 91.0MB in the end (delta: 5.7MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:29,109 INFO L158 Benchmark]: Boogie Procedure Inliner took 48.40ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 88.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:56:29,109 INFO L158 Benchmark]: Boogie Preprocessor took 32.54ms. Allocated memory is still 125.8MB. Free memory was 88.4MB in the beginning and 86.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:29,109 INFO L158 Benchmark]: RCFGBuilder took 332.58ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 70.0MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. [2022-02-20 16:56:29,109 INFO L158 Benchmark]: TraceAbstraction took 5022.16ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 69.5MB in the beginning and 108.9MB in the end (delta: -39.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. [2022-02-20 16:56:29,110 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 125.8MB. Free memory is still 81.2MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 327.10ms. Allocated memory is still 125.8MB. Free memory was 96.7MB in the beginning and 91.0MB in the end (delta: 5.7MB). Peak memory consumption was 9.1MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 48.40ms. Allocated memory is still 125.8MB. Free memory was 91.0MB in the beginning and 88.4MB in the end (delta: 2.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * Boogie Preprocessor took 32.54ms. Allocated memory is still 125.8MB. Free memory was 88.4MB in the beginning and 86.6MB in the end (delta: 1.8MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 332.58ms. Allocated memory is still 125.8MB. Free memory was 86.6MB in the beginning and 70.0MB in the end (delta: 16.5MB). Peak memory consumption was 14.7MB. Max. memory is 16.1GB. * TraceAbstraction took 5022.16ms. Allocated memory was 125.8MB in the beginning and 182.5MB in the end (delta: 56.6MB). Free memory was 69.5MB in the beginning and 108.9MB in the end (delta: -39.4MB). Peak memory consumption was 17.4MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:56:29,134 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Ended with exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2n_insert_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:56:31,006 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:56:31,010 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:56:31,039 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:56:31,039 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:56:31,042 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:56:31,043 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:56:31,046 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:56:31,048 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:56:31,051 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:56:31,052 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:56:31,055 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:56:31,055 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:56:31,057 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:56:31,058 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:56:31,060 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:56:31,060 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:56:31,061 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:56:31,062 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:56:31,066 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:56:31,067 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:56:31,067 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:56:31,069 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:56:31,069 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:56:31,074 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:56:31,074 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:56:31,074 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:56:31,075 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:56:31,076 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:56:31,081 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:56:31,082 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:56:31,082 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:56:31,083 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:56:31,084 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:56:31,086 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:56:31,086 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:56:31,087 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:56:31,087 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:56:31,087 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:56:31,088 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:56:31,088 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:56:31,089 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Bitvector.epf [2022-02-20 16:56:31,116 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:56:31,117 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:56:31,118 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:56:31,118 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:56:31,118 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:56:31,119 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:56:31,119 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:56:31,120 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:56:31,120 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:56:31,120 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:56:31,121 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:56:31,121 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:56:31,121 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:56:31,121 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:56:31,121 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:56:31,121 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:56:31,122 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:56:31,123 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:56:31,123 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:56:31,123 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:56:31,123 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:31,123 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:56:31,123 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:56:31,124 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:56:31,124 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:56:31,124 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:56:31,124 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:56:31,124 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:56:31,124 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:56:31,125 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:56:31,125 INFO L138 SettingsManager]: * Logic for external solver=AUFBV WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) 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 -> 43bf83586090da08f52ccb7b612d2451c8f1efe9c820d873134ac51350c022e3 [2022-02-20 16:56:31,426 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:56:31,447 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:56:31,449 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:56:31,450 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:56:31,450 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:56:31,451 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-02-20 16:56:31,515 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a388b1282/366b79b77b974137b265425745361701/FLAG7ac2596ec [2022-02-20 16:56:31,946 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:56:31,947 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i [2022-02-20 16:56:31,969 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a388b1282/366b79b77b974137b265425745361701/FLAG7ac2596ec [2022-02-20 16:56:32,302 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/a388b1282/366b79b77b974137b265425745361701 [2022-02-20 16:56:32,304 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:56:32,306 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:56:32,317 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:32,318 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:56:32,321 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:56:32,322 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,323 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2d594895 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32, skipping insertion in model container [2022-02-20 16:56:32,323 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,328 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:56:32,363 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:56:32,596 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-02-20 16:56:32,601 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:32,621 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:56:32,685 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2n_insert_equal.i[24301,24314] [2022-02-20 16:56:32,686 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:56:32,724 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:56:32,724 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32 WrapperNode [2022-02-20 16:56:32,725 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:56:32,725 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:32,726 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:56:32,726 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:56:32,731 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,748 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,777 INFO L137 Inliner]: procedures = 130, calls = 32, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 120 [2022-02-20 16:56:32,778 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:56:32,780 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:56:32,780 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:56:32,780 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:56:32,788 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,788 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,802 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,804 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,811 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,822 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,825 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,835 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:56:32,836 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:56:32,842 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:56:32,842 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:56:32,843 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (1/1) ... [2022-02-20 16:56:32,849 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:56:32,857 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:56:32,877 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 16:56:32,884 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 16:56:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:56:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2022-02-20 16:56:32,908 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2022-02-20 16:56:32,908 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2022-02-20 16:56:32,909 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:56:32,910 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:56:32,910 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:56:33,025 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:56:33,036 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:56:33,329 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:56:33,333 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:56:33,334 INFO L299 CfgBuilder]: Removed 4 assume(true) statements. [2022-02-20 16:56:33,335 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:33 BoogieIcfgContainer [2022-02-20 16:56:33,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:56:33,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:56:33,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:56:33,338 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:56:33,338 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:56:32" (1/3) ... [2022-02-20 16:56:33,342 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ae7bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:33, skipping insertion in model container [2022-02-20 16:56:33,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:56:32" (2/3) ... [2022-02-20 16:56:33,343 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@39ae7bf7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:56:33, skipping insertion in model container [2022-02-20 16:56:33,343 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:56:33" (3/3) ... [2022-02-20 16:56:33,344 INFO L111 eAbstractionObserver]: Analyzing ICFG sll2n_insert_equal.i [2022-02-20 16:56:33,348 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:56:33,348 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:56:33,388 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:56:33,395 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=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopsAndPotentialCycles, 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 16:56:33,395 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:56:33,407 INFO L276 IsEmpty]: Start isEmpty. Operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 16:56:33,417 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:56:33,417 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:33,418 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:33,418 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:33,423 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:33,423 INFO L85 PathProgramCache]: Analyzing trace with hash -497301104, now seen corresponding path program 1 times [2022-02-20 16:56:33,432 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:33,433 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1371776864] [2022-02-20 16:56:33,433 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:33,434 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:33,434 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:33,436 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:33,479 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2022-02-20 16:56:33,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:33,549 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:56:33,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:33,567 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:33,643 INFO L290 TraceCheckUtils]: 0: Hoare triple {33#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32); {33#true} is VALID [2022-02-20 16:56:33,643 INFO L290 TraceCheckUtils]: 1: Hoare triple {33#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {33#true} is VALID [2022-02-20 16:56:33,644 INFO L290 TraceCheckUtils]: 2: Hoare triple {33#true} assume !true; {33#true} is VALID [2022-02-20 16:56:33,644 INFO L290 TraceCheckUtils]: 3: Hoare triple {33#true} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {33#true} is VALID [2022-02-20 16:56:33,644 INFO L290 TraceCheckUtils]: 4: Hoare triple {33#true} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, ~bvsdiv32(main_~len~0#1, 2bv32);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {33#true} is VALID [2022-02-20 16:56:33,644 INFO L272 TraceCheckUtils]: 5: Hoare triple {33#true} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {33#true} is VALID [2022-02-20 16:56:33,645 INFO L290 TraceCheckUtils]: 6: Hoare triple {33#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {33#true} is VALID [2022-02-20 16:56:33,645 INFO L290 TraceCheckUtils]: 7: Hoare triple {33#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {33#true} is VALID [2022-02-20 16:56:33,645 INFO L290 TraceCheckUtils]: 8: Hoare triple {33#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {33#true} is VALID [2022-02-20 16:56:33,645 INFO L290 TraceCheckUtils]: 9: Hoare triple {33#true} assume true; {33#true} is VALID [2022-02-20 16:56:33,646 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {33#true} {33#true} #99#return; {33#true} is VALID [2022-02-20 16:56:33,646 INFO L290 TraceCheckUtils]: 11: Hoare triple {33#true} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {33#true} is VALID [2022-02-20 16:56:33,646 INFO L290 TraceCheckUtils]: 12: Hoare triple {33#true} assume !true; {34#false} is VALID [2022-02-20 16:56:33,647 INFO L290 TraceCheckUtils]: 13: Hoare triple {34#false} assume sll_insert_~snd_to_last~0#1.base != 0bv32 || sll_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, ~bvadd32(4bv32, sll_insert_~snd_to_last~0#1.offset), 4bv32); {34#false} is VALID [2022-02-20 16:56:33,647 INFO L290 TraceCheckUtils]: 14: Hoare triple {34#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, ~bvadd32(4bv32, sll_insert_~new_node~0#1.offset), 4bv32); {34#false} is VALID [2022-02-20 16:56:33,647 INFO L290 TraceCheckUtils]: 15: Hoare triple {34#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0bv32; {34#false} is VALID [2022-02-20 16:56:33,647 INFO L290 TraceCheckUtils]: 16: Hoare triple {34#false} assume !(main_~ptr~0#1.base != 0bv32 || main_~ptr~0#1.offset != 0bv32); {34#false} is VALID [2022-02-20 16:56:33,647 INFO L290 TraceCheckUtils]: 17: Hoare triple {34#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {34#false} is VALID [2022-02-20 16:56:33,647 INFO L290 TraceCheckUtils]: 18: Hoare triple {34#false} assume !false; {34#false} is VALID [2022-02-20 16:56:33,648 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 16:56:33,649 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:33,649 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:33,649 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1371776864] [2022-02-20 16:56:33,649 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1371776864] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:33,649 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:33,650 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:56:33,651 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [589019066] [2022-02-20 16:56:33,652 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:33,655 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:33,657 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:33,659 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:33,692 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:33,693 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:56:33,693 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:33,714 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:56:33,715 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:56:33,717 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.52) internal successors, (38), 26 states have internal predecessors, (38), 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 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:33,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:33,800 INFO L93 Difference]: Finished difference Result 54 states and 75 transitions. [2022-02-20 16:56:33,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:56:33,800 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:33,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:33,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:33,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2022-02-20 16:56:33,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:33,816 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 75 transitions. [2022-02-20 16:56:33,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 75 transitions. [2022-02-20 16:56:33,954 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 75 edges. 75 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:33,959 INFO L225 Difference]: With dead ends: 54 [2022-02-20 16:56:33,959 INFO L226 Difference]: Without dead ends: 24 [2022-02-20 16:56:33,961 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 18 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 16:56:33,963 INFO L933 BasicCegarLoop]: 37 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, 37 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 16:56:33,964 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:33,989 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2022-02-20 16:56:33,999 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 24. [2022-02-20 16:56:33,999 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:33,999 INFO L82 GeneralOperation]: Start isEquivalent. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:34,000 INFO L74 IsIncluded]: Start isIncluded. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:34,001 INFO L87 Difference]: Start difference. First operand 24 states. Second operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:34,005 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:34,019 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 16:56:34,021 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:56:34,021 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:34,022 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:34,022 INFO L74 IsIncluded]: Start isIncluded. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 24 states. [2022-02-20 16:56:34,023 INFO L87 Difference]: Start difference. First operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 24 states. [2022-02-20 16:56:34,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:34,026 INFO L93 Difference]: Finished difference Result 24 states and 29 transitions. [2022-02-20 16:56:34,026 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:56:34,027 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:34,030 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:34,030 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:34,030 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:34,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 24 states, 20 states have (on average 1.25) internal successors, (25), 20 states have internal predecessors, (25), 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 16:56:34,033 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 29 transitions. [2022-02-20 16:56:34,034 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 29 transitions. Word has length 19 [2022-02-20 16:56:34,034 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:34,034 INFO L470 AbstractCegarLoop]: Abstraction has 24 states and 29 transitions. [2022-02-20 16:56:34,035 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 8.5) internal successors, (17), 2 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:34,035 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 29 transitions. [2022-02-20 16:56:34,035 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:56:34,035 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:34,035 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:34,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:34,244 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:34,244 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:34,245 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:34,245 INFO L85 PathProgramCache]: Analyzing trace with hash -1988891516, now seen corresponding path program 1 times [2022-02-20 16:56:34,245 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:34,245 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123103607] [2022-02-20 16:56:34,245 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:34,245 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:34,246 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:34,260 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:34,290 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2022-02-20 16:56:34,356 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:34,359 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:56:34,370 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:34,371 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:34,435 INFO L290 TraceCheckUtils]: 0: Hoare triple {245#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32); {245#true} is VALID [2022-02-20 16:56:34,436 INFO L290 TraceCheckUtils]: 1: Hoare triple {245#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {253#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:34,436 INFO L290 TraceCheckUtils]: 2: Hoare triple {253#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {246#false} is VALID [2022-02-20 16:56:34,436 INFO L290 TraceCheckUtils]: 3: Hoare triple {246#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {246#false} is VALID [2022-02-20 16:56:34,437 INFO L290 TraceCheckUtils]: 4: Hoare triple {246#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, ~bvsdiv32(main_~len~0#1, 2bv32);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {246#false} is VALID [2022-02-20 16:56:34,437 INFO L272 TraceCheckUtils]: 5: Hoare triple {246#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {246#false} is VALID [2022-02-20 16:56:34,437 INFO L290 TraceCheckUtils]: 6: Hoare triple {246#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {246#false} is VALID [2022-02-20 16:56:34,437 INFO L290 TraceCheckUtils]: 7: Hoare triple {246#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {246#false} is VALID [2022-02-20 16:56:34,437 INFO L290 TraceCheckUtils]: 8: Hoare triple {246#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {246#false} is VALID [2022-02-20 16:56:34,438 INFO L290 TraceCheckUtils]: 9: Hoare triple {246#false} assume true; {246#false} is VALID [2022-02-20 16:56:34,438 INFO L284 TraceCheckUtils]: 10: Hoare quadruple {246#false} {246#false} #99#return; {246#false} is VALID [2022-02-20 16:56:34,438 INFO L290 TraceCheckUtils]: 11: Hoare triple {246#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {246#false} is VALID [2022-02-20 16:56:34,438 INFO L290 TraceCheckUtils]: 12: Hoare triple {246#false} assume !~bvsgt32(sll_insert_~index#1, 0bv32); {246#false} is VALID [2022-02-20 16:56:34,438 INFO L290 TraceCheckUtils]: 13: Hoare triple {246#false} assume sll_insert_~snd_to_last~0#1.base != 0bv32 || sll_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, ~bvadd32(4bv32, sll_insert_~snd_to_last~0#1.offset), 4bv32); {246#false} is VALID [2022-02-20 16:56:34,438 INFO L290 TraceCheckUtils]: 14: Hoare triple {246#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, ~bvadd32(4bv32, sll_insert_~new_node~0#1.offset), 4bv32); {246#false} is VALID [2022-02-20 16:56:34,439 INFO L290 TraceCheckUtils]: 15: Hoare triple {246#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0bv32; {246#false} is VALID [2022-02-20 16:56:34,439 INFO L290 TraceCheckUtils]: 16: Hoare triple {246#false} assume !(main_~ptr~0#1.base != 0bv32 || main_~ptr~0#1.offset != 0bv32); {246#false} is VALID [2022-02-20 16:56:34,439 INFO L290 TraceCheckUtils]: 17: Hoare triple {246#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {246#false} is VALID [2022-02-20 16:56:34,439 INFO L290 TraceCheckUtils]: 18: Hoare triple {246#false} assume !false; {246#false} is VALID [2022-02-20 16:56:34,439 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:34,440 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:34,440 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:34,440 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123103607] [2022-02-20 16:56:34,440 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123103607] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:34,440 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:34,440 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:56:34,441 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573149536] [2022-02-20 16:56:34,441 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:34,442 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:34,442 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:34,442 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:34,470 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:34,471 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:56:34,471 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:34,471 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:56:34,472 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:56:34,472 INFO L87 Difference]: Start difference. First operand 24 states and 29 transitions. Second operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:34,589 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:34,589 INFO L93 Difference]: Finished difference Result 46 states and 56 transitions. [2022-02-20 16:56:34,589 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:56:34,590 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 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 19 [2022-02-20 16:56:34,590 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:34,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:34,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 16:56:34,592 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:34,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 56 transitions. [2022-02-20 16:56:34,593 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 56 transitions. [2022-02-20 16:56:34,678 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 56 edges. 56 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:34,680 INFO L225 Difference]: With dead ends: 46 [2022-02-20 16:56:34,680 INFO L226 Difference]: Without dead ends: 28 [2022-02-20 16:56:34,680 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 17 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 16:56:34,681 INFO L933 BasicCegarLoop]: 28 mSDtfsCounter, 2 mSDsluCounter, 25 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 53 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:34,681 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [3 Valid, 53 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:34,682 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2022-02-20 16:56:34,684 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 25. [2022-02-20 16:56:34,684 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:34,684 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:34,684 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:34,685 INFO L87 Difference]: Start difference. First operand 28 states. Second operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:34,686 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:34,686 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:56:34,686 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:56:34,686 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:34,687 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:34,687 INFO L74 IsIncluded]: Start isIncluded. First operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-02-20 16:56:34,687 INFO L87 Difference]: Start difference. First operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 28 states. [2022-02-20 16:56:34,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:34,688 INFO L93 Difference]: Finished difference Result 28 states and 34 transitions. [2022-02-20 16:56:34,688 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 34 transitions. [2022-02-20 16:56:34,689 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:34,689 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:34,689 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:34,689 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:34,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 25 states, 21 states have (on average 1.2380952380952381) internal successors, (26), 21 states have internal predecessors, (26), 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 16:56:34,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 30 transitions. [2022-02-20 16:56:34,690 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 30 transitions. Word has length 19 [2022-02-20 16:56:34,690 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:34,691 INFO L470 AbstractCegarLoop]: Abstraction has 25 states and 30 transitions. [2022-02-20 16:56:34,691 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.666666666666667) internal successors, (17), 3 states have internal predecessors, (17), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2022-02-20 16:56:34,691 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 30 transitions. [2022-02-20 16:56:34,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2022-02-20 16:56:34,691 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:34,692 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:34,700 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:34,900 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:34,900 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:34,900 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:34,901 INFO L85 PathProgramCache]: Analyzing trace with hash 208174980, now seen corresponding path program 1 times [2022-02-20 16:56:34,901 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:34,901 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1900504245] [2022-02-20 16:56:34,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:34,901 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:34,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:34,905 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:34,907 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2022-02-20 16:56:35,024 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:35,036 INFO L263 TraceCheckSpWp]: Trace formula consists of 170 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:56:35,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:35,055 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:35,120 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32); {456#true} is VALID [2022-02-20 16:56:35,121 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:35,122 INFO L290 TraceCheckUtils]: 2: Hoare triple {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:35,122 INFO L272 TraceCheckUtils]: 3: Hoare triple {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {456#true} is VALID [2022-02-20 16:56:35,122 INFO L290 TraceCheckUtils]: 4: Hoare triple {456#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {456#true} is VALID [2022-02-20 16:56:35,122 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {456#true} is VALID [2022-02-20 16:56:35,122 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {456#true} is VALID [2022-02-20 16:56:35,122 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#true} assume true; {456#true} is VALID [2022-02-20 16:56:35,125 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {456#true} {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} #97#return; {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:35,125 INFO L290 TraceCheckUtils]: 9: Hoare triple {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} is VALID [2022-02-20 16:56:35,126 INFO L290 TraceCheckUtils]: 10: Hoare triple {464#(= |ULTIMATE.start_sll_create_~len#1| (_ bv2 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {492#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} is VALID [2022-02-20 16:56:35,126 INFO L290 TraceCheckUtils]: 11: Hoare triple {492#(= (bvadd |ULTIMATE.start_sll_create_~len#1| (_ bv1 32)) (_ bv2 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {457#false} is VALID [2022-02-20 16:56:35,126 INFO L290 TraceCheckUtils]: 12: Hoare triple {457#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {457#false} is VALID [2022-02-20 16:56:35,126 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, ~bvsdiv32(main_~len~0#1, 2bv32);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {457#false} is VALID [2022-02-20 16:56:35,127 INFO L272 TraceCheckUtils]: 14: Hoare triple {457#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {457#false} is VALID [2022-02-20 16:56:35,127 INFO L290 TraceCheckUtils]: 15: Hoare triple {457#false} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {457#false} is VALID [2022-02-20 16:56:35,127 INFO L290 TraceCheckUtils]: 16: Hoare triple {457#false} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {457#false} is VALID [2022-02-20 16:56:35,127 INFO L290 TraceCheckUtils]: 17: Hoare triple {457#false} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {457#false} is VALID [2022-02-20 16:56:35,127 INFO L290 TraceCheckUtils]: 18: Hoare triple {457#false} assume true; {457#false} is VALID [2022-02-20 16:56:35,127 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {457#false} {457#false} #99#return; {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 20: Hoare triple {457#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 21: Hoare triple {457#false} assume !~bvsgt32(sll_insert_~index#1, 0bv32); {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 22: Hoare triple {457#false} assume sll_insert_~snd_to_last~0#1.base != 0bv32 || sll_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, ~bvadd32(4bv32, sll_insert_~snd_to_last~0#1.offset), 4bv32); {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 23: Hoare triple {457#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, ~bvadd32(4bv32, sll_insert_~new_node~0#1.offset), 4bv32); {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 24: Hoare triple {457#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0bv32; {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 25: Hoare triple {457#false} assume !(main_~ptr~0#1.base != 0bv32 || main_~ptr~0#1.offset != 0bv32); {457#false} is VALID [2022-02-20 16:56:35,128 INFO L290 TraceCheckUtils]: 26: Hoare triple {457#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {457#false} is VALID [2022-02-20 16:56:35,129 INFO L290 TraceCheckUtils]: 27: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-02-20 16:56:35,129 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:56:35,129 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:35,244 INFO L290 TraceCheckUtils]: 27: Hoare triple {457#false} assume !false; {457#false} is VALID [2022-02-20 16:56:35,244 INFO L290 TraceCheckUtils]: 26: Hoare triple {457#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {457#false} is VALID [2022-02-20 16:56:35,244 INFO L290 TraceCheckUtils]: 25: Hoare triple {457#false} assume !(main_~ptr~0#1.base != 0bv32 || main_~ptr~0#1.offset != 0bv32); {457#false} is VALID [2022-02-20 16:56:35,244 INFO L290 TraceCheckUtils]: 24: Hoare triple {457#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0bv32; {457#false} is VALID [2022-02-20 16:56:35,244 INFO L290 TraceCheckUtils]: 23: Hoare triple {457#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, ~bvadd32(4bv32, sll_insert_~new_node~0#1.offset), 4bv32); {457#false} is VALID [2022-02-20 16:56:35,245 INFO L290 TraceCheckUtils]: 22: Hoare triple {457#false} assume sll_insert_~snd_to_last~0#1.base != 0bv32 || sll_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, ~bvadd32(4bv32, sll_insert_~snd_to_last~0#1.offset), 4bv32); {457#false} is VALID [2022-02-20 16:56:35,245 INFO L290 TraceCheckUtils]: 21: Hoare triple {457#false} assume !~bvsgt32(sll_insert_~index#1, 0bv32); {457#false} is VALID [2022-02-20 16:56:35,245 INFO L290 TraceCheckUtils]: 20: Hoare triple {457#false} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {457#false} is VALID [2022-02-20 16:56:35,245 INFO L284 TraceCheckUtils]: 19: Hoare quadruple {456#true} {457#false} #99#return; {457#false} is VALID [2022-02-20 16:56:35,245 INFO L290 TraceCheckUtils]: 18: Hoare triple {456#true} assume true; {456#true} is VALID [2022-02-20 16:56:35,245 INFO L290 TraceCheckUtils]: 17: Hoare triple {456#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {456#true} is VALID [2022-02-20 16:56:35,246 INFO L290 TraceCheckUtils]: 16: Hoare triple {456#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {456#true} is VALID [2022-02-20 16:56:35,246 INFO L290 TraceCheckUtils]: 15: Hoare triple {456#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {456#true} is VALID [2022-02-20 16:56:35,246 INFO L272 TraceCheckUtils]: 14: Hoare triple {457#false} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {456#true} is VALID [2022-02-20 16:56:35,246 INFO L290 TraceCheckUtils]: 13: Hoare triple {457#false} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, ~bvsdiv32(main_~len~0#1, 2bv32);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {457#false} is VALID [2022-02-20 16:56:35,246 INFO L290 TraceCheckUtils]: 12: Hoare triple {457#false} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {457#false} is VALID [2022-02-20 16:56:35,246 INFO L290 TraceCheckUtils]: 11: Hoare triple {592#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {457#false} is VALID [2022-02-20 16:56:35,248 INFO L290 TraceCheckUtils]: 10: Hoare triple {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {592#(bvsgt |ULTIMATE.start_sll_create_~len#1| (_ bv0 32))} is VALID [2022-02-20 16:56:35,248 INFO L290 TraceCheckUtils]: 9: Hoare triple {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:35,249 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {456#true} {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} #97#return; {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:35,249 INFO L290 TraceCheckUtils]: 7: Hoare triple {456#true} assume true; {456#true} is VALID [2022-02-20 16:56:35,249 INFO L290 TraceCheckUtils]: 6: Hoare triple {456#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {456#true} is VALID [2022-02-20 16:56:35,250 INFO L290 TraceCheckUtils]: 5: Hoare triple {456#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {456#true} is VALID [2022-02-20 16:56:35,250 INFO L290 TraceCheckUtils]: 4: Hoare triple {456#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {456#true} is VALID [2022-02-20 16:56:35,250 INFO L272 TraceCheckUtils]: 3: Hoare triple {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {456#true} is VALID [2022-02-20 16:56:35,251 INFO L290 TraceCheckUtils]: 2: Hoare triple {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:35,251 INFO L290 TraceCheckUtils]: 1: Hoare triple {456#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {596#(bvsgt (bvadd (_ bv4294967295 32) |ULTIMATE.start_sll_create_~len#1|) (_ bv0 32))} is VALID [2022-02-20 16:56:35,251 INFO L290 TraceCheckUtils]: 0: Hoare triple {456#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32); {456#true} is VALID [2022-02-20 16:56:35,252 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2022-02-20 16:56:35,252 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:35,252 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1900504245] [2022-02-20 16:56:35,252 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1900504245] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:56:35,252 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:56:35,252 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 6 [2022-02-20 16:56:35,254 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1959971866] [2022-02-20 16:56:35,254 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:56:35,254 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 16:56:35,255 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:35,255 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:35,304 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 37 edges. 37 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:35,304 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:56:35,304 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:35,305 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:56:35,305 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:35,305 INFO L87 Difference]: Start difference. First operand 25 states and 30 transitions. Second operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:35,525 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:35,525 INFO L93 Difference]: Finished difference Result 50 states and 61 transitions. [2022-02-20 16:56:35,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:56:35,532 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2022-02-20 16:56:35,532 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:35,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:35,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 16:56:35,534 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:35,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 61 transitions. [2022-02-20 16:56:35,536 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 61 transitions. [2022-02-20 16:56:35,623 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 61 edges. 61 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:35,624 INFO L225 Difference]: With dead ends: 50 [2022-02-20 16:56:35,624 INFO L226 Difference]: Without dead ends: 32 [2022-02-20 16:56:35,624 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 54 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:56:35,625 INFO L933 BasicCegarLoop]: 31 mSDtfsCounter, 7 mSDsluCounter, 51 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 82 SdHoareTripleChecker+Invalid, 24 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:35,625 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [9 Valid, 82 Invalid, 24 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:35,625 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2022-02-20 16:56:35,628 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 29. [2022-02-20 16:56:35,628 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:35,628 INFO L82 GeneralOperation]: Start isEquivalent. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:35,628 INFO L74 IsIncluded]: Start isIncluded. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:35,628 INFO L87 Difference]: Start difference. First operand 32 states. Second operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:35,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:35,630 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 16:56:35,630 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 16:56:35,630 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:35,630 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:35,630 INFO L74 IsIncluded]: Start isIncluded. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 16:56:35,631 INFO L87 Difference]: Start difference. First operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 32 states. [2022-02-20 16:56:35,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:35,632 INFO L93 Difference]: Finished difference Result 32 states and 39 transitions. [2022-02-20 16:56:35,632 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 39 transitions. [2022-02-20 16:56:35,633 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:35,633 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:35,633 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:35,633 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:35,633 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.2083333333333333) internal successors, (29), 24 states have internal predecessors, (29), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:35,634 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 35 transitions. [2022-02-20 16:56:35,634 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 35 transitions. Word has length 28 [2022-02-20 16:56:35,634 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:35,634 INFO L470 AbstractCegarLoop]: Abstraction has 29 states and 35 transitions. [2022-02-20 16:56:35,635 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.833333333333333) internal successors, (29), 6 states have internal predecessors, (29), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2022-02-20 16:56:35,635 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 35 transitions. [2022-02-20 16:56:35,635 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2022-02-20 16:56:35,635 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:35,636 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:35,659 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Ended with exit code 0 [2022-02-20 16:56:35,844 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:35,845 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:35,845 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:35,845 INFO L85 PathProgramCache]: Analyzing trace with hash -941011836, now seen corresponding path program 2 times [2022-02-20 16:56:35,845 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:35,846 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1126082411] [2022-02-20 16:56:35,846 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:56:35,846 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:35,846 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:35,847 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:35,879 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2022-02-20 16:56:35,968 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 16:56:35,968 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:56:35,971 INFO L263 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 4 conjunts are in the unsatisfiable core [2022-02-20 16:56:35,987 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:35,988 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:36,083 INFO L290 TraceCheckUtils]: 0: Hoare triple {798#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32); {798#true} is VALID [2022-02-20 16:56:36,084 INFO L290 TraceCheckUtils]: 1: Hoare triple {798#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,084 INFO L290 TraceCheckUtils]: 2: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,084 INFO L272 TraceCheckUtils]: 3: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {798#true} is VALID [2022-02-20 16:56:36,084 INFO L290 TraceCheckUtils]: 4: Hoare triple {798#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {798#true} is VALID [2022-02-20 16:56:36,084 INFO L290 TraceCheckUtils]: 5: Hoare triple {798#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {798#true} is VALID [2022-02-20 16:56:36,084 INFO L290 TraceCheckUtils]: 6: Hoare triple {798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {798#true} is VALID [2022-02-20 16:56:36,085 INFO L290 TraceCheckUtils]: 7: Hoare triple {798#true} assume true; {798#true} is VALID [2022-02-20 16:56:36,085 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {798#true} {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #97#return; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,086 INFO L290 TraceCheckUtils]: 9: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,086 INFO L290 TraceCheckUtils]: 10: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,088 INFO L290 TraceCheckUtils]: 11: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,088 INFO L272 TraceCheckUtils]: 12: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {798#true} is VALID [2022-02-20 16:56:36,088 INFO L290 TraceCheckUtils]: 13: Hoare triple {798#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {798#true} is VALID [2022-02-20 16:56:36,088 INFO L290 TraceCheckUtils]: 14: Hoare triple {798#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {798#true} is VALID [2022-02-20 16:56:36,089 INFO L290 TraceCheckUtils]: 15: Hoare triple {798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {798#true} is VALID [2022-02-20 16:56:36,089 INFO L290 TraceCheckUtils]: 16: Hoare triple {798#true} assume true; {798#true} is VALID [2022-02-20 16:56:36,089 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {798#true} {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} #97#return; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,090 INFO L290 TraceCheckUtils]: 18: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,090 INFO L290 TraceCheckUtils]: 19: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,090 INFO L290 TraceCheckUtils]: 20: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} assume !~bvsgt32(sll_create_~len#1, 0bv32); {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,091 INFO L290 TraceCheckUtils]: 21: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} is VALID [2022-02-20 16:56:36,091 INFO L290 TraceCheckUtils]: 22: Hoare triple {806#(= (_ bv2 32) |ULTIMATE.start_main_~len~0#1|)} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, ~bvsdiv32(main_~len~0#1, 2bv32);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} is VALID [2022-02-20 16:56:36,091 INFO L272 TraceCheckUtils]: 23: Hoare triple {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {798#true} is VALID [2022-02-20 16:56:36,092 INFO L290 TraceCheckUtils]: 24: Hoare triple {798#true} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {798#true} is VALID [2022-02-20 16:56:36,092 INFO L290 TraceCheckUtils]: 25: Hoare triple {798#true} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {798#true} is VALID [2022-02-20 16:56:36,092 INFO L290 TraceCheckUtils]: 26: Hoare triple {798#true} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {798#true} is VALID [2022-02-20 16:56:36,092 INFO L290 TraceCheckUtils]: 27: Hoare triple {798#true} assume true; {798#true} is VALID [2022-02-20 16:56:36,094 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {798#true} {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} #99#return; {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} is VALID [2022-02-20 16:56:36,103 INFO L290 TraceCheckUtils]: 29: Hoare triple {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} is VALID [2022-02-20 16:56:36,104 INFO L290 TraceCheckUtils]: 30: Hoare triple {870#(= (_ bv1 32) |ULTIMATE.start_sll_insert_~index#1|)} assume !~bvsgt32(sll_insert_~index#1, 0bv32); {799#false} is VALID [2022-02-20 16:56:36,104 INFO L290 TraceCheckUtils]: 31: Hoare triple {799#false} assume sll_insert_~snd_to_last~0#1.base != 0bv32 || sll_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, ~bvadd32(4bv32, sll_insert_~snd_to_last~0#1.offset), 4bv32); {799#false} is VALID [2022-02-20 16:56:36,104 INFO L290 TraceCheckUtils]: 32: Hoare triple {799#false} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, ~bvadd32(4bv32, sll_insert_~new_node~0#1.offset), 4bv32); {799#false} is VALID [2022-02-20 16:56:36,104 INFO L290 TraceCheckUtils]: 33: Hoare triple {799#false} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0bv32; {799#false} is VALID [2022-02-20 16:56:36,105 INFO L290 TraceCheckUtils]: 34: Hoare triple {799#false} assume !(main_~ptr~0#1.base != 0bv32 || main_~ptr~0#1.offset != 0bv32); {799#false} is VALID [2022-02-20 16:56:36,105 INFO L290 TraceCheckUtils]: 35: Hoare triple {799#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {799#false} is VALID [2022-02-20 16:56:36,105 INFO L290 TraceCheckUtils]: 36: Hoare triple {799#false} assume !false; {799#false} is VALID [2022-02-20 16:56:36,105 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2022-02-20 16:56:36,105 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:56:36,105 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:36,105 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1126082411] [2022-02-20 16:56:36,106 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1126082411] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:56:36,106 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:56:36,106 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2022-02-20 16:56:36,106 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448962704] [2022-02-20 16:56:36,106 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:56:36,106 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-02-20 16:56:36,107 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:56:36,107 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:36,142 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:36,142 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2022-02-20 16:56:36,142 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:56:36,143 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2022-02-20 16:56:36,143 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2022-02-20 16:56:36,143 INFO L87 Difference]: Start difference. First operand 29 states and 35 transitions. Second operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:36,281 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:36,281 INFO L93 Difference]: Finished difference Result 38 states and 47 transitions. [2022-02-20 16:56:36,281 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2022-02-20 16:56:36,282 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 37 [2022-02-20 16:56:36,282 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:56:36,282 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:36,283 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-02-20 16:56:36,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:36,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 41 transitions. [2022-02-20 16:56:36,284 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 41 transitions. [2022-02-20 16:56:36,336 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 41 edges. 41 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:56:36,337 INFO L225 Difference]: With dead ends: 38 [2022-02-20 16:56:36,338 INFO L226 Difference]: Without dead ends: 30 [2022-02-20 16:56:36,338 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 34 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 16:56:36,339 INFO L933 BasicCegarLoop]: 26 mSDtfsCounter, 14 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 56 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:56:36,339 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [14 Valid, 56 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:56:36,339 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2022-02-20 16:56:36,341 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2022-02-20 16:56:36,341 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:56:36,341 INFO L82 GeneralOperation]: Start isEquivalent. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:36,342 INFO L74 IsIncluded]: Start isIncluded. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:36,342 INFO L87 Difference]: Start difference. First operand 30 states. Second operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:36,343 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:36,343 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:56:36,343 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:56:36,343 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:36,343 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:36,343 INFO L74 IsIncluded]: Start isIncluded. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 16:56:36,343 INFO L87 Difference]: Start difference. First operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand 30 states. [2022-02-20 16:56:36,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:56:36,345 INFO L93 Difference]: Finished difference Result 30 states and 36 transitions. [2022-02-20 16:56:36,345 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:56:36,345 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:56:36,345 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:56:36,345 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:56:36,345 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:56:36,346 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2022-02-20 16:56:36,347 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2022-02-20 16:56:36,347 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 37 [2022-02-20 16:56:36,347 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:56:36,347 INFO L470 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2022-02-20 16:56:36,347 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 5.0) internal successors, (20), 4 states have internal predecessors, (20), 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 16:56:36,347 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2022-02-20 16:56:36,348 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2022-02-20 16:56:36,348 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:56:36,348 INFO L514 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:56:36,379 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (5)] Ended with exit code 0 [2022-02-20 16:56:36,556 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:36,558 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:56:36,558 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:56:36,558 INFO L85 PathProgramCache]: Analyzing trace with hash 1457377551, now seen corresponding path program 1 times [2022-02-20 16:56:36,559 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:56:36,559 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [46704624] [2022-02-20 16:56:36,559 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:36,559 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:56:36,559 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:56:36,560 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:56:36,562 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2022-02-20 16:56:36,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:36,725 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 26 conjunts are in the unsatisfiable core [2022-02-20 16:56:36,756 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:36,758 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:37,117 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2022-02-20 16:56:37,477 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:37,479 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 22 treesize of output 22 [2022-02-20 16:56:37,969 INFO L356 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2022-02-20 16:56:37,969 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 27 [2022-02-20 16:56:38,115 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:38,116 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 22 treesize of output 22 [2022-02-20 16:56:38,320 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2022-02-20 16:56:38,417 INFO L290 TraceCheckUtils]: 0: Hoare triple {1068#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(21bv32, 2bv32); {1068#true} is VALID [2022-02-20 16:56:38,417 INFO L290 TraceCheckUtils]: 1: Hoare triple {1068#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~ret11#1.base, main_#t~ret11#1.offset, main_#t~mem12#1.base, main_#t~mem12#1.offset, main_#t~mem13#1.base, main_#t~mem13#1.offset, main_#t~mem14#1, main_#t~post15#1, main_~temp~2#1.base, main_~temp~2#1.offset, main_#t~mem16#1.base, main_#t~mem16#1.offset, main_~len~0#1, main_~data~0#1, main_~#s~0#1.base, main_~#s~0#1.offset, main_~ptr~0#1.base, main_~ptr~0#1.offset, main_~count~0#1;main_~len~0#1 := 2bv32;main_~data~0#1 := 1bv32;call main_~#s~0#1.base, main_~#s~0#1.offset := #Ultimate.allocOnStack(4bv32);assume { :begin_inline_sll_create } true;sll_create_#in~len#1, sll_create_#in~data#1 := main_~len~0#1, main_~data~0#1;havoc sll_create_#res#1.base, sll_create_#res#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset, sll_create_#t~post4#1, sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset, sll_create_~len#1, sll_create_~data#1, sll_create_~head~0#1.base, sll_create_~head~0#1.offset;sll_create_~len#1 := sll_create_#in~len#1;sll_create_~data#1 := sll_create_#in~data#1;sll_create_~head~0#1.base, sll_create_~head~0#1.offset := 0bv32, 0bv32; {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:38,418 INFO L290 TraceCheckUtils]: 2: Hoare triple {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:38,418 INFO L272 TraceCheckUtils]: 3: Hoare triple {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:56:38,419 INFO L290 TraceCheckUtils]: 4: Hoare triple {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:56:38,419 INFO L290 TraceCheckUtils]: 5: Hoare triple {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:56:38,419 INFO L290 TraceCheckUtils]: 6: Hoare triple {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:56:38,420 INFO L290 TraceCheckUtils]: 7: Hoare triple {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} assume true; {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:56:38,420 INFO L284 TraceCheckUtils]: 8: Hoare quadruple {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #97#return; {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:38,421 INFO L290 TraceCheckUtils]: 9: Hoare triple {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:38,421 INFO L290 TraceCheckUtils]: 10: Hoare triple {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:38,421 INFO L290 TraceCheckUtils]: 11: Hoare triple {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} assume !!~bvsgt32(sll_create_~len#1, 0bv32); {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} is VALID [2022-02-20 16:56:38,422 INFO L272 TraceCheckUtils]: 12: Hoare triple {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} call sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset := node_create(sll_create_~data#1); {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} is VALID [2022-02-20 16:56:38,423 INFO L290 TraceCheckUtils]: 13: Hoare triple {1083#(not (= |#StackHeapBarrier| (_ bv4294967295 32)))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1114#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:56:38,423 INFO L290 TraceCheckUtils]: 14: Hoare triple {1114#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1114#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:56:38,424 INFO L290 TraceCheckUtils]: 15: Hoare triple {1114#(and (not (= (_ bv0 32) |node_create_~temp~0#1.base|)) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1121#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:56:38,424 INFO L290 TraceCheckUtils]: 16: Hoare triple {1121#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {1121#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:56:38,425 INFO L284 TraceCheckUtils]: 17: Hoare quadruple {1121#(and (not (= |node_create_#res#1.base| (_ bv0 32))) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {1076#(bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|)} #97#return; {1128#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_#t~ret5#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:56:38,426 INFO L290 TraceCheckUtils]: 18: Hoare triple {1128#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_#t~ret5#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_#t~ret5#1.base| (_ bv0 32))))} sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset := sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;havoc sll_create_#t~ret5#1.base, sll_create_#t~ret5#1.offset;call write~$Pointer$(sll_create_~head~0#1.base, sll_create_~head~0#1.offset, sll_create_~new_head~0#1.base, ~bvadd32(4bv32, sll_create_~new_head~0#1.offset), 4bv32);sll_create_~head~0#1.base, sll_create_~head~0#1.offset := sll_create_~new_head~0#1.base, sll_create_~new_head~0#1.offset; {1132#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:56:38,426 INFO L290 TraceCheckUtils]: 19: Hoare triple {1132#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32))))} sll_create_#t~post4#1 := sll_create_~len#1;sll_create_~len#1 := ~bvsub32(sll_create_#t~post4#1, 1bv32);havoc sll_create_#t~post4#1; {1132#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:56:38,426 INFO L290 TraceCheckUtils]: 20: Hoare triple {1132#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32))))} assume !~bvsgt32(sll_create_~len#1, 0bv32); {1132#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:56:38,427 INFO L290 TraceCheckUtils]: 21: Hoare triple {1132#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_~head~0#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_~head~0#1.base| (_ bv0 32))))} sll_create_#res#1.base, sll_create_#res#1.offset := sll_create_~head~0#1.base, sll_create_~head~0#1.offset; {1142#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_#res#1.base| (_ bv0 32))))} is VALID [2022-02-20 16:56:38,428 INFO L290 TraceCheckUtils]: 22: Hoare triple {1142#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult |ULTIMATE.start_sll_create_#res#1.base| |#StackHeapBarrier|) (not (= |ULTIMATE.start_sll_create_#res#1.base| (_ bv0 32))))} main_#t~ret11#1.base, main_#t~ret11#1.offset := sll_create_#res#1.base, sll_create_#res#1.offset;assume { :end_inline_sll_create } true;call write~init~$Pointer$(main_#t~ret11#1.base, main_#t~ret11#1.offset, main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);havoc main_#t~ret11#1.base, main_#t~ret11#1.offset;assume { :begin_inline_sll_insert } true;sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset, sll_insert_#in~data#1, sll_insert_#in~index#1 := main_~#s~0#1.base, main_~#s~0#1.offset, main_~data~0#1, ~bvsdiv32(main_~len~0#1, 2bv32);havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset, sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset, sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset, sll_insert_#t~post10#1, sll_insert_~head#1.base, sll_insert_~head#1.offset, sll_insert_~data#1, sll_insert_~index#1, sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset, sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;sll_insert_~head#1.base, sll_insert_~head#1.offset := sll_insert_#in~head#1.base, sll_insert_#in~head#1.offset;sll_insert_~data#1 := sll_insert_#in~data#1;sll_insert_~index#1 := sll_insert_#in~index#1; {1146#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|))} is VALID [2022-02-20 16:56:38,430 INFO L272 TraceCheckUtils]: 23: Hoare triple {1146#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|))} call sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset := node_create(sll_insert_~data#1); {1150#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:56:38,432 INFO L290 TraceCheckUtils]: 24: Hoare triple {1150#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} ~data#1 := #in~data#1;call #t~malloc3#1.base, #t~malloc3#1.offset := #Ultimate.allocOnHeap(8bv32);~temp~0#1.base, ~temp~0#1.offset := #t~malloc3#1.base, #t~malloc3#1.offset;havoc #t~malloc3#1.base, #t~malloc3#1.offset; {1154#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:56:38,434 INFO L290 TraceCheckUtils]: 25: Hoare triple {1154#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} assume !(0bv32 == ~temp~0#1.base && 0bv32 == ~temp~0#1.offset); {1154#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} is VALID [2022-02-20 16:56:38,443 INFO L290 TraceCheckUtils]: 26: Hoare triple {1154#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (bvult |node_create_~temp~0#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))) (= |old(#memory_$Pointer$.base)| |#memory_$Pointer$.base|))} call write~$Pointer$(0bv32, 0bv32, ~temp~0#1.base, ~bvadd32(4bv32, ~temp~0#1.offset), 4bv32);call write~intINTTYPE4(~data#1, ~temp~0#1.base, ~temp~0#1.offset, 4bv32);#res#1.base, #res#1.offset := ~temp~0#1.base, ~temp~0#1.offset; {1161#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (exists ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_221) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:56:38,445 INFO L290 TraceCheckUtils]: 27: Hoare triple {1161#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (exists ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_221) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} assume true; {1161#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (exists ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_221) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} is VALID [2022-02-20 16:56:38,464 INFO L284 TraceCheckUtils]: 28: Hoare quadruple {1161#(and (exists ((v_arrayElimCell_1 (_ BitVec 32))) (and (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (exists ((v_ArrVal_221 (Array (_ BitVec 32) (_ BitVec 32)))) (= (store |old(#memory_$Pointer$.base)| |node_create_#res#1.base| v_ArrVal_221) |#memory_$Pointer$.base|)) (bvult |node_create_#res#1.base| |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))} {1146#(and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|))} #99#return; {1168#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_#t~ret7#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 16:56:38,472 INFO L290 TraceCheckUtils]: 29: Hoare triple {1168#(and (= |ULTIMATE.start_main_~#s~0#1.offset| |ULTIMATE.start_sll_insert_~head#1.offset|) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_#t~ret7#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_main_~#s~0#1.base| |ULTIMATE.start_sll_insert_~head#1.base|) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset := sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;havoc sll_insert_#t~ret7#1.base, sll_insert_#t~ret7#1.offset;sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := 0bv32, 0bv32;call sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset := read~$Pointer$(sll_insert_~head#1.base, sll_insert_~head#1.offset, 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset;havoc sll_insert_#t~mem8#1.base, sll_insert_#t~mem8#1.offset; {1172#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_sll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 16:56:38,482 INFO L290 TraceCheckUtils]: 30: Hoare triple {1172#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (= |ULTIMATE.start_sll_insert_~last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} assume !!~bvsgt32(sll_insert_~index#1, 0bv32);sll_insert_~snd_to_last~0#1.base, sll_insert_~snd_to_last~0#1.offset := sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset;call sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset := read~$Pointer$(sll_insert_~last~0#1.base, ~bvadd32(4bv32, sll_insert_~last~0#1.offset), 4bv32);sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset := sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset;havoc sll_insert_#t~mem9#1.base, sll_insert_#t~mem9#1.offset;sll_insert_#t~post10#1 := sll_insert_~index#1;sll_insert_~index#1 := ~bvsub32(sll_insert_#t~post10#1, 1bv32);havoc sll_insert_#t~post10#1; {1176#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:56:38,633 INFO L290 TraceCheckUtils]: 31: Hoare triple {1176#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume !~bvsgt32(sll_insert_~index#1, 0bv32); {1176#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} is VALID [2022-02-20 16:56:38,657 INFO L290 TraceCheckUtils]: 32: Hoare triple {1176#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))) (= |ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|)))} assume sll_insert_~snd_to_last~0#1.base != 0bv32 || sll_insert_~snd_to_last~0#1.offset != 0bv32;call write~$Pointer$(sll_insert_~new_node~0#1.base, sll_insert_~new_node~0#1.offset, sll_insert_~snd_to_last~0#1.base, ~bvadd32(4bv32, sll_insert_~snd_to_last~0#1.offset), 4bv32); {1183#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 16:56:38,689 INFO L290 TraceCheckUtils]: 33: Hoare triple {1183#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (bvult |ULTIMATE.start_sll_insert_~new_node~0#1.base| |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} call write~$Pointer$(sll_insert_~last~0#1.base, sll_insert_~last~0#1.offset, sll_insert_~new_node~0#1.base, ~bvadd32(4bv32, sll_insert_~new_node~0#1.offset), 4bv32); {1187#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} is VALID [2022-02-20 16:56:38,694 INFO L290 TraceCheckUtils]: 34: Hoare triple {1187#(and (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |#StackHeapBarrier| |ULTIMATE.start_main_~#s~0#1.base|) (bvult (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|))) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~#s~0#1.base|) |ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32))))} assume { :end_inline_sll_insert } true;call main_#t~mem12#1.base, main_#t~mem12#1.offset := read~$Pointer$(main_~#s~0#1.base, main_~#s~0#1.offset, 4bv32);main_~ptr~0#1.base, main_~ptr~0#1.offset := main_#t~mem12#1.base, main_#t~mem12#1.offset;havoc main_#t~mem12#1.base, main_#t~mem12#1.offset;main_~count~0#1 := 0bv32; {1191#(and (not (= (_ bv0 32) |ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~ptr~0#1.base| |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))))} is VALID [2022-02-20 16:56:38,695 INFO L290 TraceCheckUtils]: 35: Hoare triple {1191#(and (not (= (_ bv0 32) |ULTIMATE.start_main_~ptr~0#1.base|)) (exists ((|#StackHeapBarrier| (_ BitVec 32)) (v_arrayElimCell_1 (_ BitVec 32))) (and (bvult |ULTIMATE.start_main_~ptr~0#1.base| |#StackHeapBarrier|) (not (= v_arrayElimCell_1 (_ bv0 32))) (bvult v_arrayElimCell_1 |#StackHeapBarrier|) (not (= |#StackHeapBarrier| (_ bv4294967295 32))))))} assume !(main_~ptr~0#1.base != 0bv32 || main_~ptr~0#1.offset != 0bv32); {1069#false} is VALID [2022-02-20 16:56:38,695 INFO L290 TraceCheckUtils]: 36: Hoare triple {1069#false} assume main_~count~0#1 != ~bvadd32(1bv32, main_~len~0#1); {1069#false} is VALID [2022-02-20 16:56:38,695 INFO L290 TraceCheckUtils]: 37: Hoare triple {1069#false} assume !false; {1069#false} is VALID [2022-02-20 16:56:38,695 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 14 proven. 5 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2022-02-20 16:56:38,695 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:56:38,759 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-02-20 16:56:38,770 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~snd_to_last~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-02-20 16:56:38,786 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (select (select (store (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~last~0#1.base| v_ArrVal_222) |c_ULTIMATE.start_sll_insert_~new_node~0#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) (_ bv0 32)))) is different from false [2022-02-20 16:56:38,797 WARN L838 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_222 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_223 (Array (_ BitVec 32) (_ BitVec 32)))) (not (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_insert_~head#1.base|) |c_ULTIMATE.start_sll_insert_~head#1.offset|) v_ArrVal_222) |c_ULTIMATE.start_sll_insert_#t~ret7#1.base| v_ArrVal_223) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) is different from false [2022-02-20 16:56:38,951 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:56:38,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [46704624] [2022-02-20 16:56:38,951 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [46704624] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:56:38,951 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleCvc4 [1913424330] [2022-02-20 16:56:38,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:56:38,951 INFO L173 SolverBuilder]: Constructing external solver with command: cvc4 --incremental --print-success --lang smt [2022-02-20 16:56:38,951 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 [2022-02-20 16:56:38,972 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (exit command is (exit), workingDir is null) [2022-02-20 16:56:38,992 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Waiting until timeout for monitored process [2022-02-20 16:56:39,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:39,214 INFO L263 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 28 conjunts are in the unsatisfiable core [2022-02-20 16:56:39,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:56:39,242 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:56:39,918 INFO L356 Elim1Store]: treesize reduction 23, result has 47.7 percent of original size [2022-02-20 16:56:39,918 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 2 new quantified variables, introduced 1 case distinctions, treesize of input 53 treesize of output 57 [2022-02-20 16:56:39,934 INFO L356 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2022-02-20 16:56:39,934 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 56 [2022-02-20 16:56:39,970 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2022-02-20 16:56:40,052 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 24 [2022-02-20 16:56:40,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:40,294 INFO L356 Elim1Store]: treesize reduction 19, result has 32.1 percent of original size [2022-02-20 16:56:40,294 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 84 treesize of output 82 [2022-02-20 16:56:40,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:56:40,308 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 88 [2022-02-20 16:56:40,324 WARN L325 FreeRefinementEngine]: Global settings require throwing the following exception [2022-02-20 16:56:40,348 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:56:40,539 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Ended with exit code 0 [2022-02-20 16:56:40,734 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/cvc4 --incremental --print-success --lang smt,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:56:40,734 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: Should have been eliminated by DER at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.ElimStorePlain.applyComplexEliminationRules(ElimStorePlain.java:353) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:184) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne3(DualJunctionSaa.java:166) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne2(DualJunctionSaa.java:154) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne1(DualJunctionSaa.java:142) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne0(DualJunctionSaa.java:126) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminateOne(DualJunctionSaa.java:110) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryExhaustivelyToEliminate(DualJunctionSaa.java:95) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.DualJunctionSaa.tryToEliminate(DualJunctionSaa.java:90) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToEliminateOne(QuantifierPusher.java:904) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyNewEliminationTechniquesExhaustively(QuantifierPusher.java:865) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.applyDualJunctionEliminationTechniques(QuantifierPusher.java:783) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective2(QuantifierPusher.java:425) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher.tryToPushOverDualFiniteConnective(QuantifierPusher.java:355) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:172) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.convert(QuantifierPushTermWalker.java:1) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine$ApplicationTermTask.doStep(TermContextTransformationEngine.java:169) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:77) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.TermContextTransformationEngine.transform(TermContextTransformationEngine.java:61) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:261) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.QuantifierPushTermWalker.eliminate(QuantifierPushTermWalker.java:247) at de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.PartialQuantifierElimination.eliminate(PartialQuantifierElimination.java:92) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer$QuantifierEliminationPostprocessor.postprocess(IterativePredicateTransformer.java:238) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.applyPostprocessors(IterativePredicateTransformer.java:420) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.predicates.IterativePredicateTransformer.computeStrongestPostconditionSequence(IterativePredicateTransformer.java:199) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolantsUsingUnsatCore(TraceCheckSpWp.java:299) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.computeInterpolants(TraceCheckSpWp.java:185) at de.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.singletracecheck.TraceCheckSpWp.(TraceCheckSpWp.java:163) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:108) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleSpWp.construct(IpTcStrategyModuleSpWp.java:1) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getOrConstruct(IpTcStrategyModuleBase.java:100) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.IpTcStrategyModuleBase.getInterpolantComputationStatus(IpTcStrategyModuleBase.java:76) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.tryExecuteInterpolantGenerator(AutomatonFreeRefinementEngine.java:273) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.generateProof(AutomatonFreeRefinementEngine.java:155) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.executeStrategy(AutomatonFreeRefinementEngine.java:145) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.AutomatonFreeRefinementEngine.(AutomatonFreeRefinementEngine.java:93) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.tracehandling.TraceAbstractionRefinementEngine.(TraceAbstractionRefinementEngine.java:79) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.BasicCegarLoop.isCounterexampleFeasible(BasicCegarLoop.java:610) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.iterate(AbstractCegarLoop.java:413) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.startCegar(AbstractCegarLoop.java:348) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.AbstractCegarLoop.runCegar(AbstractCegarLoop.java:330) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopUtils.getCegarLoopResult(CegarLoopUtils.java:56) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.executeCegarLoop(TraceAbstractionStarter.java:414) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseProgram(TraceAbstractionStarter.java:304) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.analyseSequentialProgram(TraceAbstractionStarter.java:264) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:177) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:56:40,739 INFO L158 Benchmark]: Toolchain (without parser) took 8432.60ms. Allocated memory was 54.5MB in the beginning and 104.9MB in the end (delta: 50.3MB). Free memory was 30.8MB in the beginning and 81.3MB in the end (delta: -50.5MB). Peak memory consumption was 48.7MB. Max. memory is 16.1GB. [2022-02-20 16:56:40,739 INFO L158 Benchmark]: CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 35.8MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:56:40,739 INFO L158 Benchmark]: CACSL2BoogieTranslator took 407.36ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.5MB in the beginning and 45.3MB in the end (delta: -14.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. [2022-02-20 16:56:40,739 INFO L158 Benchmark]: Boogie Procedure Inliner took 53.16ms. Allocated memory is still 71.3MB. Free memory was 45.3MB in the beginning and 42.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:40,739 INFO L158 Benchmark]: Boogie Preprocessor took 55.87ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 40.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:40,739 INFO L158 Benchmark]: RCFGBuilder took 498.78ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 38.3MB in the end (delta: 2.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. [2022-02-20 16:56:40,740 INFO L158 Benchmark]: TraceAbstraction took 7401.85ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 37.7MB in the beginning and 81.3MB in the end (delta: -43.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. [2022-02-20 16:56:40,741 INFO L339 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - AssertionsEnabledResult: Assertions are enabled Assertions are enabled - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.14ms. Allocated memory is still 54.5MB. Free memory was 35.8MB in the beginning and 35.8MB in the end (delta: 38.2kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 407.36ms. Allocated memory was 54.5MB in the beginning and 71.3MB in the end (delta: 16.8MB). Free memory was 30.5MB in the beginning and 45.3MB in the end (delta: -14.8MB). Peak memory consumption was 5.7MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 53.16ms. Allocated memory is still 71.3MB. Free memory was 45.3MB in the beginning and 42.9MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 55.87ms. Allocated memory is still 71.3MB. Free memory was 42.9MB in the beginning and 40.5MB in the end (delta: 2.4MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * RCFGBuilder took 498.78ms. Allocated memory is still 71.3MB. Free memory was 40.5MB in the beginning and 38.3MB in the end (delta: 2.2MB). Peak memory consumption was 6.7MB. Max. memory is 16.1GB. * TraceAbstraction took 7401.85ms. Allocated memory was 71.3MB in the beginning and 104.9MB in the end (delta: 33.6MB). Free memory was 37.7MB in the beginning and 81.3MB in the end (delta: -43.6MB). Peak memory consumption was 40.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: Should have been eliminated by DER: de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.DerPreprocessor.(DerPreprocessor.java:113) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:56:40,767 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Forceful destruction successful, exit code 0 Received shutdown request... --- End real Ultimate output --- Execution finished normally Writing output log to file Ultimate.log Result: ERROR: ExceptionOrErrorResult: AssertionError: Should have been eliminated by DER