./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/heap-manipulation/merge_sort-1.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/heap-manipulation/merge_sort-1.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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:48:14,354 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:48:14,356 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:48:14,396 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:48:14,396 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:48:14,400 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:48:14,401 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:48:14,403 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:48:14,405 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:48:14,409 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:48:14,410 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:48:14,411 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:48:14,411 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:48:14,413 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:48:14,414 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:48:14,417 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:48:14,418 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:48:14,418 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:48:14,420 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:48:14,426 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:48:14,427 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:48:14,428 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:48:14,429 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:48:14,430 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:48:14,435 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:48:14,436 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:48:14,436 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:48:14,438 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:48:14,438 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:48:14,439 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:48:14,439 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:48:14,440 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:48:14,441 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:48:14,442 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:48:14,443 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:48:14,443 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:48:14,444 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:48:14,444 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:48:14,445 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:48:14,445 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:48:14,446 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:48:14,448 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:48:14,478 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:48:14,478 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:48:14,479 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:48:14,479 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:48:14,480 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:48:14,480 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:48:14,481 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:48:14,481 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:48:14,481 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:48:14,481 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:48:14,482 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:48:14,482 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2022-02-20 16:48:14,482 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:48:14,482 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:48:14,483 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:48:14,483 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:48:14,483 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:48:14,483 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:48:14,483 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:48:14,484 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:48:14,484 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:48:14,484 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:48:14,484 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:48:14,484 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:48:14,485 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:48:14,485 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:48:14,485 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:48:14,486 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:48:14,486 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2022-02-20 16:48:14,487 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2022-02-20 16:48:14,487 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:48:14,487 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:48:14,487 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:48:14,488 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2022-02-20 16:48:14,706 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:48:14,723 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:48:14,725 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:48:14,726 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:48:14,726 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:48:14,727 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 16:48:14,784 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e8946ca/32d4112cc7f54afd94fe26c634246d41/FLAGa819eff65 [2022-02-20 16:48:15,250 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:48:15,250 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 16:48:15,260 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e8946ca/32d4112cc7f54afd94fe26c634246d41/FLAGa819eff65 [2022-02-20 16:48:15,573 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e7e8946ca/32d4112cc7f54afd94fe26c634246d41 [2022-02-20 16:48:15,576 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:48:15,577 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:48:15,583 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:48:15,583 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:48:15,586 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:48:15,587 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:48:15" (1/1) ... [2022-02-20 16:48:15,588 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@37877fc9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:15, skipping insertion in model container [2022-02-20 16:48:15,588 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:48:15" (1/1) ... [2022-02-20 16:48:15,593 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:48:15,631 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:48:15,958 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 16:48:16,020 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:48:16,031 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:48:16,067 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 16:48:16,096 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:48:16,124 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:48:16,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16 WrapperNode [2022-02-20 16:48:16,125 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:48:16,127 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:48:16,127 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:48:16,127 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:48:16,134 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:48:16" (1/1) ... [2022-02-20 16:48:16,162 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:48:16" (1/1) ... [2022-02-20 16:48:16,196 INFO L137 Inliner]: procedures = 125, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 285 [2022-02-20 16:48:16,197 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:48:16,198 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:48:16,198 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:48:16,198 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:48:16,205 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,206 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,225 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,229 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,240 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,256 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,260 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,267 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:48:16,268 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:48:16,268 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:48:16,269 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:48:16,274 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (1/1) ... [2022-02-20 16:48:16,280 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:48:16,289 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:16,309 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:48:16,333 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:48:16,344 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2022-02-20 16:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-02-20 16:48:16,345 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-02-20 16:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-02-20 16:48:16,345 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-02-20 16:48:16,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:48:16,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2022-02-20 16:48:16,347 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:48:16,347 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:48:16,453 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:48:16,472 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:48:16,861 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:48:16,868 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:48:16,868 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-02-20 16:48:16,870 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:48:16 BoogieIcfgContainer [2022-02-20 16:48:16,870 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:48:16,871 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:48:16,871 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:48:16,874 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:48:16,874 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:48:15" (1/3) ... [2022-02-20 16:48:16,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c1fde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:48:16, skipping insertion in model container [2022-02-20 16:48:16,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:16" (2/3) ... [2022-02-20 16:48:16,875 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@54c1fde7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:48:16, skipping insertion in model container [2022-02-20 16:48:16,875 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:48:16" (3/3) ... [2022-02-20 16:48:16,876 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-02-20 16:48:16,880 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:48:16,881 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:48:16,913 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:48:16,918 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:48:16,918 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:48:16,936 INFO L276 IsEmpty]: Start isEmpty. Operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 16:48:16,941 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:48:16,942 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:16,942 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:16,943 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:16,950 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:16,951 INFO L85 PathProgramCache]: Analyzing trace with hash 2117458630, now seen corresponding path program 1 times [2022-02-20 16:48:16,960 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:16,961 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209753302] [2022-02-20 16:48:16,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:16,962 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:17,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:17,092 INFO L290 TraceCheckUtils]: 0: Hoare triple {99#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {99#true} is VALID [2022-02-20 16:48:17,093 INFO L290 TraceCheckUtils]: 1: Hoare triple {99#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {99#true} is VALID [2022-02-20 16:48:17,094 INFO L290 TraceCheckUtils]: 2: Hoare triple {99#true} assume !true; {100#false} is VALID [2022-02-20 16:48:17,094 INFO L290 TraceCheckUtils]: 3: Hoare triple {100#false} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {100#false} is VALID [2022-02-20 16:48:17,094 INFO L290 TraceCheckUtils]: 4: Hoare triple {100#false} assume inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0; {100#false} is VALID [2022-02-20 16:48:17,095 INFO L272 TraceCheckUtils]: 5: Hoare triple {100#false} call fail(); {100#false} is VALID [2022-02-20 16:48:17,095 INFO L290 TraceCheckUtils]: 6: Hoare triple {100#false} assume !false; {100#false} is VALID [2022-02-20 16:48:17,097 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:48:17,097 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:17,098 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209753302] [2022-02-20 16:48:17,099 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209753302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:17,099 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:17,099 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:48:17,101 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942000819] [2022-02-20 16:48:17,102 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:17,106 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:48:17,108 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:17,110 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,131 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:17,132 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:48:17,132 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:17,151 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:48:17,152 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:48:17,158 INFO L87 Difference]: Start difference. First operand has 96 states, 77 states have (on average 1.8051948051948052) internal successors, (139), 93 states have internal predecessors, (139), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,341 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:17,341 INFO L93 Difference]: Finished difference Result 188 states and 335 transitions. [2022-02-20 16:48:17,342 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:48:17,342 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:48:17,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:17,343 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,366 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2022-02-20 16:48:17,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,375 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 335 transitions. [2022-02-20 16:48:17,375 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 335 transitions. [2022-02-20 16:48:17,702 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 335 edges. 335 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:17,722 INFO L225 Difference]: With dead ends: 188 [2022-02-20 16:48:17,723 INFO L226 Difference]: Without dead ends: 87 [2022-02-20 16:48:17,726 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:48:17,729 INFO L933 BasicCegarLoop]: 119 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, 119 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:48:17,729 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 119 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:17,743 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2022-02-20 16:48:17,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2022-02-20 16:48:17,756 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:17,757 INFO L82 GeneralOperation]: Start isEquivalent. First operand 87 states. Second operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:17,758 INFO L74 IsIncluded]: Start isIncluded. First operand 87 states. Second operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:17,759 INFO L87 Difference]: Start difference. First operand 87 states. Second operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:17,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:17,764 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-02-20 16:48:17,764 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-02-20 16:48:17,765 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:17,765 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:17,766 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-02-20 16:48:17,766 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 87 states. [2022-02-20 16:48:17,771 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:17,771 INFO L93 Difference]: Finished difference Result 87 states and 110 transitions. [2022-02-20 16:48:17,771 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-02-20 16:48:17,772 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:17,772 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:17,772 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:17,772 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:17,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:17,776 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-02-20 16:48:17,777 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2022-02-20 16:48:17,778 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:17,778 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-02-20 16:48:17,778 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,778 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-02-20 16:48:17,779 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2022-02-20 16:48:17,779 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:17,779 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:17,779 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2022-02-20 16:48:17,780 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:17,780 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:17,780 INFO L85 PathProgramCache]: Analyzing trace with hash 592840654, now seen corresponding path program 1 times [2022-02-20 16:48:17,781 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:17,781 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176005606] [2022-02-20 16:48:17,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:17,781 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:17,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:17,820 INFO L290 TraceCheckUtils]: 0: Hoare triple {634#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {634#true} is VALID [2022-02-20 16:48:17,821 INFO L290 TraceCheckUtils]: 1: Hoare triple {634#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {636#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:17,822 INFO L290 TraceCheckUtils]: 2: Hoare triple {636#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {636#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:17,822 INFO L290 TraceCheckUtils]: 3: Hoare triple {636#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {636#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:17,823 INFO L290 TraceCheckUtils]: 4: Hoare triple {636#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {635#false} is VALID [2022-02-20 16:48:17,823 INFO L290 TraceCheckUtils]: 5: Hoare triple {635#false} assume inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0; {635#false} is VALID [2022-02-20 16:48:17,823 INFO L272 TraceCheckUtils]: 6: Hoare triple {635#false} call fail(); {635#false} is VALID [2022-02-20 16:48:17,824 INFO L290 TraceCheckUtils]: 7: Hoare triple {635#false} assume !false; {635#false} is VALID [2022-02-20 16:48:17,824 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:48:17,824 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:17,824 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176005606] [2022-02-20 16:48:17,825 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176005606] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:17,825 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:17,825 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:48:17,825 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [219864366] [2022-02-20 16:48:17,825 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:17,827 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:48:17,827 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:17,827 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:17,834 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:48:17,835 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:17,835 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:48:17,835 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:48:17,836 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:17,992 INFO L93 Difference]: Finished difference Result 172 states and 218 transitions. [2022-02-20 16:48:17,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:48:17,993 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2022-02-20 16:48:17,993 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:17,993 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:17,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 16:48:17,997 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:18,000 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 218 transitions. [2022-02-20 16:48:18,000 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 218 transitions. [2022-02-20 16:48:18,215 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 218 edges. 218 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:18,218 INFO L225 Difference]: With dead ends: 172 [2022-02-20 16:48:18,222 INFO L226 Difference]: Without dead ends: 93 [2022-02-20 16:48:18,223 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:48:18,224 INFO L933 BasicCegarLoop]: 109 mSDtfsCounter, 4 mSDsluCounter, 103 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 212 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:18,224 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 212 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:18,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2022-02-20 16:48:18,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 89. [2022-02-20 16:48:18,234 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:18,234 INFO L82 GeneralOperation]: Start isEquivalent. First operand 93 states. Second operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:18,235 INFO L74 IsIncluded]: Start isIncluded. First operand 93 states. Second operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:18,235 INFO L87 Difference]: Start difference. First operand 93 states. Second operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:18,239 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:18,240 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2022-02-20 16:48:18,240 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2022-02-20 16:48:18,243 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:18,243 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:18,243 INFO L74 IsIncluded]: Start isIncluded. First operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 16:48:18,244 INFO L87 Difference]: Start difference. First operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 93 states. [2022-02-20 16:48:18,247 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:18,247 INFO L93 Difference]: Finished difference Result 93 states and 116 transitions. [2022-02-20 16:48:18,247 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 116 transitions. [2022-02-20 16:48:18,252 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:18,252 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:18,252 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:18,252 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:18,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 72 states have (on average 1.3194444444444444) internal successors, (95), 86 states have internal predecessors, (95), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:18,260 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 112 transitions. [2022-02-20 16:48:18,261 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 112 transitions. Word has length 8 [2022-02-20 16:48:18,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:18,262 INFO L470 AbstractCegarLoop]: Abstraction has 89 states and 112 transitions. [2022-02-20 16:48:18,262 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 3 states have internal predecessors, (7), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:18,263 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 112 transitions. [2022-02-20 16:48:18,263 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2022-02-20 16:48:18,264 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:18,264 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:18,264 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2022-02-20 16:48:18,264 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:18,265 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:18,265 INFO L85 PathProgramCache]: Analyzing trace with hash -1362713673, now seen corresponding path program 1 times [2022-02-20 16:48:18,265 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:18,265 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [326932801] [2022-02-20 16:48:18,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:18,266 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:18,335 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:18,412 INFO L290 TraceCheckUtils]: 0: Hoare triple {1165#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {1165#true} is VALID [2022-02-20 16:48:18,412 INFO L290 TraceCheckUtils]: 1: Hoare triple {1165#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {1165#true} is VALID [2022-02-20 16:48:18,413 INFO L290 TraceCheckUtils]: 2: Hoare triple {1165#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {1165#true} is VALID [2022-02-20 16:48:18,413 INFO L290 TraceCheckUtils]: 3: Hoare triple {1165#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {1165#true} is VALID [2022-02-20 16:48:18,413 INFO L290 TraceCheckUtils]: 4: Hoare triple {1165#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {1165#true} is VALID [2022-02-20 16:48:18,414 INFO L290 TraceCheckUtils]: 5: Hoare triple {1165#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {1167#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 16:48:18,414 INFO L290 TraceCheckUtils]: 6: Hoare triple {1167#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {1167#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} is VALID [2022-02-20 16:48:18,415 INFO L290 TraceCheckUtils]: 7: Hoare triple {1167#(= |ULTIMATE.start_main_~item~0#1.offset| 0)} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {1168#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 16:48:18,416 INFO L290 TraceCheckUtils]: 8: Hoare triple {1168#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {1168#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 16:48:18,416 INFO L290 TraceCheckUtils]: 9: Hoare triple {1168#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {1168#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} is VALID [2022-02-20 16:48:18,417 INFO L290 TraceCheckUtils]: 10: Hoare triple {1168#(= 0 |ULTIMATE.start_main_~data~0#1.offset|)} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {1169#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| 0))} is VALID [2022-02-20 16:48:18,417 INFO L290 TraceCheckUtils]: 11: Hoare triple {1169#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| 0))} assume inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0; {1166#false} is VALID [2022-02-20 16:48:18,418 INFO L272 TraceCheckUtils]: 12: Hoare triple {1166#false} call fail(); {1166#false} is VALID [2022-02-20 16:48:18,418 INFO L290 TraceCheckUtils]: 13: Hoare triple {1166#false} assume !false; {1166#false} is VALID [2022-02-20 16:48:18,418 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:18,418 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:18,419 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [326932801] [2022-02-20 16:48:18,419 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [326932801] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:18,419 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:18,419 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:48:18,419 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863763169] [2022-02-20 16:48:18,420 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:18,420 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:48:18,420 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:18,421 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:18,431 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 14 edges. 14 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:18,432 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:48:18,432 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:18,432 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:48:18,433 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:48:18,433 INFO L87 Difference]: Start difference. First operand 89 states and 112 transitions. Second operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:18,952 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:18,952 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2022-02-20 16:48:18,952 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:48:18,953 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2022-02-20 16:48:18,953 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:18,953 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:18,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 308 transitions. [2022-02-20 16:48:18,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:18,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 308 transitions. [2022-02-20 16:48:18,962 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 308 transitions. [2022-02-20 16:48:19,212 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:19,219 INFO L225 Difference]: With dead ends: 235 [2022-02-20 16:48:19,220 INFO L226 Difference]: Without dead ends: 230 [2022-02-20 16:48:19,220 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:48:19,221 INFO L933 BasicCegarLoop]: 101 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 39 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 276 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 39 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:19,222 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 276 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 39 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:19,223 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-02-20 16:48:19,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 92. [2022-02-20 16:48:19,231 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:19,232 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,232 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,233 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,241 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:19,241 INFO L93 Difference]: Finished difference Result 230 states and 301 transitions. [2022-02-20 16:48:19,241 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2022-02-20 16:48:19,242 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:19,242 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:19,242 INFO L74 IsIncluded]: Start isIncluded. First operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 230 states. [2022-02-20 16:48:19,243 INFO L87 Difference]: Start difference. First operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 230 states. [2022-02-20 16:48:19,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:19,262 INFO L93 Difference]: Finished difference Result 230 states and 301 transitions. [2022-02-20 16:48:19,263 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2022-02-20 16:48:19,263 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:19,263 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:19,264 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:19,264 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:19,264 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 76 states have (on average 1.3026315789473684) internal successors, (99), 89 states have internal predecessors, (99), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 115 transitions. [2022-02-20 16:48:19,267 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 115 transitions. Word has length 14 [2022-02-20 16:48:19,267 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:19,268 INFO L470 AbstractCegarLoop]: Abstraction has 92 states and 115 transitions. [2022-02-20 16:48:19,268 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.6) internal successors, (13), 5 states have internal predecessors, (13), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,268 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 115 transitions. [2022-02-20 16:48:19,268 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:48:19,268 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:19,269 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:19,269 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2022-02-20 16:48:19,269 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:19,270 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:19,270 INFO L85 PathProgramCache]: Analyzing trace with hash 1343418310, now seen corresponding path program 1 times [2022-02-20 16:48:19,270 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:19,270 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [28521110] [2022-02-20 16:48:19,270 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:19,271 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:19,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:19,365 INFO L290 TraceCheckUtils]: 0: Hoare triple {2066#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2066#true} is VALID [2022-02-20 16:48:19,366 INFO L290 TraceCheckUtils]: 1: Hoare triple {2066#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {2066#true} is VALID [2022-02-20 16:48:19,366 INFO L290 TraceCheckUtils]: 2: Hoare triple {2066#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2066#true} is VALID [2022-02-20 16:48:19,366 INFO L290 TraceCheckUtils]: 3: Hoare triple {2066#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {2066#true} is VALID [2022-02-20 16:48:19,366 INFO L290 TraceCheckUtils]: 4: Hoare triple {2066#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {2066#true} is VALID [2022-02-20 16:48:19,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2066#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {2066#true} is VALID [2022-02-20 16:48:19,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {2066#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {2066#true} is VALID [2022-02-20 16:48:19,367 INFO L290 TraceCheckUtils]: 7: Hoare triple {2066#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {2066#true} is VALID [2022-02-20 16:48:19,368 INFO L290 TraceCheckUtils]: 8: Hoare triple {2066#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2066#true} is VALID [2022-02-20 16:48:19,368 INFO L290 TraceCheckUtils]: 9: Hoare triple {2066#true} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {2066#true} is VALID [2022-02-20 16:48:19,368 INFO L290 TraceCheckUtils]: 10: Hoare triple {2066#true} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {2066#true} is VALID [2022-02-20 16:48:19,368 INFO L290 TraceCheckUtils]: 11: Hoare triple {2066#true} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {2066#true} is VALID [2022-02-20 16:48:19,368 INFO L290 TraceCheckUtils]: 12: Hoare triple {2066#true} goto; {2066#true} is VALID [2022-02-20 16:48:19,369 INFO L290 TraceCheckUtils]: 13: Hoare triple {2066#true} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {2068#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} is VALID [2022-02-20 16:48:19,370 INFO L290 TraceCheckUtils]: 14: Hoare triple {2068#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {2069#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} is VALID [2022-02-20 16:48:19,371 INFO L290 TraceCheckUtils]: 15: Hoare triple {2069#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {2069#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} is VALID [2022-02-20 16:48:19,371 INFO L290 TraceCheckUtils]: 16: Hoare triple {2069#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} goto; {2069#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} is VALID [2022-02-20 16:48:19,372 INFO L290 TraceCheckUtils]: 17: Hoare triple {2069#(or (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)) (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0)))} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {2070#(or (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.base| 0)) (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.offset| 0)))} is VALID [2022-02-20 16:48:19,372 INFO L290 TraceCheckUtils]: 18: Hoare triple {2070#(or (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.base| 0)) (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.offset| 0)))} assume inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {2067#false} is VALID [2022-02-20 16:48:19,373 INFO L272 TraceCheckUtils]: 19: Hoare triple {2067#false} call fail(); {2067#false} is VALID [2022-02-20 16:48:19,375 INFO L290 TraceCheckUtils]: 20: Hoare triple {2067#false} assume !false; {2067#false} is VALID [2022-02-20 16:48:19,376 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:48:19,376 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:19,376 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [28521110] [2022-02-20 16:48:19,376 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [28521110] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:19,376 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:19,376 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:48:19,377 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477432887] [2022-02-20 16:48:19,377 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:19,377 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:48:19,378 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:19,378 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,392 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:19,393 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:48:19,393 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:19,393 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:48:19,393 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:48:19,394 INFO L87 Difference]: Start difference. First operand 92 states and 115 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,737 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:19,737 INFO L93 Difference]: Finished difference Result 94 states and 116 transitions. [2022-02-20 16:48:19,737 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:48:19,738 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:48:19,738 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:19,738 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,740 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-02-20 16:48:19,740 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,742 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 109 transitions. [2022-02-20 16:48:19,742 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 109 transitions. [2022-02-20 16:48:19,834 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 109 edges. 109 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:19,835 INFO L225 Difference]: With dead ends: 94 [2022-02-20 16:48:19,835 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 16:48:19,835 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:19,836 INFO L933 BasicCegarLoop]: 97 mSDtfsCounter, 11 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 319 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:19,837 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 319 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:19,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 16:48:19,851 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2022-02-20 16:48:19,852 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:19,852 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,853 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,854 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:19,857 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-02-20 16:48:19,857 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-02-20 16:48:19,857 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:19,857 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:19,858 INFO L74 IsIncluded]: Start isIncluded. First operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 16:48:19,858 INFO L87 Difference]: Start difference. First operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 16:48:19,860 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:19,860 INFO L93 Difference]: Finished difference Result 91 states and 113 transitions. [2022-02-20 16:48:19,861 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-02-20 16:48:19,861 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:19,861 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:19,861 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:19,861 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:19,862 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 76 states have (on average 1.2894736842105263) internal successors, (98), 88 states have internal predecessors, (98), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:19,864 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 113 transitions. [2022-02-20 16:48:19,864 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 113 transitions. Word has length 21 [2022-02-20 16:48:19,864 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:19,864 INFO L470 AbstractCegarLoop]: Abstraction has 91 states and 113 transitions. [2022-02-20 16:48:19,865 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,865 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 113 transitions. [2022-02-20 16:48:19,865 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2022-02-20 16:48:19,865 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:19,865 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:19,865 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2022-02-20 16:48:19,866 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:19,866 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:19,866 INFO L85 PathProgramCache]: Analyzing trace with hash 1668834300, now seen corresponding path program 1 times [2022-02-20 16:48:19,866 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:19,867 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [538627302] [2022-02-20 16:48:19,867 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:19,867 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:19,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:19,952 INFO L290 TraceCheckUtils]: 0: Hoare triple {2496#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {2496#true} is VALID [2022-02-20 16:48:19,952 INFO L290 TraceCheckUtils]: 1: Hoare triple {2496#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {2496#true} is VALID [2022-02-20 16:48:19,953 INFO L290 TraceCheckUtils]: 2: Hoare triple {2496#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2496#true} is VALID [2022-02-20 16:48:19,953 INFO L290 TraceCheckUtils]: 3: Hoare triple {2496#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {2496#true} is VALID [2022-02-20 16:48:19,953 INFO L290 TraceCheckUtils]: 4: Hoare triple {2496#true} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {2496#true} is VALID [2022-02-20 16:48:19,953 INFO L290 TraceCheckUtils]: 5: Hoare triple {2496#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {2496#true} is VALID [2022-02-20 16:48:19,954 INFO L290 TraceCheckUtils]: 6: Hoare triple {2496#true} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {2496#true} is VALID [2022-02-20 16:48:19,954 INFO L290 TraceCheckUtils]: 7: Hoare triple {2496#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {2496#true} is VALID [2022-02-20 16:48:19,954 INFO L290 TraceCheckUtils]: 8: Hoare triple {2496#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {2496#true} is VALID [2022-02-20 16:48:19,954 INFO L290 TraceCheckUtils]: 9: Hoare triple {2496#true} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {2496#true} is VALID [2022-02-20 16:48:19,955 INFO L290 TraceCheckUtils]: 10: Hoare triple {2496#true} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {2496#true} is VALID [2022-02-20 16:48:19,955 INFO L290 TraceCheckUtils]: 11: Hoare triple {2496#true} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {2496#true} is VALID [2022-02-20 16:48:19,955 INFO L290 TraceCheckUtils]: 12: Hoare triple {2496#true} goto; {2496#true} is VALID [2022-02-20 16:48:19,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {2496#true} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {2498#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} is VALID [2022-02-20 16:48:19,956 INFO L290 TraceCheckUtils]: 14: Hoare triple {2498#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|))))} assume !(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {2499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:19,958 INFO L290 TraceCheckUtils]: 15: Hoare triple {2499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {2499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:19,959 INFO L290 TraceCheckUtils]: 16: Hoare triple {2499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} goto; {2499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:19,959 INFO L290 TraceCheckUtils]: 17: Hoare triple {2499#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {2500#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| 0))} is VALID [2022-02-20 16:48:19,960 INFO L290 TraceCheckUtils]: 18: Hoare triple {2500#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| 0))} assume !(inspect_before_#t~mem27#1.base == 0 && inspect_before_#t~mem27#1.offset == 0);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {2497#false} is VALID [2022-02-20 16:48:19,960 INFO L272 TraceCheckUtils]: 19: Hoare triple {2497#false} call fail(); {2497#false} is VALID [2022-02-20 16:48:19,960 INFO L290 TraceCheckUtils]: 20: Hoare triple {2497#false} assume !false; {2497#false} is VALID [2022-02-20 16:48:19,961 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2022-02-20 16:48:19,961 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:19,961 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [538627302] [2022-02-20 16:48:19,961 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [538627302] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:19,961 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:19,962 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:48:19,962 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2040809967] [2022-02-20 16:48:19,962 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:19,962 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:48:19,963 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:19,963 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:19,977 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 20 edges. 20 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:19,977 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:48:19,977 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:19,977 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:48:19,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:48:19,978 INFO L87 Difference]: Start difference. First operand 91 states and 113 transitions. Second operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:20,385 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:20,386 INFO L93 Difference]: Finished difference Result 118 states and 146 transitions. [2022-02-20 16:48:20,386 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:48:20,386 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2022-02-20 16:48:20,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:20,386 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:20,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-02-20 16:48:20,388 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:20,390 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 139 transitions. [2022-02-20 16:48:20,390 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 139 transitions. [2022-02-20 16:48:20,498 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 139 edges. 139 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:20,499 INFO L225 Difference]: With dead ends: 118 [2022-02-20 16:48:20,499 INFO L226 Difference]: Without dead ends: 115 [2022-02-20 16:48:20,500 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:20,501 INFO L933 BasicCegarLoop]: 86 mSDtfsCounter, 38 mSDsluCounter, 198 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:20,501 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 284 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:20,502 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2022-02-20 16:48:20,508 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 90. [2022-02-20 16:48:20,508 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:20,508 INFO L82 GeneralOperation]: Start isEquivalent. First operand 115 states. Second operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:20,509 INFO L74 IsIncluded]: Start isIncluded. First operand 115 states. Second operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:20,509 INFO L87 Difference]: Start difference. First operand 115 states. Second operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:20,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:20,512 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-02-20 16:48:20,512 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-02-20 16:48:20,513 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:20,513 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:20,513 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 115 states. [2022-02-20 16:48:20,514 INFO L87 Difference]: Start difference. First operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 115 states. [2022-02-20 16:48:20,517 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:20,517 INFO L93 Difference]: Finished difference Result 115 states and 143 transitions. [2022-02-20 16:48:20,517 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 143 transitions. [2022-02-20 16:48:20,517 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:20,517 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:20,518 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:20,518 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:20,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 76 states have (on average 1.2763157894736843) internal successors, (97), 87 states have internal predecessors, (97), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:20,520 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 111 transitions. [2022-02-20 16:48:20,520 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 111 transitions. Word has length 21 [2022-02-20 16:48:20,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:20,521 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 111 transitions. [2022-02-20 16:48:20,521 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:20,521 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 111 transitions. [2022-02-20 16:48:20,521 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:48:20,522 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:20,522 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:20,522 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2022-02-20 16:48:20,522 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:20,523 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:20,523 INFO L85 PathProgramCache]: Analyzing trace with hash 1088949266, now seen corresponding path program 1 times [2022-02-20 16:48:20,523 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:20,523 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1959959792] [2022-02-20 16:48:20,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:20,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:20,558 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:20,599 INFO L290 TraceCheckUtils]: 0: Hoare triple {3004#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {3004#true} is VALID [2022-02-20 16:48:20,600 INFO L290 TraceCheckUtils]: 1: Hoare triple {3004#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {3004#true} is VALID [2022-02-20 16:48:20,600 INFO L290 TraceCheckUtils]: 2: Hoare triple {3004#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {3004#true} is VALID [2022-02-20 16:48:20,601 INFO L290 TraceCheckUtils]: 3: Hoare triple {3004#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:20,601 INFO L290 TraceCheckUtils]: 4: Hoare triple {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:20,602 INFO L290 TraceCheckUtils]: 5: Hoare triple {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:20,602 INFO L290 TraceCheckUtils]: 6: Hoare triple {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:20,603 INFO L290 TraceCheckUtils]: 7: Hoare triple {3006#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {3007#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 16:48:20,603 INFO L290 TraceCheckUtils]: 8: Hoare triple {3007#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {3007#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 16:48:20,604 INFO L290 TraceCheckUtils]: 9: Hoare triple {3007#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {3007#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 16:48:20,604 INFO L290 TraceCheckUtils]: 10: Hoare triple {3007#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,605 INFO L290 TraceCheckUtils]: 11: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,605 INFO L290 TraceCheckUtils]: 12: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,606 INFO L290 TraceCheckUtils]: 13: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,606 INFO L290 TraceCheckUtils]: 14: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,606 INFO L290 TraceCheckUtils]: 15: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,607 INFO L290 TraceCheckUtils]: 16: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,607 INFO L290 TraceCheckUtils]: 17: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,608 INFO L290 TraceCheckUtils]: 18: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,608 INFO L290 TraceCheckUtils]: 19: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:20,609 INFO L290 TraceCheckUtils]: 20: Hoare triple {3008#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); {3009#(not (= |ULTIMATE.start_inspect_before_#t~mem23#1.base| 0))} is VALID [2022-02-20 16:48:20,609 INFO L290 TraceCheckUtils]: 21: Hoare triple {3009#(not (= |ULTIMATE.start_inspect_before_#t~mem23#1.base| 0))} assume inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0;havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {3005#false} is VALID [2022-02-20 16:48:20,609 INFO L272 TraceCheckUtils]: 22: Hoare triple {3005#false} call fail(); {3005#false} is VALID [2022-02-20 16:48:20,610 INFO L290 TraceCheckUtils]: 23: Hoare triple {3005#false} assume !false; {3005#false} is VALID [2022-02-20 16:48:20,610 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:20,610 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:20,610 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1959959792] [2022-02-20 16:48:20,610 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1959959792] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:20,611 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:20,611 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:48:20,611 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [265907696] [2022-02-20 16:48:20,611 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:20,612 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:20,612 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:20,612 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:20,629 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:48:20,629 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:48:20,629 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:20,630 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:48:20,630 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:20,630 INFO L87 Difference]: Start difference. First operand 90 states and 111 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:21,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:21,236 INFO L93 Difference]: Finished difference Result 195 states and 240 transitions. [2022-02-20 16:48:21,236 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:48:21,236 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:21,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:21,236 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:21,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2022-02-20 16:48:21,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:21,242 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 240 transitions. [2022-02-20 16:48:21,242 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 240 transitions. [2022-02-20 16:48:21,465 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 240 edges. 240 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:21,469 INFO L225 Difference]: With dead ends: 195 [2022-02-20 16:48:21,469 INFO L226 Difference]: Without dead ends: 192 [2022-02-20 16:48:21,469 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:48:21,470 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 348 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 350 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:21,470 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [350 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2022-02-20 16:48:21,471 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 192 states. [2022-02-20 16:48:21,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 192 to 96. [2022-02-20 16:48:21,479 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:21,480 INFO L82 GeneralOperation]: Start isEquivalent. First operand 192 states. Second operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:21,480 INFO L74 IsIncluded]: Start isIncluded. First operand 192 states. Second operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:21,481 INFO L87 Difference]: Start difference. First operand 192 states. Second operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:21,486 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:21,486 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2022-02-20 16:48:21,486 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2022-02-20 16:48:21,486 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:21,487 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:21,487 INFO L74 IsIncluded]: Start isIncluded. First operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 192 states. [2022-02-20 16:48:21,488 INFO L87 Difference]: Start difference. First operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 192 states. [2022-02-20 16:48:21,493 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:21,493 INFO L93 Difference]: Finished difference Result 192 states and 237 transitions. [2022-02-20 16:48:21,493 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 237 transitions. [2022-02-20 16:48:21,494 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:21,494 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:21,494 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:21,494 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:21,494 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 82 states have (on average 1.2560975609756098) internal successors, (103), 93 states have internal predecessors, (103), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:21,497 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 117 transitions. [2022-02-20 16:48:21,497 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 117 transitions. Word has length 24 [2022-02-20 16:48:21,497 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:21,498 INFO L470 AbstractCegarLoop]: Abstraction has 96 states and 117 transitions. [2022-02-20 16:48:21,498 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:21,498 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 117 transitions. [2022-02-20 16:48:21,498 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:48:21,498 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:21,499 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:21,499 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2022-02-20 16:48:21,499 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:21,500 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:21,500 INFO L85 PathProgramCache]: Analyzing trace with hash 1875885747, now seen corresponding path program 1 times [2022-02-20 16:48:21,500 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:21,500 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1276751294] [2022-02-20 16:48:21,500 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:21,501 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:21,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:21,566 INFO L290 TraceCheckUtils]: 0: Hoare triple {3778#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {3778#true} is VALID [2022-02-20 16:48:21,566 INFO L290 TraceCheckUtils]: 1: Hoare triple {3778#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {3778#true} is VALID [2022-02-20 16:48:21,567 INFO L290 TraceCheckUtils]: 2: Hoare triple {3778#true} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {3778#true} is VALID [2022-02-20 16:48:21,567 INFO L290 TraceCheckUtils]: 3: Hoare triple {3778#true} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:21,567 INFO L290 TraceCheckUtils]: 4: Hoare triple {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:21,568 INFO L290 TraceCheckUtils]: 5: Hoare triple {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:21,568 INFO L290 TraceCheckUtils]: 6: Hoare triple {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} is VALID [2022-02-20 16:48:21,569 INFO L290 TraceCheckUtils]: 7: Hoare triple {3780#(not (= |ULTIMATE.start_main_~node~1#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {3781#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 16:48:21,570 INFO L290 TraceCheckUtils]: 8: Hoare triple {3781#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {3781#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 16:48:21,570 INFO L290 TraceCheckUtils]: 9: Hoare triple {3781#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {3781#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} is VALID [2022-02-20 16:48:21,573 INFO L290 TraceCheckUtils]: 10: Hoare triple {3781#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,573 INFO L290 TraceCheckUtils]: 11: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,574 INFO L290 TraceCheckUtils]: 12: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,574 INFO L290 TraceCheckUtils]: 13: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,574 INFO L290 TraceCheckUtils]: 14: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,575 INFO L290 TraceCheckUtils]: 15: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,575 INFO L290 TraceCheckUtils]: 16: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,576 INFO L290 TraceCheckUtils]: 17: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,576 INFO L290 TraceCheckUtils]: 18: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} assume !!(inspect_before_#t~mem27#1.base == 0 && inspect_before_#t~mem27#1.offset == 0);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,577 INFO L290 TraceCheckUtils]: 19: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} goto; {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} is VALID [2022-02-20 16:48:21,578 INFO L290 TraceCheckUtils]: 20: Hoare triple {3782#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) 0))} call inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); {3783#(not (= |ULTIMATE.start_inspect_before_#t~mem28#1.base| 0))} is VALID [2022-02-20 16:48:21,578 INFO L290 TraceCheckUtils]: 21: Hoare triple {3783#(not (= |ULTIMATE.start_inspect_before_#t~mem28#1.base| 0))} assume inspect_before_#t~mem28#1.base == 0 && inspect_before_#t~mem28#1.offset == 0;havoc inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset; {3779#false} is VALID [2022-02-20 16:48:21,579 INFO L272 TraceCheckUtils]: 22: Hoare triple {3779#false} call fail(); {3779#false} is VALID [2022-02-20 16:48:21,580 INFO L290 TraceCheckUtils]: 23: Hoare triple {3779#false} assume !false; {3779#false} is VALID [2022-02-20 16:48:21,580 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:21,580 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:21,580 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1276751294] [2022-02-20 16:48:21,580 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1276751294] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:21,581 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:21,581 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:48:21,581 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192692132] [2022-02-20 16:48:21,581 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:21,582 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:21,582 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:21,582 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:21,599 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:48:21,600 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:48:21,600 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:21,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:48:21,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:21,601 INFO L87 Difference]: Start difference. First operand 96 states and 117 transitions. Second operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:22,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:22,135 INFO L93 Difference]: Finished difference Result 194 states and 238 transitions. [2022-02-20 16:48:22,135 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:48:22,135 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:22,136 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:22,136 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:22,139 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2022-02-20 16:48:22,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:22,142 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 238 transitions. [2022-02-20 16:48:22,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 238 transitions. [2022-02-20 16:48:22,342 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 238 edges. 238 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:22,345 INFO L225 Difference]: With dead ends: 194 [2022-02-20 16:48:22,345 INFO L226 Difference]: Without dead ends: 191 [2022-02-20 16:48:22,346 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:48:22,347 INFO L933 BasicCegarLoop]: 78 mSDtfsCounter, 345 mSDsluCounter, 205 mSDsCounter, 0 mSdLazyCounter, 150 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 347 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 159 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 150 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:22,347 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [347 Valid, 283 Invalid, 159 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 150 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:22,347 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 191 states. [2022-02-20 16:48:22,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 191 to 102. [2022-02-20 16:48:22,353 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:22,354 INFO L82 GeneralOperation]: Start isEquivalent. First operand 191 states. Second operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:22,354 INFO L74 IsIncluded]: Start isIncluded. First operand 191 states. Second operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:22,354 INFO L87 Difference]: Start difference. First operand 191 states. Second operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:22,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:22,359 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-02-20 16:48:22,359 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2022-02-20 16:48:22,360 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:22,360 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:22,360 INFO L74 IsIncluded]: Start isIncluded. First operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 191 states. [2022-02-20 16:48:22,361 INFO L87 Difference]: Start difference. First operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 191 states. [2022-02-20 16:48:22,365 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:22,365 INFO L93 Difference]: Finished difference Result 191 states and 235 transitions. [2022-02-20 16:48:22,365 INFO L276 IsEmpty]: Start isEmpty. Operand 191 states and 235 transitions. [2022-02-20 16:48:22,366 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:22,366 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:22,366 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:22,366 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:22,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 88 states have (on average 1.2386363636363635) internal successors, (109), 99 states have internal predecessors, (109), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:22,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 123 transitions. [2022-02-20 16:48:22,369 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 123 transitions. Word has length 24 [2022-02-20 16:48:22,370 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:22,370 INFO L470 AbstractCegarLoop]: Abstraction has 102 states and 123 transitions. [2022-02-20 16:48:22,370 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 states have internal predecessors, (23), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:22,370 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 123 transitions. [2022-02-20 16:48:22,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:48:22,370 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:22,371 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:22,371 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2022-02-20 16:48:22,371 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:22,371 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:22,371 INFO L85 PathProgramCache]: Analyzing trace with hash 833312563, now seen corresponding path program 1 times [2022-02-20 16:48:22,372 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:22,372 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [897867224] [2022-02-20 16:48:22,372 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:22,372 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:22,394 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:22,524 INFO L290 TraceCheckUtils]: 0: Hoare triple {4554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4554#true} is VALID [2022-02-20 16:48:22,524 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:22,525 INFO L290 TraceCheckUtils]: 2: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:22,525 INFO L290 TraceCheckUtils]: 3: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {4557#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:22,526 INFO L290 TraceCheckUtils]: 4: Hoare triple {4557#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {4557#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:22,527 INFO L290 TraceCheckUtils]: 5: Hoare triple {4557#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {4558#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:22,527 INFO L290 TraceCheckUtils]: 6: Hoare triple {4558#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {4558#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:22,528 INFO L290 TraceCheckUtils]: 7: Hoare triple {4558#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~node~1#1.offset| 0) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 16:48:22,529 INFO L290 TraceCheckUtils]: 8: Hoare triple {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 16:48:22,529 INFO L290 TraceCheckUtils]: 9: Hoare triple {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 16:48:22,530 INFO L290 TraceCheckUtils]: 10: Hoare triple {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:22,531 INFO L290 TraceCheckUtils]: 11: Hoare triple {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:22,531 INFO L290 TraceCheckUtils]: 12: Hoare triple {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} goto; {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:22,532 INFO L290 TraceCheckUtils]: 13: Hoare triple {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {4561#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| 0))} is VALID [2022-02-20 16:48:22,532 INFO L290 TraceCheckUtils]: 14: Hoare triple {4561#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| 0))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {4555#false} is VALID [2022-02-20 16:48:22,532 INFO L290 TraceCheckUtils]: 15: Hoare triple {4555#false} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 17: Hoare triple {4555#false} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 18: Hoare triple {4555#false} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 19: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 20: Hoare triple {4555#false} call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#false} assume !(inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0);havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {4555#false} is VALID [2022-02-20 16:48:22,533 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:22,534 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#false} call inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4);call inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset := read~$Pointer$(inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:22,534 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#false} assume !(inspect_before_#t~mem25#1.base == 0 && inspect_before_#t~mem25#1.offset == 0);havoc inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset;havoc inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset; {4555#false} is VALID [2022-02-20 16:48:22,534 INFO L272 TraceCheckUtils]: 25: Hoare triple {4555#false} call fail(); {4555#false} is VALID [2022-02-20 16:48:22,534 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#false} assume !false; {4555#false} is VALID [2022-02-20 16:48:22,534 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:22,534 INFO L144 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2022-02-20 16:48:22,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [897867224] [2022-02-20 16:48:22,535 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [897867224] provided 0 perfect and 1 imperfect interpolant sequences [2022-02-20 16:48:22,535 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [989758357] [2022-02-20 16:48:22,535 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:22,535 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:22,535 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:22,537 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:48:22,555 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:48:22,632 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:22,634 INFO L263 TraceCheckSpWp]: Trace formula consists of 147 conjuncts, 31 conjunts are in the unsatisfiable core [2022-02-20 16:48:22,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:22,672 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:22,823 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:48:22,825 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-02-20 16:48:22,832 INFO L190 IndexEqualityManager]: detected not equals via solver [2022-02-20 16:48:22,833 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 17 [2022-02-20 16:48:22,959 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:48:22,968 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:48:23,006 INFO L290 TraceCheckUtils]: 0: Hoare triple {4554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4554#true} is VALID [2022-02-20 16:48:23,007 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,007 INFO L290 TraceCheckUtils]: 2: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,008 INFO L290 TraceCheckUtils]: 3: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,009 INFO L290 TraceCheckUtils]: 4: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,009 INFO L290 TraceCheckUtils]: 5: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {4580#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,010 INFO L290 TraceCheckUtils]: 6: Hoare triple {4580#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {4580#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,011 INFO L290 TraceCheckUtils]: 7: Hoare triple {4580#(and (= |ULTIMATE.start_main_~item~0#1.offset| 0) (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 16:48:23,012 INFO L290 TraceCheckUtils]: 8: Hoare triple {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 16:48:23,012 INFO L290 TraceCheckUtils]: 9: Hoare triple {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} is VALID [2022-02-20 16:48:23,013 INFO L290 TraceCheckUtils]: 10: Hoare triple {4559#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) 4)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) 4) 0))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:23,014 INFO L290 TraceCheckUtils]: 11: Hoare triple {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:23,014 INFO L290 TraceCheckUtils]: 12: Hoare triple {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} goto; {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:23,015 INFO L290 TraceCheckUtils]: 13: Hoare triple {4560#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= 0 |ULTIMATE.start_inspect_before_~shape#1.offset|) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {4605#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| 0))} is VALID [2022-02-20 16:48:23,015 INFO L290 TraceCheckUtils]: 14: Hoare triple {4605#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| 0))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,015 INFO L290 TraceCheckUtils]: 15: Hoare triple {4555#false} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 17: Hoare triple {4555#false} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 18: Hoare triple {4555#false} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 19: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 20: Hoare triple {4555#false} call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#false} assume !(inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0);havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,016 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:23,017 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#false} call inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4);call inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset := read~$Pointer$(inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:23,017 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#false} assume !(inspect_before_#t~mem25#1.base == 0 && inspect_before_#t~mem25#1.offset == 0);havoc inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset;havoc inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,017 INFO L272 TraceCheckUtils]: 25: Hoare triple {4555#false} call fail(); {4555#false} is VALID [2022-02-20 16:48:23,017 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#false} assume !false; {4555#false} is VALID [2022-02-20 16:48:23,017 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:23,017 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:48:23,202 INFO L290 TraceCheckUtils]: 26: Hoare triple {4555#false} assume !false; {4555#false} is VALID [2022-02-20 16:48:23,202 INFO L272 TraceCheckUtils]: 25: Hoare triple {4555#false} call fail(); {4555#false} is VALID [2022-02-20 16:48:23,202 INFO L290 TraceCheckUtils]: 24: Hoare triple {4555#false} assume !(inspect_before_#t~mem25#1.base == 0 && inspect_before_#t~mem25#1.offset == 0);havoc inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset;havoc inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,202 INFO L290 TraceCheckUtils]: 23: Hoare triple {4555#false} call inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4);call inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset := read~$Pointer$(inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:23,203 INFO L290 TraceCheckUtils]: 22: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:23,203 INFO L290 TraceCheckUtils]: 21: Hoare triple {4555#false} assume !(inspect_before_#t~mem23#1.base == 0 && inspect_before_#t~mem23#1.offset == 0);havoc inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,203 INFO L290 TraceCheckUtils]: 20: Hoare triple {4555#false} call inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:23,203 INFO L290 TraceCheckUtils]: 19: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:23,203 INFO L290 TraceCheckUtils]: 18: Hoare triple {4555#false} assume !(inspect_before_#t~mem22#1.base == 0 && inspect_before_#t~mem22#1.offset == 0);havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,204 INFO L290 TraceCheckUtils]: 17: Hoare triple {4555#false} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {4555#false} is VALID [2022-02-20 16:48:23,204 INFO L290 TraceCheckUtils]: 16: Hoare triple {4555#false} goto; {4555#false} is VALID [2022-02-20 16:48:23,204 INFO L290 TraceCheckUtils]: 15: Hoare triple {4555#false} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {4555#false} is VALID [2022-02-20 16:48:23,208 INFO L290 TraceCheckUtils]: 14: Hoare triple {4605#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| 0))} assume !!(inspect_before_#t~mem26#1.base != 0 || inspect_before_#t~mem26#1.offset != 0);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {4555#false} is VALID [2022-02-20 16:48:23,209 INFO L290 TraceCheckUtils]: 13: Hoare triple {4684#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, 4 + inspect_before_~shape#1.offset, 4); {4605#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| 0) (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| 0))} is VALID [2022-02-20 16:48:23,210 INFO L290 TraceCheckUtils]: 12: Hoare triple {4684#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} goto; {4684#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:23,210 INFO L290 TraceCheckUtils]: 11: Hoare triple {4684#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} assume !(inspect_before_~shape#1.base == 0 && inspect_before_~shape#1.offset == 0); {4684#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:23,211 INFO L290 TraceCheckUtils]: 10: Hoare triple {4694#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(main_~data~0#1.base == 0 && main_~data~0#1.offset == 0);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {4684#(and (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (+ 4 |ULTIMATE.start_inspect_before_~shape#1.offset|)) 0))} is VALID [2022-02-20 16:48:23,212 INFO L290 TraceCheckUtils]: 9: Hoare triple {4694#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume !(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {4694#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 16:48:23,213 INFO L290 TraceCheckUtils]: 8: Hoare triple {4694#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4694#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 16:48:23,214 INFO L290 TraceCheckUtils]: 7: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, 4 + main_~item~0#1.offset, 4);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {4694#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|)) 0) (= 0 (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (+ 4 |ULTIMATE.start_main_~data~0#1.offset|))))} is VALID [2022-02-20 16:48:23,215 INFO L290 TraceCheckUtils]: 6: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~item~0#1.base == 0 && main_~item~0#1.offset == 0); {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,216 INFO L290 TraceCheckUtils]: 5: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4);assume -2147483648 <= main_#t~nondet39#1 && main_#t~nondet39#1 <= 2147483647;call write~int(main_#t~nondet39#1, main_~node~1#1.base, 4 + main_~node~1#1.offset, 4);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,216 INFO L290 TraceCheckUtils]: 4: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !(main_~node~1#1.base == 0 && main_~node~1#1.offset == 0); {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,217 INFO L290 TraceCheckUtils]: 3: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume !!(0 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,217 INFO L290 TraceCheckUtils]: 2: Hoare triple {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} assume -2147483648 <= main_#t~nondet37#1 && main_#t~nondet37#1 <= 2147483647; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,218 INFO L290 TraceCheckUtils]: 1: Hoare triple {4554#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0, 0; {4556#(and (= 0 |ULTIMATE.start_main_~data~0#1.offset|) (= |ULTIMATE.start_main_~data~0#1.base| 0))} is VALID [2022-02-20 16:48:23,219 INFO L290 TraceCheckUtils]: 0: Hoare triple {4554#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0, 0;assume 0 == #valid[0];assume 0 < #StackHeapBarrier;call #Ultimate.allocInit(2, 1);call write~init~int(48, 1, 0, 1);call write~init~int(0, 1, 1, 1);call #Ultimate.allocInit(15, 2); {4554#true} is VALID [2022-02-20 16:48:23,220 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:23,220 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleZ3 [989758357] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:48:23,220 INFO L191 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2022-02-20 16:48:23,220 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 7, 6] total 12 [2022-02-20 16:48:23,220 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [747013610] [2022-02-20 16:48:23,221 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2022-02-20 16:48:23,221 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 16:48:23,223 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:23,223 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:23,266 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 43 edges. 43 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:23,267 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2022-02-20 16:48:23,267 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2022-02-20 16:48:23,267 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2022-02-20 16:48:23,267 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=29, Invalid=103, Unknown=0, NotChecked=0, Total=132 [2022-02-20 16:48:23,268 INFO L87 Difference]: Start difference. First operand 102 states and 123 transitions. Second operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:24,676 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:24,676 INFO L93 Difference]: Finished difference Result 280 states and 351 transitions. [2022-02-20 16:48:24,677 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2022-02-20 16:48:24,677 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2022-02-20 16:48:24,677 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:24,677 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:24,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2022-02-20 16:48:24,682 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:24,685 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 9 states to 9 states and 327 transitions. [2022-02-20 16:48:24,685 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 9 states and 327 transitions. [2022-02-20 16:48:24,979 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 327 edges. 327 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:24,983 INFO L225 Difference]: With dead ends: 280 [2022-02-20 16:48:24,983 INFO L226 Difference]: Without dead ends: 200 [2022-02-20 16:48:24,986 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 2 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2022-02-20 16:48:24,986 INFO L933 BasicCegarLoop]: 81 mSDtfsCounter, 208 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 343 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 208 SdHoareTripleChecker+Valid, 654 SdHoareTripleChecker+Invalid, 350 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 343 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:24,987 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [208 Valid, 654 Invalid, 350 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 343 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2022-02-20 16:48:24,988 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 200 states. [2022-02-20 16:48:24,996 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 200 to 113. [2022-02-20 16:48:24,996 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:25,003 INFO L82 GeneralOperation]: Start isEquivalent. First operand 200 states. Second operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:25,005 INFO L74 IsIncluded]: Start isIncluded. First operand 200 states. Second operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:25,006 INFO L87 Difference]: Start difference. First operand 200 states. Second operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:25,010 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:25,010 INFO L93 Difference]: Finished difference Result 200 states and 251 transitions. [2022-02-20 16:48:25,011 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2022-02-20 16:48:25,011 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:25,011 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:25,012 INFO L74 IsIncluded]: Start isIncluded. First operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 200 states. [2022-02-20 16:48:25,012 INFO L87 Difference]: Start difference. First operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 200 states. [2022-02-20 16:48:25,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:25,017 INFO L93 Difference]: Finished difference Result 200 states and 251 transitions. [2022-02-20 16:48:25,017 INFO L276 IsEmpty]: Start isEmpty. Operand 200 states and 251 transitions. [2022-02-20 16:48:25,017 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:25,018 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:25,018 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:25,018 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:25,018 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 99 states have (on average 1.2222222222222223) internal successors, (121), 110 states have internal predecessors, (121), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:25,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 135 transitions. [2022-02-20 16:48:25,022 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 135 transitions. Word has length 27 [2022-02-20 16:48:25,022 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:25,022 INFO L470 AbstractCegarLoop]: Abstraction has 113 states and 135 transitions. [2022-02-20 16:48:25,022 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 3.5) internal successors, (42), 12 states have internal predecessors, (42), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:25,023 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 135 transitions. [2022-02-20 16:48:25,023 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2022-02-20 16:48:25,023 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:25,023 INFO L514 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:25,050 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:48:25,245 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2022-02-20 16:48:25,245 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:25,246 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:25,246 INFO L85 PathProgramCache]: Analyzing trace with hash -1708085367, now seen corresponding path program 1 times [2022-02-20 16:48:25,246 INFO L126 FreeRefinementEngine]: Executing refinement strategy CAMEL [2022-02-20 16:48:25,246 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596770728] [2022-02-20 16:48:25,246 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:25,246 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2022-02-20 16:48:25,267 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:48:25,268 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:48:25,277 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:48:25,295 INFO L138 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2022-02-20 16:48:25,295 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:48:25,296 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:48:25,298 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2022-02-20 16:48:25,309 INFO L732 BasicCegarLoop]: Path program histogram: [1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:25,313 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:48:25,341 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call fail(); [2022-02-20 16:48:25,341 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:48:25,345 INFO L158 Benchmark]: Toolchain (without parser) took 9767.21ms. Allocated memory was 90.2MB in the beginning and 159.4MB in the end (delta: 69.2MB). Free memory was 56.0MB in the beginning and 110.8MB in the end (delta: -54.7MB). Peak memory consumption was 15.5MB. Max. memory is 16.1GB. [2022-02-20 16:48:25,345 INFO L158 Benchmark]: CDTParser took 0.18ms. Allocated memory is still 90.2MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:48:25,345 INFO L158 Benchmark]: CACSL2BoogieTranslator took 543.22ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 72.9MB in the end (delta: -17.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. [2022-02-20 16:48:25,345 INFO L158 Benchmark]: Boogie Procedure Inliner took 70.77ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 69.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:48:25,346 INFO L158 Benchmark]: Boogie Preprocessor took 69.85ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 66.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. [2022-02-20 16:48:25,346 INFO L158 Benchmark]: RCFGBuilder took 601.47ms. Allocated memory is still 109.1MB. Free memory was 66.3MB in the beginning and 67.3MB in the end (delta: -1.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. [2022-02-20 16:48:25,346 INFO L158 Benchmark]: TraceAbstraction took 8472.77ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 66.9MB in the beginning and 110.8MB in the end (delta: -43.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. [2022-02-20 16:48:25,351 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.18ms. Allocated memory is still 90.2MB. Free memory was 44.9MB in the beginning and 44.8MB in the end (delta: 84.0kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 543.22ms. Allocated memory was 90.2MB in the beginning and 109.1MB in the end (delta: 18.9MB). Free memory was 55.7MB in the beginning and 72.9MB in the end (delta: -17.2MB). Peak memory consumption was 6.3MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 70.77ms. Allocated memory is still 109.1MB. Free memory was 72.9MB in the beginning and 69.9MB in the end (delta: 3.0MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 69.85ms. Allocated memory is still 109.1MB. Free memory was 69.9MB in the beginning and 66.3MB in the end (delta: 3.6MB). Peak memory consumption was 4.2MB. Max. memory is 16.1GB. * RCFGBuilder took 601.47ms. Allocated memory is still 109.1MB. Free memory was 66.3MB in the beginning and 67.3MB in the end (delta: -1.0MB). Peak memory consumption was 15.1MB. Max. memory is 16.1GB. * TraceAbstraction took 8472.77ms. Allocated memory was 109.1MB in the beginning and 159.4MB in the end (delta: 50.3MB). Free memory was 66.9MB in the beginning and 110.8MB in the end (delta: -43.9MB). Peak memory consumption was 7.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:48:25,377 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/heap-manipulation/merge_sort-1.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 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf --- Real Ultimate output --- This is Ultimate 0.2.2-dev-03d7b7b [2022-02-20 16:48:27,272 INFO L177 SettingsManager]: Resetting all preferences to default values... [2022-02-20 16:48:27,274 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2022-02-20 16:48:27,305 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2022-02-20 16:48:27,305 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2022-02-20 16:48:27,307 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2022-02-20 16:48:27,308 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2022-02-20 16:48:27,309 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2022-02-20 16:48:27,311 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2022-02-20 16:48:27,312 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2022-02-20 16:48:27,312 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2022-02-20 16:48:27,317 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2022-02-20 16:48:27,317 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2022-02-20 16:48:27,320 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2022-02-20 16:48:27,321 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2022-02-20 16:48:27,323 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2022-02-20 16:48:27,324 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2022-02-20 16:48:27,327 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2022-02-20 16:48:27,328 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2022-02-20 16:48:27,330 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2022-02-20 16:48:27,331 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2022-02-20 16:48:27,335 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2022-02-20 16:48:27,336 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2022-02-20 16:48:27,337 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2022-02-20 16:48:27,340 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2022-02-20 16:48:27,344 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2022-02-20 16:48:27,345 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2022-02-20 16:48:27,345 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2022-02-20 16:48:27,346 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2022-02-20 16:48:27,347 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2022-02-20 16:48:27,347 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2022-02-20 16:48:27,348 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2022-02-20 16:48:27,349 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2022-02-20 16:48:27,350 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2022-02-20 16:48:27,351 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2022-02-20 16:48:27,351 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2022-02-20 16:48:27,352 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2022-02-20 16:48:27,352 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2022-02-20 16:48:27,353 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2022-02-20 16:48:27,354 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2022-02-20 16:48:27,354 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2022-02-20 16:48:27,355 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:48:27,386 INFO L113 SettingsManager]: Loading preferences was successful [2022-02-20 16:48:27,387 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2022-02-20 16:48:27,388 INFO L136 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2022-02-20 16:48:27,388 INFO L138 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2022-02-20 16:48:27,389 INFO L136 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2022-02-20 16:48:27,389 INFO L138 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2022-02-20 16:48:27,390 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2022-02-20 16:48:27,390 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2022-02-20 16:48:27,391 INFO L138 SettingsManager]: * Use SBE=true [2022-02-20 16:48:27,391 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2022-02-20 16:48:27,392 INFO L138 SettingsManager]: * sizeof long=4 [2022-02-20 16:48:27,392 INFO L138 SettingsManager]: * sizeof POINTER=4 [2022-02-20 16:48:27,392 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2022-02-20 16:48:27,392 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2022-02-20 16:48:27,392 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2022-02-20 16:48:27,393 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2022-02-20 16:48:27,393 INFO L138 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2022-02-20 16:48:27,393 INFO L138 SettingsManager]: * Use bitvectors instead of ints=true [2022-02-20 16:48:27,393 INFO L138 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2022-02-20 16:48:27,393 INFO L138 SettingsManager]: * sizeof long double=12 [2022-02-20 16:48:27,394 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2022-02-20 16:48:27,394 INFO L138 SettingsManager]: * Use constant arrays=true [2022-02-20 16:48:27,394 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2022-02-20 16:48:27,394 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2022-02-20 16:48:27,394 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2022-02-20 16:48:27,394 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2022-02-20 16:48:27,395 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:48:27,395 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2022-02-20 16:48:27,395 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2022-02-20 16:48:27,395 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2022-02-20 16:48:27,395 INFO L138 SettingsManager]: * Trace refinement strategy=WOLF [2022-02-20 16:48:27,396 INFO L138 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2022-02-20 16:48:27,396 INFO L138 SettingsManager]: * Large block encoding in concurrent analysis=OFF [2022-02-20 16:48:27,396 INFO L138 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2022-02-20 16:48:27,396 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2022-02-20 16:48:27,397 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2022-02-20 16:48:27,397 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 -> 15d1d7d49ed223522c6431664b8ff836ebc81296f5e11773e2197361bd8b13cf [2022-02-20 16:48:27,695 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2022-02-20 16:48:27,719 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2022-02-20 16:48:27,721 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2022-02-20 16:48:27,722 INFO L271 PluginConnector]: Initializing CDTParser... [2022-02-20 16:48:27,723 INFO L275 PluginConnector]: CDTParser initialized [2022-02-20 16:48:27,724 INFO L432 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 16:48:27,781 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ef67f7/ff9f5e62618d4a1abc22d70a57f08be6/FLAGc480580d7 [2022-02-20 16:48:28,314 INFO L306 CDTParser]: Found 1 translation units. [2022-02-20 16:48:28,315 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2022-02-20 16:48:28,330 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ef67f7/ff9f5e62618d4a1abc22d70a57f08be6/FLAGc480580d7 [2022-02-20 16:48:28,779 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/8c8ef67f7/ff9f5e62618d4a1abc22d70a57f08be6 [2022-02-20 16:48:28,781 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2022-02-20 16:48:28,782 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2022-02-20 16:48:28,787 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2022-02-20 16:48:28,787 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2022-02-20 16:48:28,790 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2022-02-20 16:48:28,791 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:48:28" (1/1) ... [2022-02-20 16:48:28,792 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@5105b8ad and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:28, skipping insertion in model container [2022-02-20 16:48:28,793 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 20.02 04:48:28" (1/1) ... [2022-02-20 16:48:28,799 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2022-02-20 16:48:28,827 INFO L178 MainTranslator]: Built tables and reachable declarations [2022-02-20 16:48:29,122 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 16:48:29,180 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:48:29,205 INFO L203 MainTranslator]: Completed pre-run [2022-02-20 16:48:29,260 WARN L230 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i[22632,22645] [2022-02-20 16:48:29,274 INFO L210 PostProcessor]: Analyzing one entry point: main [2022-02-20 16:48:29,306 INFO L208 MainTranslator]: Completed translation [2022-02-20 16:48:29,307 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29 WrapperNode [2022-02-20 16:48:29,308 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2022-02-20 16:48:29,309 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2022-02-20 16:48:29,309 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2022-02-20 16:48:29,309 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2022-02-20 16:48:29,314 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:48:29" (1/1) ... [2022-02-20 16:48:29,352 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:48:29" (1/1) ... [2022-02-20 16:48:29,394 INFO L137 Inliner]: procedures = 128, calls = 83, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 284 [2022-02-20 16:48:29,398 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2022-02-20 16:48:29,399 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2022-02-20 16:48:29,400 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2022-02-20 16:48:29,400 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2022-02-20 16:48:29,407 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,407 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,429 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,430 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,447 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,453 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,455 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,459 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2022-02-20 16:48:29,460 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2022-02-20 16:48:29,460 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2022-02-20 16:48:29,460 INFO L275 PluginConnector]: RCFGBuilder initialized [2022-02-20 16:48:29,461 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (1/1) ... [2022-02-20 16:48:29,469 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2022-02-20 16:48:29,478 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2022-02-20 16:48:29,497 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:48:29,513 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:48:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2022-02-20 16:48:29,535 INFO L130 BoogieDeclarations]: Found specification of procedure merge_single_node [2022-02-20 16:48:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure merge_single_node [2022-02-20 16:48:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure fail [2022-02-20 16:48:29,536 INFO L138 BoogieDeclarations]: Found implementation of procedure fail [2022-02-20 16:48:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2022-02-20 16:48:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2022-02-20 16:48:29,536 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2022-02-20 16:48:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2022-02-20 16:48:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2022-02-20 16:48:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2022-02-20 16:48:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2022-02-20 16:48:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2022-02-20 16:48:29,537 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2022-02-20 16:48:29,537 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2022-02-20 16:48:29,703 INFO L234 CfgBuilder]: Building ICFG [2022-02-20 16:48:29,704 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2022-02-20 16:48:30,324 INFO L275 CfgBuilder]: Performing block encoding [2022-02-20 16:48:30,331 INFO L294 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2022-02-20 16:48:30,332 INFO L299 CfgBuilder]: Removed 33 assume(true) statements. [2022-02-20 16:48:30,334 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:48:30 BoogieIcfgContainer [2022-02-20 16:48:30,335 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2022-02-20 16:48:30,336 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2022-02-20 16:48:30,336 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2022-02-20 16:48:30,339 INFO L275 PluginConnector]: TraceAbstraction initialized [2022-02-20 16:48:30,339 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 20.02 04:48:28" (1/3) ... [2022-02-20 16:48:30,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfaa5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:48:30, skipping insertion in model container [2022-02-20 16:48:30,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 20.02 04:48:29" (2/3) ... [2022-02-20 16:48:30,340 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@1bfaa5c0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 20.02 04:48:30, skipping insertion in model container [2022-02-20 16:48:30,340 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 20.02 04:48:30" (3/3) ... [2022-02-20 16:48:30,346 INFO L111 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2022-02-20 16:48:30,351 INFO L205 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2022-02-20 16:48:30,351 INFO L164 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2022-02-20 16:48:30,390 INFO L338 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2022-02-20 16:48:30,399 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:48:30,399 INFO L340 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2022-02-20 16:48:30,426 INFO L276 IsEmpty]: Start isEmpty. Operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) [2022-02-20 16:48:30,429 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:48:30,429 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:30,430 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:30,430 INFO L402 AbstractCegarLoop]: === Iteration 1 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:30,434 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:30,435 INFO L85 PathProgramCache]: Analyzing trace with hash 2116504326, now seen corresponding path program 1 times [2022-02-20 16:48:30,445 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:30,445 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2074213863] [2022-02-20 16:48:30,446 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:30,446 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:30,447 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:30,451 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:48:30,458 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:48:30,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:30,545 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 1 conjunts are in the unsatisfiable core [2022-02-20 16:48:30,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:30,561 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:30,610 INFO L290 TraceCheckUtils]: 0: Hoare triple {98#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {98#true} is VALID [2022-02-20 16:48:30,611 INFO L290 TraceCheckUtils]: 1: Hoare triple {98#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {98#true} is VALID [2022-02-20 16:48:30,612 INFO L290 TraceCheckUtils]: 2: Hoare triple {98#true} assume !true; {99#false} is VALID [2022-02-20 16:48:30,612 INFO L290 TraceCheckUtils]: 3: Hoare triple {99#false} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {99#false} is VALID [2022-02-20 16:48:30,612 INFO L290 TraceCheckUtils]: 4: Hoare triple {99#false} assume inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32; {99#false} is VALID [2022-02-20 16:48:30,613 INFO L272 TraceCheckUtils]: 5: Hoare triple {99#false} call fail(); {99#false} is VALID [2022-02-20 16:48:30,613 INFO L290 TraceCheckUtils]: 6: Hoare triple {99#false} assume !false; {99#false} is VALID [2022-02-20 16:48:30,614 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:48:30,614 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:30,615 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:30,615 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2074213863] [2022-02-20 16:48:30,616 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2074213863] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:30,616 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:30,616 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2022-02-20 16:48:30,617 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125293251] [2022-02-20 16:48:30,618 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:30,622 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:48:30,623 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:30,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:30,640 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:30,640 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2022-02-20 16:48:30,641 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:30,671 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2022-02-20 16:48:30,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2022-02-20 16:48:30,677 INFO L87 Difference]: Start difference. First operand has 95 states, 76 states have (on average 1.8157894736842106) internal successors, (138), 92 states have internal predecessors, (138), 15 states have call successors, (15), 2 states have call predecessors, (15), 2 states have return successors, (15), 14 states have call predecessors, (15), 15 states have call successors, (15) Second operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:31,024 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:31,025 INFO L93 Difference]: Finished difference Result 186 states and 333 transitions. [2022-02-20 16:48:31,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2022-02-20 16:48:31,026 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:48:31,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:31,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:31,046 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2022-02-20 16:48:31,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:31,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 333 transitions. [2022-02-20 16:48:31,053 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 333 transitions. [2022-02-20 16:48:31,398 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 333 edges. 333 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:31,411 INFO L225 Difference]: With dead ends: 186 [2022-02-20 16:48:31,411 INFO L226 Difference]: Without dead ends: 86 [2022-02-20 16:48:31,415 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 6 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:48:31,418 INFO L933 BasicCegarLoop]: 118 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, 118 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:48:31,419 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [0 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:31,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2022-02-20 16:48:31,444 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 86. [2022-02-20 16:48:31,444 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:31,445 INFO L82 GeneralOperation]: Start isEquivalent. First operand 86 states. Second operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:31,446 INFO L74 IsIncluded]: Start isIncluded. First operand 86 states. Second operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:31,447 INFO L87 Difference]: Start difference. First operand 86 states. Second operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:31,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:31,457 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-02-20 16:48:31,457 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-02-20 16:48:31,458 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:31,458 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:31,458 INFO L74 IsIncluded]: Start isIncluded. First operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 86 states. [2022-02-20 16:48:31,459 INFO L87 Difference]: Start difference. First operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 86 states. [2022-02-20 16:48:31,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:31,463 INFO L93 Difference]: Finished difference Result 86 states and 109 transitions. [2022-02-20 16:48:31,463 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-02-20 16:48:31,472 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:31,472 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:31,472 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:31,472 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:31,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 86 states, 69 states have (on average 1.3333333333333333) internal successors, (92), 83 states have internal predecessors, (92), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:31,476 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 109 transitions. [2022-02-20 16:48:31,478 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 109 transitions. Word has length 7 [2022-02-20 16:48:31,478 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:31,478 INFO L470 AbstractCegarLoop]: Abstraction has 86 states and 109 transitions. [2022-02-20 16:48:31,478 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 3.0) internal successors, (6), 2 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:31,479 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 109 transitions. [2022-02-20 16:48:31,479 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2022-02-20 16:48:31,479 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:31,479 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:31,491 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:48:31,691 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:48:31,692 INFO L402 AbstractCegarLoop]: === Iteration 2 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:31,692 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:31,692 INFO L85 PathProgramCache]: Analyzing trace with hash 2099880948, now seen corresponding path program 1 times [2022-02-20 16:48:31,693 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:31,693 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [974137349] [2022-02-20 16:48:31,693 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:31,693 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:31,693 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:31,695 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:48:31,696 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:48:31,743 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:31,744 INFO L263 TraceCheckSpWp]: Trace formula consists of 27 conjuncts, 3 conjunts are in the unsatisfiable core [2022-02-20 16:48:31,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:31,752 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:31,796 INFO L290 TraceCheckUtils]: 0: Hoare triple {646#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {646#true} is VALID [2022-02-20 16:48:31,796 INFO L290 TraceCheckUtils]: 1: Hoare triple {646#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {654#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:31,797 INFO L290 TraceCheckUtils]: 2: Hoare triple {654#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {654#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:31,798 INFO L290 TraceCheckUtils]: 3: Hoare triple {654#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {647#false} is VALID [2022-02-20 16:48:31,798 INFO L290 TraceCheckUtils]: 4: Hoare triple {647#false} assume inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32; {647#false} is VALID [2022-02-20 16:48:31,798 INFO L272 TraceCheckUtils]: 5: Hoare triple {647#false} call fail(); {647#false} is VALID [2022-02-20 16:48:31,798 INFO L290 TraceCheckUtils]: 6: Hoare triple {647#false} assume !false; {647#false} is VALID [2022-02-20 16:48:31,798 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:48:31,798 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:31,799 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:31,799 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [974137349] [2022-02-20 16:48:31,799 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [974137349] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:31,799 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:31,799 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2022-02-20 16:48:31,799 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [847620201] [2022-02-20 16:48:31,800 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:31,801 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:48:31,801 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:31,801 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:31,822 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:31,823 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2022-02-20 16:48:31,823 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:31,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2022-02-20 16:48:31,824 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:48:31,824 INFO L87 Difference]: Start difference. First operand 86 states and 109 transitions. Second operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:32,309 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:32,309 INFO L93 Difference]: Finished difference Result 170 states and 216 transitions. [2022-02-20 16:48:32,309 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2022-02-20 16:48:32,309 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2022-02-20 16:48:32,310 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:32,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:32,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-02-20 16:48:32,314 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:32,317 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 216 transitions. [2022-02-20 16:48:32,317 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 216 transitions. [2022-02-20 16:48:32,547 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 216 edges. 216 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:32,549 INFO L225 Difference]: With dead ends: 170 [2022-02-20 16:48:32,549 INFO L226 Difference]: Without dead ends: 91 [2022-02-20 16:48:32,550 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2022-02-20 16:48:32,551 INFO L933 BasicCegarLoop]: 108 mSDtfsCounter, 4 mSDsluCounter, 102 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 210 SdHoareTripleChecker+Invalid, 7 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:32,551 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [4 Valid, 210 Invalid, 7 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2022-02-20 16:48:32,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2022-02-20 16:48:32,557 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 87. [2022-02-20 16:48:32,557 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:32,558 INFO L82 GeneralOperation]: Start isEquivalent. First operand 91 states. Second operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:32,558 INFO L74 IsIncluded]: Start isIncluded. First operand 91 states. Second operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:32,558 INFO L87 Difference]: Start difference. First operand 91 states. Second operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:32,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:32,562 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-02-20 16:48:32,562 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-02-20 16:48:32,563 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:32,563 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:32,563 INFO L74 IsIncluded]: Start isIncluded. First operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 16:48:32,563 INFO L87 Difference]: Start difference. First operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 91 states. [2022-02-20 16:48:32,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:32,566 INFO L93 Difference]: Finished difference Result 91 states and 114 transitions. [2022-02-20 16:48:32,567 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 114 transitions. [2022-02-20 16:48:32,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:32,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:32,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:32,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:32,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 70 states have (on average 1.3285714285714285) internal successors, (93), 84 states have internal predecessors, (93), 15 states have call successors, (15), 2 states have call predecessors, (15), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:32,571 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 110 transitions. [2022-02-20 16:48:32,571 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 110 transitions. Word has length 7 [2022-02-20 16:48:32,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:32,571 INFO L470 AbstractCegarLoop]: Abstraction has 87 states and 110 transitions. [2022-02-20 16:48:32,571 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:32,572 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 110 transitions. [2022-02-20 16:48:32,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2022-02-20 16:48:32,572 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:32,572 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:32,586 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:48:32,782 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:48:32,782 INFO L402 AbstractCegarLoop]: === Iteration 3 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:32,783 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:32,783 INFO L85 PathProgramCache]: Analyzing trace with hash -404579866, now seen corresponding path program 1 times [2022-02-20 16:48:32,784 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:32,784 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [163327623] [2022-02-20 16:48:32,784 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:32,784 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:32,784 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:32,785 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:48:32,787 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:48:32,873 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:32,875 INFO L263 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 5 conjunts are in the unsatisfiable core [2022-02-20 16:48:32,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:32,890 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:32,969 INFO L290 TraceCheckUtils]: 0: Hoare triple {1187#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {1187#true} is VALID [2022-02-20 16:48:32,970 INFO L290 TraceCheckUtils]: 1: Hoare triple {1187#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {1187#true} is VALID [2022-02-20 16:48:32,970 INFO L290 TraceCheckUtils]: 2: Hoare triple {1187#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {1187#true} is VALID [2022-02-20 16:48:32,970 INFO L290 TraceCheckUtils]: 3: Hoare triple {1187#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {1187#true} is VALID [2022-02-20 16:48:32,971 INFO L290 TraceCheckUtils]: 4: Hoare triple {1187#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {1204#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:32,973 INFO L290 TraceCheckUtils]: 5: Hoare triple {1204#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {1204#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:32,974 INFO L290 TraceCheckUtils]: 6: Hoare triple {1204#(not (= |ULTIMATE.start_main_~item~0#1.base| (_ bv0 32)))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {1211#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:32,974 INFO L290 TraceCheckUtils]: 7: Hoare triple {1211#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {1211#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:32,975 INFO L290 TraceCheckUtils]: 8: Hoare triple {1211#(not (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {1218#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:32,975 INFO L290 TraceCheckUtils]: 9: Hoare triple {1218#(not (= |ULTIMATE.start_inspect_before_~shape#1.base| (_ bv0 32)))} assume inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32; {1188#false} is VALID [2022-02-20 16:48:32,975 INFO L272 TraceCheckUtils]: 10: Hoare triple {1188#false} call fail(); {1188#false} is VALID [2022-02-20 16:48:32,976 INFO L290 TraceCheckUtils]: 11: Hoare triple {1188#false} assume !false; {1188#false} is VALID [2022-02-20 16:48:32,976 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:32,977 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:32,979 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:32,979 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [163327623] [2022-02-20 16:48:32,979 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [163327623] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:32,979 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:32,980 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:48:32,981 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1988134789] [2022-02-20 16:48:32,982 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:32,983 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:48:32,983 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:32,983 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:32,999 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 12 edges. 12 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:33,000 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:48:33,000 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:33,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:48:33,001 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:48:33,002 INFO L87 Difference]: Start difference. First operand 87 states and 110 transitions. Second operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:34,113 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:34,114 INFO L93 Difference]: Finished difference Result 235 states and 308 transitions. [2022-02-20 16:48:34,114 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2022-02-20 16:48:34,114 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2022-02-20 16:48:34,115 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:34,115 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:34,119 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 308 transitions. [2022-02-20 16:48:34,119 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:34,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 308 transitions. [2022-02-20 16:48:34,124 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 308 transitions. [2022-02-20 16:48:34,403 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 308 edges. 308 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:34,410 INFO L225 Difference]: With dead ends: 235 [2022-02-20 16:48:34,410 INFO L226 Difference]: Without dead ends: 230 [2022-02-20 16:48:34,411 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 15 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2022-02-20 16:48:34,411 INFO L933 BasicCegarLoop]: 99 mSDtfsCounter, 516 mSDsluCounter, 175 mSDsCounter, 0 mSdLazyCounter, 45 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 518 SdHoareTripleChecker+Valid, 274 SdHoareTripleChecker+Invalid, 63 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 45 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:34,412 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [518 Valid, 274 Invalid, 63 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 45 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2022-02-20 16:48:34,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 230 states. [2022-02-20 16:48:34,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 230 to 90. [2022-02-20 16:48:34,420 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:34,421 INFO L82 GeneralOperation]: Start isEquivalent. First operand 230 states. Second operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:34,421 INFO L74 IsIncluded]: Start isIncluded. First operand 230 states. Second operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:34,422 INFO L87 Difference]: Start difference. First operand 230 states. Second operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:34,432 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:34,432 INFO L93 Difference]: Finished difference Result 230 states and 301 transitions. [2022-02-20 16:48:34,432 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2022-02-20 16:48:34,433 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:34,433 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:34,434 INFO L74 IsIncluded]: Start isIncluded. First operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 230 states. [2022-02-20 16:48:34,434 INFO L87 Difference]: Start difference. First operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 230 states. [2022-02-20 16:48:34,448 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:34,448 INFO L93 Difference]: Finished difference Result 230 states and 301 transitions. [2022-02-20 16:48:34,448 INFO L276 IsEmpty]: Start isEmpty. Operand 230 states and 301 transitions. [2022-02-20 16:48:34,450 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:34,450 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:34,451 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:34,451 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:34,451 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 74 states have (on average 1.3108108108108107) internal successors, (97), 87 states have internal predecessors, (97), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:34,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 113 transitions. [2022-02-20 16:48:34,454 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 113 transitions. Word has length 12 [2022-02-20 16:48:34,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:34,455 INFO L470 AbstractCegarLoop]: Abstraction has 90 states and 113 transitions. [2022-02-20 16:48:34,455 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:34,455 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 113 transitions. [2022-02-20 16:48:34,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:48:34,455 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:34,456 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:48:34,472 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:34,672 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:48:34,672 INFO L402 AbstractCegarLoop]: === Iteration 4 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:34,673 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:34,673 INFO L85 PathProgramCache]: Analyzing trace with hash -1696064914, now seen corresponding path program 1 times [2022-02-20 16:48:34,673 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:34,673 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [425484692] [2022-02-20 16:48:34,673 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:34,674 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:34,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:34,675 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:48:34,677 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:48:34,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:34,747 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:48:34,758 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:34,759 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:34,880 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-02-20 16:48:34,886 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-02-20 16:48:35,099 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:48:35,104 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:48:35,125 INFO L290 TraceCheckUtils]: 0: Hoare triple {2119#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {2119#true} is VALID [2022-02-20 16:48:35,126 INFO L290 TraceCheckUtils]: 1: Hoare triple {2119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,126 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,127 INFO L290 TraceCheckUtils]: 3: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,128 INFO L290 TraceCheckUtils]: 4: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {2137#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,128 INFO L290 TraceCheckUtils]: 5: Hoare triple {2137#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {2137#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,130 INFO L290 TraceCheckUtils]: 6: Hoare triple {2137#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {2144#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,130 INFO L290 TraceCheckUtils]: 7: Hoare triple {2144#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {2144#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,131 INFO L290 TraceCheckUtils]: 8: Hoare triple {2144#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,132 INFO L290 TraceCheckUtils]: 9: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,132 INFO L290 TraceCheckUtils]: 10: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} goto; {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,133 INFO L290 TraceCheckUtils]: 11: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,133 INFO L290 TraceCheckUtils]: 12: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,134 INFO L290 TraceCheckUtils]: 13: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,135 INFO L290 TraceCheckUtils]: 14: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} goto; {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,135 INFO L290 TraceCheckUtils]: 15: Hoare triple {2151#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {2173#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:35,136 INFO L290 TraceCheckUtils]: 16: Hoare triple {2173#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} assume !(inspect_before_#t~mem27#1.base == 0bv32 && inspect_before_#t~mem27#1.offset == 0bv32);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {2120#false} is VALID [2022-02-20 16:48:35,136 INFO L272 TraceCheckUtils]: 17: Hoare triple {2120#false} call fail(); {2120#false} is VALID [2022-02-20 16:48:35,136 INFO L290 TraceCheckUtils]: 18: Hoare triple {2120#false} assume !false; {2120#false} is VALID [2022-02-20 16:48:35,136 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:35,137 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:48:35,352 INFO L290 TraceCheckUtils]: 18: Hoare triple {2120#false} assume !false; {2120#false} is VALID [2022-02-20 16:48:35,353 INFO L272 TraceCheckUtils]: 17: Hoare triple {2120#false} call fail(); {2120#false} is VALID [2022-02-20 16:48:35,353 INFO L290 TraceCheckUtils]: 16: Hoare triple {2173#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} assume !(inspect_before_#t~mem27#1.base == 0bv32 && inspect_before_#t~mem27#1.offset == 0bv32);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {2120#false} is VALID [2022-02-20 16:48:35,354 INFO L290 TraceCheckUtils]: 15: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {2173#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:35,355 INFO L290 TraceCheckUtils]: 14: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} goto; {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,359 INFO L290 TraceCheckUtils]: 13: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,360 INFO L290 TraceCheckUtils]: 12: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,360 INFO L290 TraceCheckUtils]: 11: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,361 INFO L290 TraceCheckUtils]: 10: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} goto; {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,362 INFO L290 TraceCheckUtils]: 9: Hoare triple {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,362 INFO L290 TraceCheckUtils]: 8: Hoare triple {2214#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {2192#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,364 INFO L290 TraceCheckUtils]: 7: Hoare triple {2214#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {2214#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,366 INFO L290 TraceCheckUtils]: 6: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {2214#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:35,366 INFO L290 TraceCheckUtils]: 5: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,367 INFO L290 TraceCheckUtils]: 4: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,368 INFO L290 TraceCheckUtils]: 3: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,368 INFO L290 TraceCheckUtils]: 2: Hoare triple {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,369 INFO L290 TraceCheckUtils]: 1: Hoare triple {2119#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {2127#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:35,369 INFO L290 TraceCheckUtils]: 0: Hoare triple {2119#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {2119#true} is VALID [2022-02-20 16:48:35,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:35,370 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:35,370 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [425484692] [2022-02-20 16:48:35,370 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [425484692] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:48:35,370 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:48:35,370 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-02-20 16:48:35,370 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [48749129] [2022-02-20 16:48:35,370 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:48:35,371 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:48:35,371 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:35,371 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:35,408 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 31 edges. 31 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:35,408 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:48:35,408 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:35,409 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:48:35,409 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:48:35,409 INFO L87 Difference]: Start difference. First operand 90 states and 113 transitions. Second operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:39,806 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:39,807 INFO L93 Difference]: Finished difference Result 276 states and 357 transitions. [2022-02-20 16:48:39,807 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:48:39,807 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:48:39,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:39,808 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:39,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 352 transitions. [2022-02-20 16:48:39,813 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:39,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 352 transitions. [2022-02-20 16:48:39,817 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 352 transitions. [2022-02-20 16:48:40,170 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 352 edges. 352 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:40,176 INFO L225 Difference]: With dead ends: 276 [2022-02-20 16:48:40,176 INFO L226 Difference]: Without dead ends: 273 [2022-02-20 16:48:40,176 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:48:40,177 INFO L933 BasicCegarLoop]: 84 mSDtfsCounter, 354 mSDsluCounter, 518 mSDsCounter, 0 mSdLazyCounter, 363 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 354 SdHoareTripleChecker+Valid, 602 SdHoareTripleChecker+Invalid, 373 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:40,177 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [354 Valid, 602 Invalid, 373 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 363 Invalid, 0 Unknown, 0 Unchecked, 1.6s Time] [2022-02-20 16:48:40,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 273 states. [2022-02-20 16:48:40,197 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 273 to 104. [2022-02-20 16:48:40,198 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:40,198 INFO L82 GeneralOperation]: Start isEquivalent. First operand 273 states. Second operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:40,199 INFO L74 IsIncluded]: Start isIncluded. First operand 273 states. Second operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:40,200 INFO L87 Difference]: Start difference. First operand 273 states. Second operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:40,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:40,212 INFO L93 Difference]: Finished difference Result 273 states and 354 transitions. [2022-02-20 16:48:40,212 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 354 transitions. [2022-02-20 16:48:40,213 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:40,213 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:40,214 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 273 states. [2022-02-20 16:48:40,215 INFO L87 Difference]: Start difference. First operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 273 states. [2022-02-20 16:48:40,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:40,225 INFO L93 Difference]: Finished difference Result 273 states and 354 transitions. [2022-02-20 16:48:40,225 INFO L276 IsEmpty]: Start isEmpty. Operand 273 states and 354 transitions. [2022-02-20 16:48:40,226 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:40,226 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:40,226 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:40,226 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:40,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2840909090909092) internal successors, (113), 101 states have internal predecessors, (113), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:40,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 129 transitions. [2022-02-20 16:48:40,229 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 129 transitions. Word has length 19 [2022-02-20 16:48:40,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:40,229 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 129 transitions. [2022-02-20 16:48:40,230 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 3.3333333333333335) internal successors, (30), 9 states have internal predecessors, (30), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:40,230 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 129 transitions. [2022-02-20 16:48:40,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2022-02-20 16:48:40,230 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:40,230 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:48:40,242 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:48:40,440 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:48:40,441 INFO L402 AbstractCegarLoop]: === Iteration 5 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:40,441 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash -2021480904, now seen corresponding path program 1 times [2022-02-20 16:48:40,441 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:40,441 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [367465494] [2022-02-20 16:48:40,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:40,442 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:40,442 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:40,443 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:48:40,445 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:48:40,523 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:40,526 INFO L263 TraceCheckSpWp]: Trace formula consists of 85 conjuncts, 19 conjunts are in the unsatisfiable core [2022-02-20 16:48:40,539 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:40,540 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:40,630 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-02-20 16:48:40,636 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 15 [2022-02-20 16:48:40,739 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:48:40,745 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2022-02-20 16:48:40,775 INFO L290 TraceCheckUtils]: 0: Hoare triple {3279#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {3279#true} is VALID [2022-02-20 16:48:40,776 INFO L290 TraceCheckUtils]: 1: Hoare triple {3279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,777 INFO L290 TraceCheckUtils]: 2: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,777 INFO L290 TraceCheckUtils]: 3: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,778 INFO L290 TraceCheckUtils]: 4: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {3297#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,779 INFO L290 TraceCheckUtils]: 5: Hoare triple {3297#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {3297#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,780 INFO L290 TraceCheckUtils]: 6: Hoare triple {3297#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= |ULTIMATE.start_main_~item~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {3304#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,781 INFO L290 TraceCheckUtils]: 7: Hoare triple {3304#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {3304#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,781 INFO L290 TraceCheckUtils]: 8: Hoare triple {3304#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {3311#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,787 INFO L290 TraceCheckUtils]: 9: Hoare triple {3311#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {3311#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,787 INFO L290 TraceCheckUtils]: 10: Hoare triple {3311#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} goto; {3311#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,788 INFO L290 TraceCheckUtils]: 11: Hoare triple {3311#(and (= |ULTIMATE.start_inspect_before_~shape#1.offset| (_ bv0 32)) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (_ bv4 32)) (_ bv0 32)))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {3321#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:48:40,788 INFO L290 TraceCheckUtils]: 12: Hoare triple {3321#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (_ bv0 32)))} assume !!(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#false} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#false} goto; {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#false} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#false} assume inspect_before_#t~mem22#1.base == 0bv32 && inspect_before_#t~mem22#1.offset == 0bv32;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L272 TraceCheckUtils]: 17: Hoare triple {3280#false} call fail(); {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L290 TraceCheckUtils]: 18: Hoare triple {3280#false} assume !false; {3280#false} is VALID [2022-02-20 16:48:40,789 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:40,789 INFO L328 TraceCheckSpWp]: Computing backward predicates... [2022-02-20 16:48:40,954 INFO L290 TraceCheckUtils]: 18: Hoare triple {3280#false} assume !false; {3280#false} is VALID [2022-02-20 16:48:40,955 INFO L272 TraceCheckUtils]: 17: Hoare triple {3280#false} call fail(); {3280#false} is VALID [2022-02-20 16:48:40,955 INFO L290 TraceCheckUtils]: 16: Hoare triple {3280#false} assume inspect_before_#t~mem22#1.base == 0bv32 && inspect_before_#t~mem22#1.offset == 0bv32;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {3280#false} is VALID [2022-02-20 16:48:40,955 INFO L290 TraceCheckUtils]: 15: Hoare triple {3280#false} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {3280#false} is VALID [2022-02-20 16:48:40,955 INFO L290 TraceCheckUtils]: 14: Hoare triple {3280#false} goto; {3280#false} is VALID [2022-02-20 16:48:40,956 INFO L290 TraceCheckUtils]: 13: Hoare triple {3280#false} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {3280#false} is VALID [2022-02-20 16:48:40,956 INFO L290 TraceCheckUtils]: 12: Hoare triple {3321#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (_ bv0 32)))} assume !!(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {3280#false} is VALID [2022-02-20 16:48:40,957 INFO L290 TraceCheckUtils]: 11: Hoare triple {3364#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {3321#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.base| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (_ bv0 32)))} is VALID [2022-02-20 16:48:40,957 INFO L290 TraceCheckUtils]: 10: Hoare triple {3364#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} goto; {3364#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,958 INFO L290 TraceCheckUtils]: 9: Hoare triple {3364#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {3364#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,959 INFO L290 TraceCheckUtils]: 8: Hoare triple {3374#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {3364#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,960 INFO L290 TraceCheckUtils]: 7: Hoare triple {3374#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {3374#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,961 INFO L290 TraceCheckUtils]: 6: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {3374#(and (= (_ bv0 32) (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_main_~data~0#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:40,962 INFO L290 TraceCheckUtils]: 5: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,963 INFO L290 TraceCheckUtils]: 4: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,963 INFO L290 TraceCheckUtils]: 3: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,964 INFO L290 TraceCheckUtils]: 2: Hoare triple {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,964 INFO L290 TraceCheckUtils]: 1: Hoare triple {3279#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {3287#(and (= |ULTIMATE.start_main_~data~0#1.offset| (_ bv0 32)) (= (_ bv0 32) |ULTIMATE.start_main_~data~0#1.base|))} is VALID [2022-02-20 16:48:40,965 INFO L290 TraceCheckUtils]: 0: Hoare triple {3279#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {3279#true} is VALID [2022-02-20 16:48:40,965 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:40,965 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:40,965 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [367465494] [2022-02-20 16:48:40,965 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [367465494] provided 0 perfect and 2 imperfect interpolant sequences [2022-02-20 16:48:40,965 INFO L191 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2022-02-20 16:48:40,966 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 9 [2022-02-20 16:48:40,966 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209413343] [2022-02-20 16:48:40,966 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2022-02-20 16:48:40,966 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:48:40,967 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:40,967 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:40,996 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 27 edges. 27 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:40,996 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2022-02-20 16:48:40,996 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:40,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2022-02-20 16:48:40,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=54, Unknown=0, NotChecked=0, Total=72 [2022-02-20 16:48:40,997 INFO L87 Difference]: Start difference. First operand 104 states and 129 transitions. Second operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:43,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:43,763 INFO L93 Difference]: Finished difference Result 264 states and 340 transitions. [2022-02-20 16:48:43,763 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2022-02-20 16:48:43,763 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2022-02-20 16:48:43,763 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:43,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:43,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2022-02-20 16:48:43,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:43,771 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 334 transitions. [2022-02-20 16:48:43,771 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 8 states and 334 transitions. [2022-02-20 16:48:44,108 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 334 edges. 334 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:44,111 INFO L225 Difference]: With dead ends: 264 [2022-02-20 16:48:44,111 INFO L226 Difference]: Without dead ends: 188 [2022-02-20 16:48:44,112 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=32, Invalid=78, Unknown=0, NotChecked=0, Total=110 [2022-02-20 16:48:44,112 INFO L933 BasicCegarLoop]: 85 mSDtfsCounter, 302 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 198 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 302 SdHoareTripleChecker+Valid, 408 SdHoareTripleChecker+Invalid, 208 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 198 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:44,113 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [302 Valid, 408 Invalid, 208 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 198 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2022-02-20 16:48:44,113 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 188 states. [2022-02-20 16:48:44,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 188 to 104. [2022-02-20 16:48:44,121 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:44,122 INFO L82 GeneralOperation]: Start isEquivalent. First operand 188 states. Second operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:44,122 INFO L74 IsIncluded]: Start isIncluded. First operand 188 states. Second operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:44,122 INFO L87 Difference]: Start difference. First operand 188 states. Second operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:44,127 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:44,127 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2022-02-20 16:48:44,128 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2022-02-20 16:48:44,128 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:44,128 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:44,129 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 188 states. [2022-02-20 16:48:44,129 INFO L87 Difference]: Start difference. First operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 188 states. [2022-02-20 16:48:44,134 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:44,134 INFO L93 Difference]: Finished difference Result 188 states and 242 transitions. [2022-02-20 16:48:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand 188 states and 242 transitions. [2022-02-20 16:48:44,135 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:44,135 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:44,135 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:44,135 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:44,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 88 states have (on average 1.2727272727272727) internal successors, (112), 101 states have internal predecessors, (112), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:44,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 128 transitions. [2022-02-20 16:48:44,138 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 128 transitions. Word has length 19 [2022-02-20 16:48:44,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:44,138 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 128 transitions. [2022-02-20 16:48:44,138 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 9 states have (on average 2.888888888888889) internal successors, (26), 9 states have internal predecessors, (26), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:44,139 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 128 transitions. [2022-02-20 16:48:44,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2022-02-20 16:48:44,139 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:44,139 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:44,154 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (6)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:44,354 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:48:44,354 INFO L402 AbstractCegarLoop]: === Iteration 6 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:44,354 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:44,354 INFO L85 PathProgramCache]: Analyzing trace with hash -1594907966, now seen corresponding path program 1 times [2022-02-20 16:48:44,355 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:44,355 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [59870601] [2022-02-20 16:48:44,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:44,355 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:44,355 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:44,356 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:48:44,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2022-02-20 16:48:44,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:44,431 INFO L263 TraceCheckSpWp]: Trace formula consists of 91 conjuncts, 12 conjunts are in the unsatisfiable core [2022-02-20 16:48:44,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:44,442 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:44,502 INFO L356 Elim1Store]: treesize reduction 21, result has 25.0 percent of original size [2022-02-20 16:48:44,502 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2022-02-20 16:48:44,582 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:48:44,596 INFO L290 TraceCheckUtils]: 0: Hoare triple {4254#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {4254#true} is VALID [2022-02-20 16:48:44,596 INFO L290 TraceCheckUtils]: 1: Hoare triple {4254#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {4254#true} is VALID [2022-02-20 16:48:44,599 INFO L290 TraceCheckUtils]: 2: Hoare triple {4254#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:44,599 INFO L290 TraceCheckUtils]: 3: Hoare triple {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:44,600 INFO L290 TraceCheckUtils]: 4: Hoare triple {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:44,600 INFO L290 TraceCheckUtils]: 5: Hoare triple {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:44,603 INFO L290 TraceCheckUtils]: 6: Hoare triple {4265#(not (= |ULTIMATE.start_main_~node~1#1.base| (_ bv0 32)))} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {4278#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)))} is VALID [2022-02-20 16:48:44,604 INFO L290 TraceCheckUtils]: 7: Hoare triple {4278#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)))} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {4278#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)))} is VALID [2022-02-20 16:48:44,604 INFO L290 TraceCheckUtils]: 8: Hoare triple {4278#(not (= (_ bv0 32) (select (select |#memory_$Pointer$.base| |ULTIMATE.start_main_~data~0#1.base|) |ULTIMATE.start_main_~data~0#1.offset|)))} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,606 INFO L290 TraceCheckUtils]: 9: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,607 INFO L290 TraceCheckUtils]: 10: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} goto; {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,607 INFO L290 TraceCheckUtils]: 11: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,619 INFO L290 TraceCheckUtils]: 12: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} assume !(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,620 INFO L290 TraceCheckUtils]: 13: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,620 INFO L290 TraceCheckUtils]: 14: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} goto; {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,621 INFO L290 TraceCheckUtils]: 15: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,621 INFO L290 TraceCheckUtils]: 16: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} assume !!(inspect_before_#t~mem27#1.base == 0bv32 && inspect_before_#t~mem27#1.offset == 0bv32);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,622 INFO L290 TraceCheckUtils]: 17: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} goto; {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} is VALID [2022-02-20 16:48:44,622 INFO L290 TraceCheckUtils]: 18: Hoare triple {4285#(not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) |ULTIMATE.start_inspect_before_~shape#1.offset|) (_ bv0 32)))} call inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset := read~$Pointer$(inspect_before_~shape#1.base, inspect_before_~shape#1.offset, 4bv32); {4316#(not (= |ULTIMATE.start_inspect_before_#t~mem28#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:44,623 INFO L290 TraceCheckUtils]: 19: Hoare triple {4316#(not (= |ULTIMATE.start_inspect_before_#t~mem28#1.base| (_ bv0 32)))} assume inspect_before_#t~mem28#1.base == 0bv32 && inspect_before_#t~mem28#1.offset == 0bv32;havoc inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset; {4255#false} is VALID [2022-02-20 16:48:44,623 INFO L272 TraceCheckUtils]: 20: Hoare triple {4255#false} call fail(); {4255#false} is VALID [2022-02-20 16:48:44,623 INFO L290 TraceCheckUtils]: 21: Hoare triple {4255#false} assume !false; {4255#false} is VALID [2022-02-20 16:48:44,623 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2022-02-20 16:48:44,623 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:44,623 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:44,624 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [59870601] [2022-02-20 16:48:44,624 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [59870601] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:44,624 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:44,624 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2022-02-20 16:48:44,624 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270845478] [2022-02-20 16:48:44,624 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:44,625 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:48:44,625 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:44,625 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:44,647 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 22 edges. 22 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:44,647 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2022-02-20 16:48:44,647 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:44,647 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2022-02-20 16:48:44,647 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:44,648 INFO L87 Difference]: Start difference. First operand 104 states and 128 transitions. Second operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:46,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:46,331 INFO L93 Difference]: Finished difference Result 209 states and 259 transitions. [2022-02-20 16:48:46,331 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2022-02-20 16:48:46,331 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2022-02-20 16:48:46,332 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:46,332 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:46,334 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2022-02-20 16:48:46,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:46,336 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 246 transitions. [2022-02-20 16:48:46,336 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 246 transitions. [2022-02-20 16:48:46,559 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 246 edges. 246 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:46,562 INFO L225 Difference]: With dead ends: 209 [2022-02-20 16:48:46,562 INFO L226 Difference]: Without dead ends: 206 [2022-02-20 16:48:46,562 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 25 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2022-02-20 16:48:46,563 INFO L933 BasicCegarLoop]: 80 mSDtfsCounter, 357 mSDsluCounter, 207 mSDsCounter, 0 mSdLazyCounter, 154 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 359 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 154 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:46,563 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [359 Valid, 287 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 154 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2022-02-20 16:48:46,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2022-02-20 16:48:46,577 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 110. [2022-02-20 16:48:46,578 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:46,578 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:46,579 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:46,579 INFO L87 Difference]: Start difference. First operand 206 states. Second operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:46,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:46,583 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2022-02-20 16:48:46,583 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2022-02-20 16:48:46,584 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:46,584 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:46,584 INFO L74 IsIncluded]: Start isIncluded. First operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 16:48:46,584 INFO L87 Difference]: Start difference. First operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 206 states. [2022-02-20 16:48:46,588 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:46,588 INFO L93 Difference]: Finished difference Result 206 states and 256 transitions. [2022-02-20 16:48:46,588 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 256 transitions. [2022-02-20 16:48:46,589 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:46,589 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:46,589 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:46,589 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:46,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 94 states have (on average 1.2659574468085106) internal successors, (119), 107 states have internal predecessors, (119), 14 states have call successors, (14), 2 states have call predecessors, (14), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:46,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 135 transitions. [2022-02-20 16:48:46,592 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 135 transitions. Word has length 22 [2022-02-20 16:48:46,592 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:46,592 INFO L470 AbstractCegarLoop]: Abstraction has 110 states and 135 transitions. [2022-02-20 16:48:46,592 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:46,592 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 135 transitions. [2022-02-20 16:48:46,593 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:48:46,593 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:46,593 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:46,613 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:46,804 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:48:46,804 INFO L402 AbstractCegarLoop]: === Iteration 7 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:46,804 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:46,804 INFO L85 PathProgramCache]: Analyzing trace with hash -1900694176, now seen corresponding path program 2 times [2022-02-20 16:48:46,805 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:46,805 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1300736888] [2022-02-20 16:48:46,805 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:48:46,805 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:46,805 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:46,806 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:48:46,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2022-02-20 16:48:46,887 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 16:48:46,887 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:48:46,888 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:48:46,900 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:46,901 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:47,004 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 16:48:47,013 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 7 [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 0: Hoare triple {5156#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {5156#true} is VALID [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 1: Hoare triple {5156#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {5156#true} is VALID [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 2: Hoare triple {5156#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 3: Hoare triple {5156#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {5156#true} is VALID [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 4: Hoare triple {5156#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 5: Hoare triple {5156#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {5156#true} is VALID [2022-02-20 16:48:47,029 INFO L290 TraceCheckUtils]: 6: Hoare triple {5156#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,030 INFO L290 TraceCheckUtils]: 7: Hoare triple {5156#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,030 INFO L290 TraceCheckUtils]: 8: Hoare triple {5156#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {5156#true} is VALID [2022-02-20 16:48:47,030 INFO L290 TraceCheckUtils]: 9: Hoare triple {5156#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,030 INFO L290 TraceCheckUtils]: 10: Hoare triple {5156#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {5156#true} is VALID [2022-02-20 16:48:47,030 INFO L290 TraceCheckUtils]: 11: Hoare triple {5156#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,030 INFO L290 TraceCheckUtils]: 12: Hoare triple {5156#true} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {5156#true} is VALID [2022-02-20 16:48:47,031 INFO L290 TraceCheckUtils]: 13: Hoare triple {5156#true} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {5156#true} is VALID [2022-02-20 16:48:47,031 INFO L290 TraceCheckUtils]: 14: Hoare triple {5156#true} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {5156#true} is VALID [2022-02-20 16:48:47,031 INFO L290 TraceCheckUtils]: 15: Hoare triple {5156#true} goto; {5156#true} is VALID [2022-02-20 16:48:47,032 INFO L290 TraceCheckUtils]: 16: Hoare triple {5156#true} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {5209#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.base|))} is VALID [2022-02-20 16:48:47,033 INFO L290 TraceCheckUtils]: 17: Hoare triple {5209#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.base|))} assume !(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {5213#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:47,033 INFO L290 TraceCheckUtils]: 18: Hoare triple {5213#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {5213#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:47,034 INFO L290 TraceCheckUtils]: 19: Hoare triple {5213#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} goto; {5213#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} is VALID [2022-02-20 16:48:47,034 INFO L290 TraceCheckUtils]: 20: Hoare triple {5213#(and (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)) (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32)))} call inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {5223#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} is VALID [2022-02-20 16:48:47,035 INFO L290 TraceCheckUtils]: 21: Hoare triple {5223#(and (= |ULTIMATE.start_inspect_before_#t~mem27#1.offset| (_ bv0 32)) (= |ULTIMATE.start_inspect_before_#t~mem27#1.base| (_ bv0 32)))} assume !(inspect_before_#t~mem27#1.base == 0bv32 && inspect_before_#t~mem27#1.offset == 0bv32);havoc inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset; {5157#false} is VALID [2022-02-20 16:48:47,035 INFO L272 TraceCheckUtils]: 22: Hoare triple {5157#false} call fail(); {5157#false} is VALID [2022-02-20 16:48:47,035 INFO L290 TraceCheckUtils]: 23: Hoare triple {5157#false} assume !false; {5157#false} is VALID [2022-02-20 16:48:47,035 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:48:47,035 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:47,036 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:47,036 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1300736888] [2022-02-20 16:48:47,036 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1300736888] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:47,036 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:47,036 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:48:47,036 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1511573102] [2022-02-20 16:48:47,036 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:47,037 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:47,037 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:47,037 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:47,054 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:48:47,054 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:48:47,054 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:47,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:48:47,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:48:47,054 INFO L87 Difference]: Start difference. First operand 110 states and 135 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:48,889 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:48,889 INFO L93 Difference]: Finished difference Result 137 states and 168 transitions. [2022-02-20 16:48:48,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:48:48,889 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:48,890 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:48,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:48,892 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2022-02-20 16:48:48,892 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:48,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 140 transitions. [2022-02-20 16:48:48,893 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 140 transitions. [2022-02-20 16:48:49,014 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 140 edges. 140 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:49,016 INFO L225 Difference]: With dead ends: 137 [2022-02-20 16:48:49,016 INFO L226 Difference]: Without dead ends: 134 [2022-02-20 16:48:49,017 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:49,017 INFO L933 BasicCegarLoop]: 87 mSDtfsCounter, 38 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 288 SdHoareTripleChecker+Invalid, 115 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:49,018 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [38 Valid, 288 Invalid, 115 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 114 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 16:48:49,018 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2022-02-20 16:48:49,025 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 105. [2022-02-20 16:48:49,025 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:49,026 INFO L82 GeneralOperation]: Start isEquivalent. First operand 134 states. Second operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:49,026 INFO L74 IsIncluded]: Start isIncluded. First operand 134 states. Second operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:49,026 INFO L87 Difference]: Start difference. First operand 134 states. Second operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:49,029 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:49,029 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2022-02-20 16:48:49,029 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2022-02-20 16:48:49,029 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:49,029 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:49,030 INFO L74 IsIncluded]: Start isIncluded. First operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 134 states. [2022-02-20 16:48:49,030 INFO L87 Difference]: Start difference. First operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 134 states. [2022-02-20 16:48:49,033 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:49,033 INFO L93 Difference]: Finished difference Result 134 states and 164 transitions. [2022-02-20 16:48:49,033 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 164 transitions. [2022-02-20 16:48:49,033 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:49,033 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:49,033 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:49,034 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:49,034 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 90 states have (on average 1.2555555555555555) internal successors, (113), 102 states have internal predecessors, (113), 13 states have call successors, (13), 2 states have call predecessors, (13), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:49,036 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 128 transitions. [2022-02-20 16:48:49,036 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 128 transitions. Word has length 24 [2022-02-20 16:48:49,036 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:49,036 INFO L470 AbstractCegarLoop]: Abstraction has 105 states and 128 transitions. [2022-02-20 16:48:49,036 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:49,036 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 128 transitions. [2022-02-20 16:48:49,037 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2022-02-20 16:48:49,037 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:49,037 INFO L514 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:49,050 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:49,247 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:48:49,248 INFO L402 AbstractCegarLoop]: === Iteration 8 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:49,248 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:49,248 INFO L85 PathProgramCache]: Analyzing trace with hash 2068857130, now seen corresponding path program 2 times [2022-02-20 16:48:49,249 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:49,249 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1002771342] [2022-02-20 16:48:49,249 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2022-02-20 16:48:49,249 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:49,249 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:49,250 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:48:49,253 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2022-02-20 16:48:49,319 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2022-02-20 16:48:49,319 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2022-02-20 16:48:49,320 INFO L263 TraceCheckSpWp]: Trace formula consists of 36 conjuncts, 7 conjunts are in the unsatisfiable core [2022-02-20 16:48:49,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2022-02-20 16:48:49,331 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2022-02-20 16:48:49,436 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 31 treesize of output 19 [2022-02-20 16:48:49,439 INFO L390 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2022-02-20 16:48:49,458 INFO L290 TraceCheckUtils]: 0: Hoare triple {5811#true} assume { :begin_inline_ULTIMATE.init } true;#NULL.base, #NULL.offset := 0bv32, 0bv32;assume 0bv1 == #valid[0bv32];assume ~bvult32(0bv32, #StackHeapBarrier);currentRoundingMode := ~roundNearestTiesToEven;call #Ultimate.allocInit(2bv32, 1bv32);call write~init~intINTTYPE1(48bv8, 1bv32, 0bv32, 1bv32);call write~init~intINTTYPE1(0bv8, 1bv32, 1bv32, 1bv32);call #Ultimate.allocInit(15bv32, 2bv32); {5811#true} is VALID [2022-02-20 16:48:49,458 INFO L290 TraceCheckUtils]: 1: Hoare triple {5811#true} assume { :end_inline_ULTIMATE.init } true;assume { :begin_inline_main } true;havoc main_#res#1;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset, main_#t~nondet39#1, main_#t~malloc40#1.base, main_#t~malloc40#1.offset, main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, main_#t~nondet37#1, main_#t~ret41#1.base, main_#t~ret41#1.offset, main_#t~mem42#1.base, main_#t~mem42#1.offset, main_#t~mem43#1.base, main_#t~mem43#1.offset, main_#t~mem44#1.base, main_#t~mem44#1.offset, main_~snext~0#1.base, main_~snext~0#1.offset, main_~data~0#1.base, main_~data~0#1.offset, main_~node~2#1.base, main_~node~2#1.offset;main_~data~0#1.base, main_~data~0#1.offset := 0bv32, 0bv32; {5811#true} is VALID [2022-02-20 16:48:49,458 INFO L290 TraceCheckUtils]: 2: Hoare triple {5811#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,458 INFO L290 TraceCheckUtils]: 3: Hoare triple {5811#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {5811#true} is VALID [2022-02-20 16:48:49,458 INFO L290 TraceCheckUtils]: 4: Hoare triple {5811#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 5: Hoare triple {5811#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 6: Hoare triple {5811#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 7: Hoare triple {5811#true} assume !!(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1;call main_#t~malloc38#1.base, main_#t~malloc38#1.offset := #Ultimate.allocOnHeap(8bv32);main_~node~1#1.base, main_~node~1#1.offset := main_#t~malloc38#1.base, main_#t~malloc38#1.offset;havoc main_#t~malloc38#1.base, main_#t~malloc38#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 8: Hoare triple {5811#true} assume !(main_~node~1#1.base == 0bv32 && main_~node~1#1.offset == 0bv32); {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 9: Hoare triple {5811#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~node~1#1.base, main_~node~1#1.offset, 4bv32);call write~intINTTYPE4(main_#t~nondet39#1, main_~node~1#1.base, ~bvadd32(4bv32, main_~node~1#1.offset), 4bv32);havoc main_#t~nondet39#1;call main_#t~malloc40#1.base, main_#t~malloc40#1.offset := #Ultimate.allocOnHeap(8bv32);main_~item~0#1.base, main_~item~0#1.offset := main_#t~malloc40#1.base, main_#t~malloc40#1.offset;havoc main_#t~malloc40#1.base, main_#t~malloc40#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 10: Hoare triple {5811#true} assume !(main_~item~0#1.base == 0bv32 && main_~item~0#1.offset == 0bv32); {5811#true} is VALID [2022-02-20 16:48:49,459 INFO L290 TraceCheckUtils]: 11: Hoare triple {5811#true} call write~$Pointer$(main_~node~1#1.base, main_~node~1#1.offset, main_~item~0#1.base, main_~item~0#1.offset, 4bv32);call write~$Pointer$(main_~data~0#1.base, main_~data~0#1.offset, main_~item~0#1.base, ~bvadd32(4bv32, main_~item~0#1.offset), 4bv32);main_~data~0#1.base, main_~data~0#1.offset := main_~item~0#1.base, main_~item~0#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,460 INFO L290 TraceCheckUtils]: 12: Hoare triple {5811#true} assume !(0bv32 != main_#t~nondet37#1);havoc main_#t~nondet37#1; {5811#true} is VALID [2022-02-20 16:48:49,460 INFO L290 TraceCheckUtils]: 13: Hoare triple {5811#true} assume !(main_~data~0#1.base == 0bv32 && main_~data~0#1.offset == 0bv32);assume { :begin_inline_inspect_before } true;inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset := main_~data~0#1.base, main_~data~0#1.offset;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset, inspect_before_#t~mem23#1.base, inspect_before_#t~mem23#1.offset, inspect_before_#t~mem24#1.base, inspect_before_#t~mem24#1.offset, inspect_before_#t~mem25#1.base, inspect_before_#t~mem25#1.offset, inspect_before_#t~mem21#1.base, inspect_before_#t~mem21#1.offset, inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset, inspect_before_#t~mem27#1.base, inspect_before_#t~mem27#1.offset, inspect_before_#t~mem28#1.base, inspect_before_#t~mem28#1.offset, inspect_before_#t~mem29#1.base, inspect_before_#t~mem29#1.offset, inspect_before_#t~mem30#1.base, inspect_before_#t~mem30#1.offset, inspect_before_~shape#1.base, inspect_before_~shape#1.offset;inspect_before_~shape#1.base, inspect_before_~shape#1.offset := inspect_before_#in~shape#1.base, inspect_before_#in~shape#1.offset; {5811#true} is VALID [2022-02-20 16:48:49,460 INFO L290 TraceCheckUtils]: 14: Hoare triple {5811#true} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {5811#true} is VALID [2022-02-20 16:48:49,460 INFO L290 TraceCheckUtils]: 15: Hoare triple {5811#true} goto; {5811#true} is VALID [2022-02-20 16:48:49,461 INFO L290 TraceCheckUtils]: 16: Hoare triple {5811#true} call inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {5864#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.base|))} is VALID [2022-02-20 16:48:49,461 INFO L290 TraceCheckUtils]: 17: Hoare triple {5864#(and (= |ULTIMATE.start_inspect_before_#t~mem26#1.offset| (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|))) (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) |ULTIMATE.start_inspect_before_#t~mem26#1.base|))} assume !!(inspect_before_#t~mem26#1.base != 0bv32 || inspect_before_#t~mem26#1.offset != 0bv32);havoc inspect_before_#t~mem26#1.base, inspect_before_#t~mem26#1.offset; {5868#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:48:49,462 INFO L290 TraceCheckUtils]: 18: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))))} assume !(inspect_before_~shape#1.base == 0bv32 && inspect_before_~shape#1.offset == 0bv32); {5868#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:48:49,463 INFO L290 TraceCheckUtils]: 19: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))))} goto; {5868#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))))} is VALID [2022-02-20 16:48:49,463 INFO L290 TraceCheckUtils]: 20: Hoare triple {5868#(or (not (= (select (select |#memory_$Pointer$.base| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))) (not (= (select (select |#memory_$Pointer$.offset| |ULTIMATE.start_inspect_before_~shape#1.base|) (bvadd (_ bv4 32) |ULTIMATE.start_inspect_before_~shape#1.offset|)) (_ bv0 32))))} call inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset := read~$Pointer$(inspect_before_~shape#1.base, ~bvadd32(4bv32, inspect_before_~shape#1.offset), 4bv32); {5878#(or (not (= (_ bv0 32) |ULTIMATE.start_inspect_before_#t~mem22#1.base|)) (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.offset| (_ bv0 32))))} is VALID [2022-02-20 16:48:49,464 INFO L290 TraceCheckUtils]: 21: Hoare triple {5878#(or (not (= (_ bv0 32) |ULTIMATE.start_inspect_before_#t~mem22#1.base|)) (not (= |ULTIMATE.start_inspect_before_#t~mem22#1.offset| (_ bv0 32))))} assume inspect_before_#t~mem22#1.base == 0bv32 && inspect_before_#t~mem22#1.offset == 0bv32;havoc inspect_before_#t~mem22#1.base, inspect_before_#t~mem22#1.offset; {5812#false} is VALID [2022-02-20 16:48:49,464 INFO L272 TraceCheckUtils]: 22: Hoare triple {5812#false} call fail(); {5812#false} is VALID [2022-02-20 16:48:49,464 INFO L290 TraceCheckUtils]: 23: Hoare triple {5812#false} assume !false; {5812#false} is VALID [2022-02-20 16:48:49,464 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2022-02-20 16:48:49,464 INFO L324 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2022-02-20 16:48:49,464 INFO L144 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2022-02-20 16:48:49,464 INFO L338 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1002771342] [2022-02-20 16:48:49,464 INFO L165 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1002771342] provided 1 perfect and 0 imperfect interpolant sequences [2022-02-20 16:48:49,464 INFO L191 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2022-02-20 16:48:49,465 INFO L204 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2022-02-20 16:48:49,465 INFO L118 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [546524340] [2022-02-20 16:48:49,465 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2022-02-20 16:48:49,465 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:49,465 INFO L84 Accepts]: Finished accepts. word is accepted. [2022-02-20 16:48:49,465 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:49,480 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:48:49,480 INFO L546 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2022-02-20 16:48:49,480 INFO L108 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2022-02-20 16:48:49,481 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2022-02-20 16:48:49,481 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2022-02-20 16:48:49,481 INFO L87 Difference]: Start difference. First operand 105 states and 128 transitions. Second operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:51,190 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:51,190 INFO L93 Difference]: Finished difference Result 107 states and 129 transitions. [2022-02-20 16:48:51,190 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2022-02-20 16:48:51,190 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2022-02-20 16:48:51,190 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2022-02-20 16:48:51,190 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:51,192 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-02-20 16:48:51,192 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:51,193 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 106 transitions. [2022-02-20 16:48:51,193 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 106 transitions. [2022-02-20 16:48:51,275 INFO L122 InductivityCheck]: Floyd-Hoare automaton has 106 edges. 106 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2022-02-20 16:48:51,277 INFO L225 Difference]: With dead ends: 107 [2022-02-20 16:48:51,277 INFO L226 Difference]: Without dead ends: 104 [2022-02-20 16:48:51,277 INFO L932 BasicCegarLoop]: 0 DeclaredPredicates, 24 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2022-02-20 16:48:51,278 INFO L933 BasicCegarLoop]: 94 mSDtfsCounter, 11 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 307 SdHoareTripleChecker+Invalid, 89 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2022-02-20 16:48:51,278 INFO L934 BasicCegarLoop]: SdHoareTripleChecker [11 Valid, 307 Invalid, 89 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2022-02-20 16:48:51,279 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2022-02-20 16:48:51,295 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2022-02-20 16:48:51,296 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2022-02-20 16:48:51,296 INFO L82 GeneralOperation]: Start isEquivalent. First operand 104 states. Second operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:51,297 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:51,298 INFO L87 Difference]: Start difference. First operand 104 states. Second operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:51,302 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:51,302 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-02-20 16:48:51,303 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2022-02-20 16:48:51,303 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:51,303 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:51,310 INFO L74 IsIncluded]: Start isIncluded. First operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 104 states. [2022-02-20 16:48:51,311 INFO L87 Difference]: Start difference. First operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) Second operand 104 states. [2022-02-20 16:48:51,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2022-02-20 16:48:51,313 INFO L93 Difference]: Finished difference Result 104 states and 126 transitions. [2022-02-20 16:48:51,313 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2022-02-20 16:48:51,313 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2022-02-20 16:48:51,313 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2022-02-20 16:48:51,313 INFO L88 GeneralOperation]: Finished isEquivalent. [2022-02-20 16:48:51,313 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2022-02-20 16:48:51,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 90 states have (on average 1.2444444444444445) internal successors, (112), 101 states have internal predecessors, (112), 12 states have call successors, (12), 2 states have call predecessors, (12), 1 states have return successors, (2), 1 states have call predecessors, (2), 2 states have call successors, (2) [2022-02-20 16:48:51,315 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 126 transitions. [2022-02-20 16:48:51,315 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 126 transitions. Word has length 24 [2022-02-20 16:48:51,315 INFO L84 Accepts]: Finished accepts. word is rejected. [2022-02-20 16:48:51,316 INFO L470 AbstractCegarLoop]: Abstraction has 104 states and 126 transitions. [2022-02-20 16:48:51,316 INFO L471 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 3.6) internal successors, (18), 5 states have internal predecessors, (18), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2022-02-20 16:48:51,316 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 126 transitions. [2022-02-20 16:48:51,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2022-02-20 16:48:51,317 INFO L506 BasicCegarLoop]: Found error trace [2022-02-20 16:48:51,317 INFO L514 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2022-02-20 16:48:51,329 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:51,523 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:48:51,524 INFO L402 AbstractCegarLoop]: === Iteration 9 === Targeting failErr0ASSERT_VIOLATIONERROR_FUNCTION === [failErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2022-02-20 16:48:51,524 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2022-02-20 16:48:51,524 INFO L85 PathProgramCache]: Analyzing trace with hash 1214031067, now seen corresponding path program 1 times [2022-02-20 16:48:51,524 INFO L126 FreeRefinementEngine]: Executing refinement strategy WOLF [2022-02-20 16:48:51,524 INFO L338 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473191879] [2022-02-20 16:48:51,524 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2022-02-20 16:48:51,524 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -unsat_core_generation=3 [2022-02-20 16:48:51,525 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat [2022-02-20 16:48:51,525 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2022-02-20 16:48:51,526 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2022-02-20 16:48:51,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:48:51,612 INFO L352 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2022-02-20 16:48:51,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2022-02-20 16:48:51,669 INFO L138 FreeRefinementEngine]: Strategy WOLF found a feasible trace [2022-02-20 16:48:51,670 INFO L628 BasicCegarLoop]: Counterexample is feasible [2022-02-20 16:48:51,671 INFO L764 garLoopResultBuilder]: Registering result UNSAFE for location failErr0ASSERT_VIOLATIONERROR_FUNCTION (0 of 1 remaining) [2022-02-20 16:48:51,690 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2022-02-20 16:48:51,872 WARN L452 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/mathsat -unsat_core_generation=3 [2022-02-20 16:48:51,875 INFO L732 BasicCegarLoop]: Path program histogram: [2, 2, 1, 1, 1, 1, 1] [2022-02-20 16:48:51,877 INFO L180 ceAbstractionStarter]: Computing trace abstraction results [2022-02-20 16:48:51,891 FATAL L489 DefaultTranslator]: Callstack has procedure call flag but succeeding procedure is empty at [CALL] call fail(); [2022-02-20 16:48:51,891 FATAL L? ?]: The Plugin de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction has thrown an exception: java.lang.AssertionError: callstack broken after backtranslation by InlinerBacktranslator at de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:216) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:225) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ModelTranslationContainer.translateProgramExecution(ModelTranslationContainer.java:206) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getProgramExecutionAsString(CounterExampleResult.java:155) at de.uni_freiburg.informatik.ultimate.core.lib.results.CounterExampleResult.getLongDescription(CounterExampleResult.java:134) at de.uni_freiburg.informatik.ultimate.core.coreplugin.services.ResultService.reportResult(ResultService.java:86) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.CegarLoopResultReporter.reportResult(CegarLoopResultReporter.java:141) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.reportLocationResults(TraceAbstractionStarter.java:607) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.runCegarLoops(TraceAbstractionStarter.java:182) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionStarter.(TraceAbstractionStarter.java:156) at de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver.finish(TraceAbstractionObserver.java:123) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runObserver(PluginConnector.java:168) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.runTool(PluginConnector.java:151) at de.uni_freiburg.informatik.ultimate.core.coreplugin.PluginConnector.run(PluginConnector.java:128) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.executePluginConnector(ToolchainWalker.java:232) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.processPlugin(ToolchainWalker.java:226) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walkUnprotected(ToolchainWalker.java:142) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainWalker.walk(ToolchainWalker.java:104) at de.uni_freiburg.informatik.ultimate.core.coreplugin.ToolchainManager$Toolchain.processToolchain(ToolchainManager.java:320) at de.uni_freiburg.informatik.ultimate.core.coreplugin.toolchain.DefaultToolchainJob.run(DefaultToolchainJob.java:145) at org.eclipse.core.internal.jobs.Worker.run(Worker.java:63) [2022-02-20 16:48:51,893 INFO L158 Benchmark]: Toolchain (without parser) took 23110.87ms. Allocated memory was 54.5MB in the beginning and 83.9MB in the end (delta: 29.4MB). Free memory was 30.0MB in the beginning and 45.0MB in the end (delta: -14.9MB). Peak memory consumption was 15.7MB. Max. memory is 16.1GB. [2022-02-20 16:48:51,893 INFO L158 Benchmark]: CDTParser took 0.10ms. Allocated memory is still 54.5MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. [2022-02-20 16:48:51,894 INFO L158 Benchmark]: CACSL2BoogieTranslator took 520.73ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 29.8MB in the beginning and 40.9MB in the end (delta: -11.2MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. [2022-02-20 16:48:51,894 INFO L158 Benchmark]: Boogie Procedure Inliner took 90.11ms. Allocated memory is still 69.2MB. Free memory was 40.7MB in the beginning and 37.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. [2022-02-20 16:48:51,894 INFO L158 Benchmark]: Boogie Preprocessor took 60.15ms. Allocated memory is still 69.2MB. Free memory was 37.5MB in the beginning and 49.4MB in the end (delta: -11.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. [2022-02-20 16:48:51,894 INFO L158 Benchmark]: RCFGBuilder took 874.71ms. Allocated memory is still 69.2MB. Free memory was 49.2MB in the beginning and 35.2MB in the end (delta: 14.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. [2022-02-20 16:48:51,894 INFO L158 Benchmark]: TraceAbstraction took 21555.97ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 34.6MB in the beginning and 45.0MB in the end (delta: -10.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. [2022-02-20 16:48:51,896 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.10ms. Allocated memory is still 54.5MB. Free memory is still 36.4MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 520.73ms. Allocated memory was 54.5MB in the beginning and 69.2MB in the end (delta: 14.7MB). Free memory was 29.8MB in the beginning and 40.9MB in the end (delta: -11.2MB). Peak memory consumption was 5.5MB. Max. memory is 16.1GB. * Boogie Procedure Inliner took 90.11ms. Allocated memory is still 69.2MB. Free memory was 40.7MB in the beginning and 37.5MB in the end (delta: 3.2MB). Peak memory consumption was 2.1MB. Max. memory is 16.1GB. * Boogie Preprocessor took 60.15ms. Allocated memory is still 69.2MB. Free memory was 37.5MB in the beginning and 49.4MB in the end (delta: -11.9MB). Peak memory consumption was 5.4MB. Max. memory is 16.1GB. * RCFGBuilder took 874.71ms. Allocated memory is still 69.2MB. Free memory was 49.2MB in the beginning and 35.2MB in the end (delta: 14.0MB). Peak memory consumption was 17.3MB. Max. memory is 16.1GB. * TraceAbstraction took 21555.97ms. Allocated memory was 69.2MB in the beginning and 83.9MB in the end (delta: 14.7MB). Free memory was 34.6MB in the beginning and 45.0MB in the end (delta: -10.4MB). Peak memory consumption was 4.1MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - StatisticsResult: ErrorAutomatonStatistics NumberErrorTraces: 0, NumberStatementsAllTraces: 0, NumberRelevantStatements: 0, 0.0s ErrorAutomatonConstructionTimeTotal, 0.0s FaulLocalizationTime, NumberStatementsFirstTrace: -1, TraceLengthAvg: 0, 0.0s ErrorAutomatonConstructionTimeAvg, 0.0s ErrorAutomatonDifferenceTimeAvg, 0.0s ErrorAutomatonDifferenceTimeTotal, NumberOfNoEnhancement: 0, NumberOfFiniteEnhancement: 0, NumberOfInfiniteEnhancement: 0 - ExceptionOrErrorResult: AssertionError: callstack broken after backtranslation by InlinerBacktranslator de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: AssertionError: callstack broken after backtranslation by InlinerBacktranslator: de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator.translateProgramExecution(InlinerBacktranslator.java:230) RESULT: Ultimate could not prove your program: Toolchain returned no result. [2022-02-20 16:48:51,930 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: callstack broken after backtranslation by InlinerBacktranslator