./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 8bd4bc60 Calling Ultimate with: /usr/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx12G -Xms1G -ea -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.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(__VERIFIER_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 534681b11e8e68e6058985d885b01f2cbfa43e5b ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 17:56:01,134 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 17:56:01,139 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 17:56:01,150 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 17:56:01,151 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 17:56:01,152 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 17:56:01,153 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 17:56:01,155 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 17:56:01,157 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 17:56:01,158 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 17:56:01,159 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 17:56:01,160 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 17:56:01,160 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 17:56:01,161 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 17:56:01,162 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 17:56:01,163 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 17:56:01,164 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 17:56:01,165 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 17:56:01,167 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 17:56:01,169 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 17:56:01,171 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 17:56:01,172 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 17:56:01,173 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 17:56:01,174 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 17:56:01,176 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 17:56:01,177 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 17:56:01,177 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 17:56:01,178 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 17:56:01,178 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 17:56:01,179 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 17:56:01,180 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 17:56:01,180 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 17:56:01,181 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 17:56:01,182 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 17:56:01,183 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 17:56:01,183 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 17:56:01,184 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 17:56:01,184 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 17:56:01,185 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 17:56:01,186 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 17:56:01,186 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 17:56:01,187 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 17:56:01,202 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 17:56:01,203 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 17:56:01,204 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 17:56:01,204 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 17:56:01,204 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 17:56:01,204 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 17:56:01,205 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 17:56:01,205 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 17:56:01,205 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 17:56:01,205 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 17:56:01,206 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 17:56:01,206 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 17:56:01,206 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 17:56:01,206 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 17:56:01,206 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 17:56:01,207 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 17:56:01,207 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 17:56:01,207 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 17:56:01,207 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 17:56:01,208 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 17:56:01,208 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 17:56:01,208 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:56:01,208 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 17:56:01,208 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 17:56:01,209 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 17:56:01,209 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 17:56:01,209 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 17:56:01,209 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 17:56:01,210 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 17:56:01,210 INFO L138 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode 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(__VERIFIER_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 -> 534681b11e8e68e6058985d885b01f2cbfa43e5b [2020-07-28 17:56:01,500 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 17:56:01,512 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 17:56:01,516 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 17:56:01,517 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 17:56:01,518 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 17:56:01,518 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2020-07-28 17:56:01,576 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83759cac6/8df65fe7dbc64bab824f8bb4e5ead11d/FLAGf4b610243 [2020-07-28 17:56:02,080 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 17:56:02,080 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/heap-manipulation/merge_sort-1.i [2020-07-28 17:56:02,093 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83759cac6/8df65fe7dbc64bab824f8bb4e5ead11d/FLAGf4b610243 [2020-07-28 17:56:02,344 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/83759cac6/8df65fe7dbc64bab824f8bb4e5ead11d [2020-07-28 17:56:02,347 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 17:56:02,350 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 17:56:02,352 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 17:56:02,352 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 17:56:02,356 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 17:56:02,358 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:56:02" (1/1) ... [2020-07-28 17:56:02,361 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@12a976b6 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:02, skipping insertion in model container [2020-07-28 17:56:02,361 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 05:56:02" (1/1) ... [2020-07-28 17:56:02,370 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 17:56:02,436 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 17:56:02,864 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:56:02,881 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 17:56:02,994 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 17:56:03,062 INFO L208 MainTranslator]: Completed translation [2020-07-28 17:56:03,062 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03 WrapperNode [2020-07-28 17:56:03,062 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 17:56:03,063 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 17:56:03,063 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 17:56:03,064 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 17:56:03,072 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,093 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,142 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 17:56:03,143 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 17:56:03,143 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 17:56:03,143 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 17:56:03,153 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,153 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,159 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,162 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,204 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,221 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,227 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... [2020-07-28 17:56:03,238 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 17:56:03,238 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 17:56:03,239 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 17:56:03,239 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 17:56:03,240 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (1/1) ... No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 17:56:03,303 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 17:56:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 17:56:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 17:56:03,304 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2020-07-28 17:56:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 17:56:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 17:56:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 17:56:03,305 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 17:56:03,305 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 17:56:04,174 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 17:56:04,174 INFO L295 CfgBuilder]: Removed 75 assume(true) statements. [2020-07-28 17:56:04,181 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:56:04 BoogieIcfgContainer [2020-07-28 17:56:04,182 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 17:56:04,185 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 17:56:04,185 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 17:56:04,189 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 17:56:04,189 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 05:56:02" (1/3) ... [2020-07-28 17:56:04,190 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c503c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:56:04, skipping insertion in model container [2020-07-28 17:56:04,191 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 05:56:03" (2/3) ... [2020-07-28 17:56:04,192 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6c503c57 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 05:56:04, skipping insertion in model container [2020-07-28 17:56:04,193 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:56:04" (3/3) ... [2020-07-28 17:56:04,195 INFO L109 eAbstractionObserver]: Analyzing ICFG merge_sort-1.i [2020-07-28 17:56:04,206 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 17:56:04,216 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 13 error locations. [2020-07-28 17:56:04,231 INFO L251 AbstractCegarLoop]: Starting to check reachability of 13 error locations. [2020-07-28 17:56:04,261 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 17:56:04,261 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 17:56:04,262 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 17:56:04,262 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 17:56:04,262 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 17:56:04,263 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 17:56:04,263 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 17:56:04,263 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 17:56:04,288 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states. [2020-07-28 17:56:04,294 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2020-07-28 17:56:04,295 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:04,296 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2020-07-28 17:56:04,296 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:04,302 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:04,303 INFO L82 PathProgramCache]: Analyzing trace with hash 890218827, now seen corresponding path program 1 times [2020-07-28 17:56:04,313 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:04,314 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [809665835] [2020-07-28 17:56:04,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:04,399 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:04,443 INFO L280 TraceCheckUtils]: 0: Hoare triple {102#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {102#true} is VALID [2020-07-28 17:56:04,444 INFO L280 TraceCheckUtils]: 1: Hoare triple {102#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {102#true} is VALID [2020-07-28 17:56:04,445 INFO L280 TraceCheckUtils]: 2: Hoare triple {102#true} assume !true; {103#false} is VALID [2020-07-28 17:56:04,446 INFO L280 TraceCheckUtils]: 3: Hoare triple {103#false} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {103#false} is VALID [2020-07-28 17:56:04,446 INFO L280 TraceCheckUtils]: 4: Hoare triple {103#false} assume inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0; {103#false} is VALID [2020-07-28 17:56:04,448 INFO L280 TraceCheckUtils]: 5: Hoare triple {103#false} assume !false; {103#false} is VALID [2020-07-28 17:56:04,451 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:56:04,452 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [809665835] [2020-07-28 17:56:04,452 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:04,453 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2020-07-28 17:56:04,454 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1990931184] [2020-07-28 17:56:04,460 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 17:56:04,461 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:04,466 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states. [2020-07-28 17:56:04,484 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 6 edges. 6 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:04,485 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2020-07-28 17:56:04,485 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:04,494 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2020-07-28 17:56:04,495 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2020-07-28 17:56:04,497 INFO L87 Difference]: Start difference. First operand 99 states. Second operand 2 states. [2020-07-28 17:56:04,684 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:04,685 INFO L93 Difference]: Finished difference Result 196 states and 316 transitions. [2020-07-28 17:56:04,685 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2020-07-28 17:56:04,685 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 6 [2020-07-28 17:56:04,686 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:04,688 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:56:04,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2020-07-28 17:56:04,698 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2 states. [2020-07-28 17:56:04,703 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2 states to 2 states and 316 transitions. [2020-07-28 17:56:04,704 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 2 states and 316 transitions. [2020-07-28 17:56:05,110 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 316 edges. 316 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:05,126 INFO L225 Difference]: With dead ends: 196 [2020-07-28 17:56:05,126 INFO L226 Difference]: Without dead ends: 92 [2020-07-28 17:56:05,130 INFO L675 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 [2020-07-28 17:56:05,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-28 17:56:05,173 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-07-28 17:56:05,174 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:05,174 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:05,175 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:05,175 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:05,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:05,181 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2020-07-28 17:56:05,182 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2020-07-28 17:56:05,183 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:05,183 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:05,183 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:05,184 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:05,188 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:05,189 INFO L93 Difference]: Finished difference Result 92 states and 102 transitions. [2020-07-28 17:56:05,189 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2020-07-28 17:56:05,190 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:05,190 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:05,191 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:05,191 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:05,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-28 17:56:05,195 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 102 transitions. [2020-07-28 17:56:05,197 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 102 transitions. Word has length 6 [2020-07-28 17:56:05,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:05,197 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 102 transitions. [2020-07-28 17:56:05,197 INFO L480 AbstractCegarLoop]: Interpolant automaton has 2 states. [2020-07-28 17:56:05,198 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 102 transitions. [2020-07-28 17:56:05,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2020-07-28 17:56:05,198 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:05,198 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:56:05,199 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 17:56:05,199 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:05,200 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:05,200 INFO L82 PathProgramCache]: Analyzing trace with hash 1806865150, now seen corresponding path program 1 times [2020-07-28 17:56:05,200 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:05,201 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [518471829] [2020-07-28 17:56:05,201 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:05,217 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:05,262 INFO L280 TraceCheckUtils]: 0: Hoare triple {609#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {609#true} is VALID [2020-07-28 17:56:05,264 INFO L280 TraceCheckUtils]: 1: Hoare triple {609#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {611#(and (= 0 ULTIMATE.start_main_~data~0.offset) (= 0 ULTIMATE.start_main_~data~0.base))} is VALID [2020-07-28 17:56:05,265 INFO L280 TraceCheckUtils]: 2: Hoare triple {611#(and (= 0 ULTIMATE.start_main_~data~0.offset) (= 0 ULTIMATE.start_main_~data~0.base))} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {611#(and (= 0 ULTIMATE.start_main_~data~0.offset) (= 0 ULTIMATE.start_main_~data~0.base))} is VALID [2020-07-28 17:56:05,266 INFO L280 TraceCheckUtils]: 3: Hoare triple {611#(and (= 0 ULTIMATE.start_main_~data~0.offset) (= 0 ULTIMATE.start_main_~data~0.base))} assume !(0 != main_#t~nondet36);havoc main_#t~nondet36; {611#(and (= 0 ULTIMATE.start_main_~data~0.offset) (= 0 ULTIMATE.start_main_~data~0.base))} is VALID [2020-07-28 17:56:05,267 INFO L280 TraceCheckUtils]: 4: Hoare triple {611#(and (= 0 ULTIMATE.start_main_~data~0.offset) (= 0 ULTIMATE.start_main_~data~0.base))} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {610#false} is VALID [2020-07-28 17:56:05,268 INFO L280 TraceCheckUtils]: 5: Hoare triple {610#false} assume inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0; {610#false} is VALID [2020-07-28 17:56:05,268 INFO L280 TraceCheckUtils]: 6: Hoare triple {610#false} assume !false; {610#false} is VALID [2020-07-28 17:56:05,269 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:56:05,269 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [518471829] [2020-07-28 17:56:05,270 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:05,270 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 17:56:05,270 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [132316572] [2020-07-28 17:56:05,272 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 17:56:05,272 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:05,272 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 17:56:05,283 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 7 edges. 7 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:05,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 17:56:05,283 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:05,284 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 17:56:05,284 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 17:56:05,284 INFO L87 Difference]: Start difference. First operand 92 states and 102 transitions. Second operand 3 states. [2020-07-28 17:56:05,521 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:05,521 INFO L93 Difference]: Finished difference Result 182 states and 202 transitions. [2020-07-28 17:56:05,522 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 17:56:05,522 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2020-07-28 17:56:05,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:05,522 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:56:05,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-28 17:56:05,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 17:56:05,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 202 transitions. [2020-07-28 17:56:05,529 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 202 transitions. [2020-07-28 17:56:05,768 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 202 edges. 202 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:05,771 INFO L225 Difference]: With dead ends: 182 [2020-07-28 17:56:05,772 INFO L226 Difference]: Without dead ends: 98 [2020-07-28 17:56:05,773 INFO L675 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 [2020-07-28 17:56:05,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2020-07-28 17:56:05,787 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 94. [2020-07-28 17:56:05,787 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:05,787 INFO L82 GeneralOperation]: Start isEquivalent. First operand 98 states. Second operand 94 states. [2020-07-28 17:56:05,787 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 94 states. [2020-07-28 17:56:05,788 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 94 states. [2020-07-28 17:56:05,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:05,792 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2020-07-28 17:56:05,793 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2020-07-28 17:56:05,794 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:05,794 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:05,794 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 98 states. [2020-07-28 17:56:05,794 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 98 states. [2020-07-28 17:56:05,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:05,799 INFO L93 Difference]: Finished difference Result 98 states and 108 transitions. [2020-07-28 17:56:05,799 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 108 transitions. [2020-07-28 17:56:05,804 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:05,804 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:05,804 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:05,805 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:05,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-28 17:56:05,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 104 transitions. [2020-07-28 17:56:05,809 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 104 transitions. Word has length 7 [2020-07-28 17:56:05,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:05,809 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 104 transitions. [2020-07-28 17:56:05,809 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 17:56:05,809 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 104 transitions. [2020-07-28 17:56:05,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 17:56:05,810 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:05,810 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:56:05,810 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 17:56:05,811 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:05,811 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:05,811 INFO L82 PathProgramCache]: Analyzing trace with hash 663763925, now seen corresponding path program 1 times [2020-07-28 17:56:05,811 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:05,812 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [584736118] [2020-07-28 17:56:05,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:05,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:05,914 INFO L280 TraceCheckUtils]: 0: Hoare triple {1114#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {1114#true} is VALID [2020-07-28 17:56:05,915 INFO L280 TraceCheckUtils]: 1: Hoare triple {1114#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {1114#true} is VALID [2020-07-28 17:56:05,916 INFO L280 TraceCheckUtils]: 2: Hoare triple {1114#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {1114#true} is VALID [2020-07-28 17:56:05,916 INFO L280 TraceCheckUtils]: 3: Hoare triple {1114#true} assume !!(0 != main_#t~nondet36);havoc main_#t~nondet36;call main_#t~malloc37.base, main_#t~malloc37.offset := #Ultimate.allocOnHeap(8);main_~node~1.base, main_~node~1.offset := main_#t~malloc37.base, main_#t~malloc37.offset; {1114#true} is VALID [2020-07-28 17:56:05,917 INFO L280 TraceCheckUtils]: 4: Hoare triple {1114#true} assume !(main_~node~1.base == 0 && main_~node~1.offset == 0); {1114#true} is VALID [2020-07-28 17:56:05,920 INFO L280 TraceCheckUtils]: 5: Hoare triple {1114#true} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~node~1.base, main_~node~1.offset, 4);assume -2147483648 <= main_#t~nondet38 && main_#t~nondet38 <= 2147483647;call write~int(main_#t~nondet38, main_~node~1.base, 4 + main_~node~1.offset, 4);havoc main_#t~nondet38;call main_#t~malloc39.base, main_#t~malloc39.offset := #Ultimate.allocOnHeap(8);main_~item~0.base, main_~item~0.offset := main_#t~malloc39.base, main_#t~malloc39.offset; {1116#(not (= 0 ULTIMATE.start_main_~item~0.base))} is VALID [2020-07-28 17:56:05,922 INFO L280 TraceCheckUtils]: 6: Hoare triple {1116#(not (= 0 ULTIMATE.start_main_~item~0.base))} assume !(main_~item~0.base == 0 && main_~item~0.offset == 0); {1116#(not (= 0 ULTIMATE.start_main_~item~0.base))} is VALID [2020-07-28 17:56:05,923 INFO L280 TraceCheckUtils]: 7: Hoare triple {1116#(not (= 0 ULTIMATE.start_main_~item~0.base))} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, 4);call write~$Pointer$(main_~data~0.base, main_~data~0.offset, main_~item~0.base, 4 + main_~item~0.offset, 4);main_~data~0.base, main_~data~0.offset := main_~item~0.base, main_~item~0.offset; {1117#(not (= 0 ULTIMATE.start_main_~data~0.base))} is VALID [2020-07-28 17:56:05,924 INFO L280 TraceCheckUtils]: 8: Hoare triple {1117#(not (= 0 ULTIMATE.start_main_~data~0.base))} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {1117#(not (= 0 ULTIMATE.start_main_~data~0.base))} is VALID [2020-07-28 17:56:05,927 INFO L280 TraceCheckUtils]: 9: Hoare triple {1117#(not (= 0 ULTIMATE.start_main_~data~0.base))} assume !(0 != main_#t~nondet36);havoc main_#t~nondet36; {1117#(not (= 0 ULTIMATE.start_main_~data~0.base))} is VALID [2020-07-28 17:56:05,928 INFO L280 TraceCheckUtils]: 10: Hoare triple {1117#(not (= 0 ULTIMATE.start_main_~data~0.base))} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {1118#(not (= ULTIMATE.start_inspect_before_~shape.base 0))} is VALID [2020-07-28 17:56:05,930 INFO L280 TraceCheckUtils]: 11: Hoare triple {1118#(not (= ULTIMATE.start_inspect_before_~shape.base 0))} assume inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0; {1115#false} is VALID [2020-07-28 17:56:05,931 INFO L280 TraceCheckUtils]: 12: Hoare triple {1115#false} assume !false; {1115#false} is VALID [2020-07-28 17:56:05,932 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:56:05,933 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [584736118] [2020-07-28 17:56:05,933 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:05,933 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:56:05,934 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [16543676] [2020-07-28 17:56:05,934 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 17:56:05,934 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:05,935 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:56:05,951 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 13 edges. 13 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:05,951 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:56:05,952 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:05,952 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:56:05,952 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:56:05,953 INFO L87 Difference]: Start difference. First operand 94 states and 104 transitions. Second operand 5 states. [2020-07-28 17:56:06,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:06,691 INFO L93 Difference]: Finished difference Result 253 states and 288 transitions. [2020-07-28 17:56:06,691 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2020-07-28 17:56:06,691 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 13 [2020-07-28 17:56:06,691 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:06,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:56:06,696 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2020-07-28 17:56:06,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:56:06,700 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 288 transitions. [2020-07-28 17:56:06,700 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 6 states and 288 transitions. [2020-07-28 17:56:07,073 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 288 edges. 288 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:07,090 INFO L225 Difference]: With dead ends: 253 [2020-07-28 17:56:07,091 INFO L226 Difference]: Without dead ends: 247 [2020-07-28 17:56:07,091 INFO L675 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 [2020-07-28 17:56:07,096 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 247 states. [2020-07-28 17:56:07,142 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 247 to 96. [2020-07-28 17:56:07,142 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:07,142 INFO L82 GeneralOperation]: Start isEquivalent. First operand 247 states. Second operand 96 states. [2020-07-28 17:56:07,143 INFO L74 IsIncluded]: Start isIncluded. First operand 247 states. Second operand 96 states. [2020-07-28 17:56:07,143 INFO L87 Difference]: Start difference. First operand 247 states. Second operand 96 states. [2020-07-28 17:56:07,154 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:07,154 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2020-07-28 17:56:07,155 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 282 transitions. [2020-07-28 17:56:07,162 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:07,162 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:07,162 INFO L74 IsIncluded]: Start isIncluded. First operand 96 states. Second operand 247 states. [2020-07-28 17:56:07,163 INFO L87 Difference]: Start difference. First operand 96 states. Second operand 247 states. [2020-07-28 17:56:07,172 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:07,172 INFO L93 Difference]: Finished difference Result 247 states and 282 transitions. [2020-07-28 17:56:07,172 INFO L276 IsEmpty]: Start isEmpty. Operand 247 states and 282 transitions. [2020-07-28 17:56:07,173 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:07,173 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:07,173 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:07,174 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:07,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2020-07-28 17:56:07,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 107 transitions. [2020-07-28 17:56:07,178 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 107 transitions. Word has length 13 [2020-07-28 17:56:07,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:07,181 INFO L479 AbstractCegarLoop]: Abstraction has 96 states and 107 transitions. [2020-07-28 17:56:07,181 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:56:07,181 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 107 transitions. [2020-07-28 17:56:07,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 17:56:07,182 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:07,182 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:56:07,182 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2020-07-28 17:56:07,183 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:07,183 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:07,183 INFO L82 PathProgramCache]: Analyzing trace with hash 2036062252, now seen corresponding path program 1 times [2020-07-28 17:56:07,184 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:07,191 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1923083885] [2020-07-28 17:56:07,191 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:07,240 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:07,311 INFO L280 TraceCheckUtils]: 0: Hoare triple {2011#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2011#true} is VALID [2020-07-28 17:56:07,312 INFO L280 TraceCheckUtils]: 1: Hoare triple {2011#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {2011#true} is VALID [2020-07-28 17:56:07,312 INFO L280 TraceCheckUtils]: 2: Hoare triple {2011#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {2011#true} is VALID [2020-07-28 17:56:07,312 INFO L280 TraceCheckUtils]: 3: Hoare triple {2011#true} assume !!(0 != main_#t~nondet36);havoc main_#t~nondet36;call main_#t~malloc37.base, main_#t~malloc37.offset := #Ultimate.allocOnHeap(8);main_~node~1.base, main_~node~1.offset := main_#t~malloc37.base, main_#t~malloc37.offset; {2011#true} is VALID [2020-07-28 17:56:07,313 INFO L280 TraceCheckUtils]: 4: Hoare triple {2011#true} assume !(main_~node~1.base == 0 && main_~node~1.offset == 0); {2011#true} is VALID [2020-07-28 17:56:07,313 INFO L280 TraceCheckUtils]: 5: Hoare triple {2011#true} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~node~1.base, main_~node~1.offset, 4);assume -2147483648 <= main_#t~nondet38 && main_#t~nondet38 <= 2147483647;call write~int(main_#t~nondet38, main_~node~1.base, 4 + main_~node~1.offset, 4);havoc main_#t~nondet38;call main_#t~malloc39.base, main_#t~malloc39.offset := #Ultimate.allocOnHeap(8);main_~item~0.base, main_~item~0.offset := main_#t~malloc39.base, main_#t~malloc39.offset; {2011#true} is VALID [2020-07-28 17:56:07,313 INFO L280 TraceCheckUtils]: 6: Hoare triple {2011#true} assume !(main_~item~0.base == 0 && main_~item~0.offset == 0); {2011#true} is VALID [2020-07-28 17:56:07,313 INFO L280 TraceCheckUtils]: 7: Hoare triple {2011#true} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, 4);call write~$Pointer$(main_~data~0.base, main_~data~0.offset, main_~item~0.base, 4 + main_~item~0.offset, 4);main_~data~0.base, main_~data~0.offset := main_~item~0.base, main_~item~0.offset; {2011#true} is VALID [2020-07-28 17:56:07,314 INFO L280 TraceCheckUtils]: 8: Hoare triple {2011#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {2011#true} is VALID [2020-07-28 17:56:07,314 INFO L280 TraceCheckUtils]: 9: Hoare triple {2011#true} assume !(0 != main_#t~nondet36);havoc main_#t~nondet36; {2011#true} is VALID [2020-07-28 17:56:07,314 INFO L280 TraceCheckUtils]: 10: Hoare triple {2011#true} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {2011#true} is VALID [2020-07-28 17:56:07,314 INFO L280 TraceCheckUtils]: 11: Hoare triple {2011#true} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {2011#true} is VALID [2020-07-28 17:56:07,315 INFO L280 TraceCheckUtils]: 12: Hoare triple {2011#true} goto; {2011#true} is VALID [2020-07-28 17:56:07,316 INFO L280 TraceCheckUtils]: 13: Hoare triple {2011#true} call inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {2013#(and (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)) |ULTIMATE.start_inspect_before_#t~mem25.base|) (= |ULTIMATE.start_inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} is VALID [2020-07-28 17:56:07,317 INFO L280 TraceCheckUtils]: 14: Hoare triple {2013#(and (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)) |ULTIMATE.start_inspect_before_#t~mem25.base|) (= |ULTIMATE.start_inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} assume !(inspect_before_#t~mem25.base != 0 || inspect_before_#t~mem25.offset != 0);havoc inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset; {2014#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} is VALID [2020-07-28 17:56:07,317 INFO L280 TraceCheckUtils]: 15: Hoare triple {2014#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {2014#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} is VALID [2020-07-28 17:56:07,318 INFO L280 TraceCheckUtils]: 16: Hoare triple {2014#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} goto; {2014#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} is VALID [2020-07-28 17:56:07,319 INFO L280 TraceCheckUtils]: 17: Hoare triple {2014#(and (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))) (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} call inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {2015#(and (= 0 |ULTIMATE.start_inspect_before_#t~mem26.base|) (= 0 |ULTIMATE.start_inspect_before_#t~mem26.offset|))} is VALID [2020-07-28 17:56:07,320 INFO L280 TraceCheckUtils]: 18: Hoare triple {2015#(and (= 0 |ULTIMATE.start_inspect_before_#t~mem26.base|) (= 0 |ULTIMATE.start_inspect_before_#t~mem26.offset|))} assume !(inspect_before_#t~mem26.base == 0 && inspect_before_#t~mem26.offset == 0);havoc inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset; {2012#false} is VALID [2020-07-28 17:56:07,320 INFO L280 TraceCheckUtils]: 19: Hoare triple {2012#false} assume !false; {2012#false} is VALID [2020-07-28 17:56:07,322 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:56:07,322 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1923083885] [2020-07-28 17:56:07,322 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:07,323 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:56:07,323 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298647963] [2020-07-28 17:56:07,323 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-28 17:56:07,323 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:07,324 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:56:07,346 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:07,346 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:56:07,347 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:07,347 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:56:07,347 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:56:07,347 INFO L87 Difference]: Start difference. First operand 96 states and 107 transitions. Second operand 5 states. [2020-07-28 17:56:08,081 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:08,081 INFO L93 Difference]: Finished difference Result 125 states and 139 transitions. [2020-07-28 17:56:08,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:56:08,082 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-28 17:56:08,082 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:08,082 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:56:08,084 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2020-07-28 17:56:08,085 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:56:08,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 132 transitions. [2020-07-28 17:56:08,087 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 132 transitions. [2020-07-28 17:56:08,230 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 132 edges. 132 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:08,234 INFO L225 Difference]: With dead ends: 125 [2020-07-28 17:56:08,234 INFO L226 Difference]: Without dead ends: 123 [2020-07-28 17:56:08,235 INFO L675 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 [2020-07-28 17:56:08,235 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2020-07-28 17:56:08,281 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 94. [2020-07-28 17:56:08,282 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:08,282 INFO L82 GeneralOperation]: Start isEquivalent. First operand 123 states. Second operand 94 states. [2020-07-28 17:56:08,282 INFO L74 IsIncluded]: Start isIncluded. First operand 123 states. Second operand 94 states. [2020-07-28 17:56:08,282 INFO L87 Difference]: Start difference. First operand 123 states. Second operand 94 states. [2020-07-28 17:56:08,292 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:08,292 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2020-07-28 17:56:08,293 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2020-07-28 17:56:08,293 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:08,293 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:08,293 INFO L74 IsIncluded]: Start isIncluded. First operand 94 states. Second operand 123 states. [2020-07-28 17:56:08,294 INFO L87 Difference]: Start difference. First operand 94 states. Second operand 123 states. [2020-07-28 17:56:08,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:08,299 INFO L93 Difference]: Finished difference Result 123 states and 137 transitions. [2020-07-28 17:56:08,300 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 137 transitions. [2020-07-28 17:56:08,300 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:08,300 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:08,304 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:08,304 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:08,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2020-07-28 17:56:08,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 105 transitions. [2020-07-28 17:56:08,310 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 105 transitions. Word has length 20 [2020-07-28 17:56:08,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:08,310 INFO L479 AbstractCegarLoop]: Abstraction has 94 states and 105 transitions. [2020-07-28 17:56:08,310 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:56:08,310 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 105 transitions. [2020-07-28 17:56:08,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2020-07-28 17:56:08,311 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:08,311 INFO L422 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 17:56:08,311 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 17:56:08,311 INFO L427 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:08,312 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:08,312 INFO L82 PathProgramCache]: Analyzing trace with hash 2014113239, now seen corresponding path program 1 times [2020-07-28 17:56:08,312 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:08,313 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1341440668] [2020-07-28 17:56:08,314 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:08,358 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:08,453 INFO L280 TraceCheckUtils]: 0: Hoare triple {2512#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2512#true} is VALID [2020-07-28 17:56:08,453 INFO L280 TraceCheckUtils]: 1: Hoare triple {2512#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {2512#true} is VALID [2020-07-28 17:56:08,453 INFO L280 TraceCheckUtils]: 2: Hoare triple {2512#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {2512#true} is VALID [2020-07-28 17:56:08,454 INFO L280 TraceCheckUtils]: 3: Hoare triple {2512#true} assume !!(0 != main_#t~nondet36);havoc main_#t~nondet36;call main_#t~malloc37.base, main_#t~malloc37.offset := #Ultimate.allocOnHeap(8);main_~node~1.base, main_~node~1.offset := main_#t~malloc37.base, main_#t~malloc37.offset; {2512#true} is VALID [2020-07-28 17:56:08,454 INFO L280 TraceCheckUtils]: 4: Hoare triple {2512#true} assume !(main_~node~1.base == 0 && main_~node~1.offset == 0); {2512#true} is VALID [2020-07-28 17:56:08,454 INFO L280 TraceCheckUtils]: 5: Hoare triple {2512#true} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~node~1.base, main_~node~1.offset, 4);assume -2147483648 <= main_#t~nondet38 && main_#t~nondet38 <= 2147483647;call write~int(main_#t~nondet38, main_~node~1.base, 4 + main_~node~1.offset, 4);havoc main_#t~nondet38;call main_#t~malloc39.base, main_#t~malloc39.offset := #Ultimate.allocOnHeap(8);main_~item~0.base, main_~item~0.offset := main_#t~malloc39.base, main_#t~malloc39.offset; {2512#true} is VALID [2020-07-28 17:56:08,455 INFO L280 TraceCheckUtils]: 6: Hoare triple {2512#true} assume !(main_~item~0.base == 0 && main_~item~0.offset == 0); {2512#true} is VALID [2020-07-28 17:56:08,455 INFO L280 TraceCheckUtils]: 7: Hoare triple {2512#true} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, 4);call write~$Pointer$(main_~data~0.base, main_~data~0.offset, main_~item~0.base, 4 + main_~item~0.offset, 4);main_~data~0.base, main_~data~0.offset := main_~item~0.base, main_~item~0.offset; {2512#true} is VALID [2020-07-28 17:56:08,455 INFO L280 TraceCheckUtils]: 8: Hoare triple {2512#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {2512#true} is VALID [2020-07-28 17:56:08,456 INFO L280 TraceCheckUtils]: 9: Hoare triple {2512#true} assume !(0 != main_#t~nondet36);havoc main_#t~nondet36; {2512#true} is VALID [2020-07-28 17:56:08,456 INFO L280 TraceCheckUtils]: 10: Hoare triple {2512#true} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {2512#true} is VALID [2020-07-28 17:56:08,456 INFO L280 TraceCheckUtils]: 11: Hoare triple {2512#true} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {2512#true} is VALID [2020-07-28 17:56:08,460 INFO L280 TraceCheckUtils]: 12: Hoare triple {2512#true} goto; {2512#true} is VALID [2020-07-28 17:56:08,461 INFO L280 TraceCheckUtils]: 13: Hoare triple {2512#true} call inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {2514#(and (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)) |ULTIMATE.start_inspect_before_#t~mem25.base|) (= |ULTIMATE.start_inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} is VALID [2020-07-28 17:56:08,462 INFO L280 TraceCheckUtils]: 14: Hoare triple {2514#(and (= (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)) |ULTIMATE.start_inspect_before_#t~mem25.base|) (= |ULTIMATE.start_inspect_before_#t~mem25.offset| (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4))))} assume !!(inspect_before_#t~mem25.base != 0 || inspect_before_#t~mem25.offset != 0);havoc inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset; {2515#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))))} is VALID [2020-07-28 17:56:08,463 INFO L280 TraceCheckUtils]: 15: Hoare triple {2515#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))))} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {2515#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))))} is VALID [2020-07-28 17:56:08,463 INFO L280 TraceCheckUtils]: 16: Hoare triple {2515#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))))} goto; {2515#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))))} is VALID [2020-07-28 17:56:08,464 INFO L280 TraceCheckUtils]: 17: Hoare triple {2515#(or (not (= 0 (select (select |#memory_$Pointer$.offset| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))) (not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) (+ ULTIMATE.start_inspect_before_~shape.offset 4)))))} call inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {2516#(or (not (= 0 |ULTIMATE.start_inspect_before_#t~mem21.base|)) (not (= 0 |ULTIMATE.start_inspect_before_#t~mem21.offset|)))} is VALID [2020-07-28 17:56:08,465 INFO L280 TraceCheckUtils]: 18: Hoare triple {2516#(or (not (= 0 |ULTIMATE.start_inspect_before_#t~mem21.base|)) (not (= 0 |ULTIMATE.start_inspect_before_#t~mem21.offset|)))} assume inspect_before_#t~mem21.base == 0 && inspect_before_#t~mem21.offset == 0;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset; {2513#false} is VALID [2020-07-28 17:56:08,465 INFO L280 TraceCheckUtils]: 19: Hoare triple {2513#false} assume !false; {2513#false} is VALID [2020-07-28 17:56:08,467 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2020-07-28 17:56:08,467 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1341440668] [2020-07-28 17:56:08,467 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:08,467 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2020-07-28 17:56:08,468 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125589858] [2020-07-28 17:56:08,468 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-28 17:56:08,468 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:08,469 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 17:56:08,494 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 19 edges. 19 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:08,495 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 17:56:08,495 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:08,495 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 17:56:08,496 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2020-07-28 17:56:08,496 INFO L87 Difference]: Start difference. First operand 94 states and 105 transitions. Second operand 5 states. [2020-07-28 17:56:09,099 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:09,099 INFO L93 Difference]: Finished difference Result 94 states and 105 transitions. [2020-07-28 17:56:09,099 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2020-07-28 17:56:09,099 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 20 [2020-07-28 17:56:09,099 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:09,100 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:56:09,102 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2020-07-28 17:56:09,102 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 17:56:09,106 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 98 transitions. [2020-07-28 17:56:09,106 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states and 98 transitions. [2020-07-28 17:56:09,223 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 98 edges. 98 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:09,225 INFO L225 Difference]: With dead ends: 94 [2020-07-28 17:56:09,225 INFO L226 Difference]: Without dead ends: 92 [2020-07-28 17:56:09,226 INFO L675 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 [2020-07-28 17:56:09,226 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2020-07-28 17:56:09,263 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2020-07-28 17:56:09,263 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:09,263 INFO L82 GeneralOperation]: Start isEquivalent. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:09,263 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:09,264 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:09,267 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:09,267 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2020-07-28 17:56:09,267 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2020-07-28 17:56:09,267 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:09,267 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:09,268 INFO L74 IsIncluded]: Start isIncluded. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:09,268 INFO L87 Difference]: Start difference. First operand 92 states. Second operand 92 states. [2020-07-28 17:56:09,270 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:09,270 INFO L93 Difference]: Finished difference Result 92 states and 103 transitions. [2020-07-28 17:56:09,271 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2020-07-28 17:56:09,271 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:09,271 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:09,271 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:09,271 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:09,271 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 92 states. [2020-07-28 17:56:09,274 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 103 transitions. [2020-07-28 17:56:09,274 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 103 transitions. Word has length 20 [2020-07-28 17:56:09,274 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:09,274 INFO L479 AbstractCegarLoop]: Abstraction has 92 states and 103 transitions. [2020-07-28 17:56:09,274 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 17:56:09,274 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 103 transitions. [2020-07-28 17:56:09,275 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 17:56:09,275 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:09,275 INFO L422 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] [2020-07-28 17:56:09,275 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2020-07-28 17:56:09,275 INFO L427 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:09,276 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:09,276 INFO L82 PathProgramCache]: Analyzing trace with hash -1486605840, now seen corresponding path program 1 times [2020-07-28 17:56:09,276 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:09,276 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1881710219] [2020-07-28 17:56:09,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:09,297 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:09,392 INFO L280 TraceCheckUtils]: 0: Hoare triple {2913#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {2913#true} is VALID [2020-07-28 17:56:09,393 INFO L280 TraceCheckUtils]: 1: Hoare triple {2913#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {2913#true} is VALID [2020-07-28 17:56:09,393 INFO L280 TraceCheckUtils]: 2: Hoare triple {2913#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {2913#true} is VALID [2020-07-28 17:56:09,394 INFO L280 TraceCheckUtils]: 3: Hoare triple {2913#true} assume !!(0 != main_#t~nondet36);havoc main_#t~nondet36;call main_#t~malloc37.base, main_#t~malloc37.offset := #Ultimate.allocOnHeap(8);main_~node~1.base, main_~node~1.offset := main_#t~malloc37.base, main_#t~malloc37.offset; {2915#(= 0 ULTIMATE.start_main_~node~1.offset)} is VALID [2020-07-28 17:56:09,394 INFO L280 TraceCheckUtils]: 4: Hoare triple {2915#(= 0 ULTIMATE.start_main_~node~1.offset)} assume !(main_~node~1.base == 0 && main_~node~1.offset == 0); {2916#(not (= 0 ULTIMATE.start_main_~node~1.base))} is VALID [2020-07-28 17:56:09,395 INFO L280 TraceCheckUtils]: 5: Hoare triple {2916#(not (= 0 ULTIMATE.start_main_~node~1.base))} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~node~1.base, main_~node~1.offset, 4);assume -2147483648 <= main_#t~nondet38 && main_#t~nondet38 <= 2147483647;call write~int(main_#t~nondet38, main_~node~1.base, 4 + main_~node~1.offset, 4);havoc main_#t~nondet38;call main_#t~malloc39.base, main_#t~malloc39.offset := #Ultimate.allocOnHeap(8);main_~item~0.base, main_~item~0.offset := main_#t~malloc39.base, main_#t~malloc39.offset; {2916#(not (= 0 ULTIMATE.start_main_~node~1.base))} is VALID [2020-07-28 17:56:09,395 INFO L280 TraceCheckUtils]: 6: Hoare triple {2916#(not (= 0 ULTIMATE.start_main_~node~1.base))} assume !(main_~item~0.base == 0 && main_~item~0.offset == 0); {2916#(not (= 0 ULTIMATE.start_main_~node~1.base))} is VALID [2020-07-28 17:56:09,397 INFO L280 TraceCheckUtils]: 7: Hoare triple {2916#(not (= 0 ULTIMATE.start_main_~node~1.base))} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, 4);call write~$Pointer$(main_~data~0.base, main_~data~0.offset, main_~item~0.base, 4 + main_~item~0.offset, 4);main_~data~0.base, main_~data~0.offset := main_~item~0.base, main_~item~0.offset; {2917#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} is VALID [2020-07-28 17:56:09,398 INFO L280 TraceCheckUtils]: 8: Hoare triple {2917#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {2917#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} is VALID [2020-07-28 17:56:09,398 INFO L280 TraceCheckUtils]: 9: Hoare triple {2917#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} assume !(0 != main_#t~nondet36);havoc main_#t~nondet36; {2917#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} is VALID [2020-07-28 17:56:09,399 INFO L280 TraceCheckUtils]: 10: Hoare triple {2917#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,400 INFO L280 TraceCheckUtils]: 11: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,400 INFO L280 TraceCheckUtils]: 12: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} goto; {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,401 INFO L280 TraceCheckUtils]: 13: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} call inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,401 INFO L280 TraceCheckUtils]: 14: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !(inspect_before_#t~mem25.base != 0 || inspect_before_#t~mem25.offset != 0);havoc inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset; {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,402 INFO L280 TraceCheckUtils]: 15: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,402 INFO L280 TraceCheckUtils]: 16: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} goto; {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,403 INFO L280 TraceCheckUtils]: 17: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} call inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,403 INFO L280 TraceCheckUtils]: 18: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !!(inspect_before_#t~mem26.base == 0 && inspect_before_#t~mem26.offset == 0);havoc inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset; {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,404 INFO L280 TraceCheckUtils]: 19: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} goto; {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:09,405 INFO L280 TraceCheckUtils]: 20: Hoare triple {2918#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} call inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset := read~$Pointer$(inspect_before_~shape.base, inspect_before_~shape.offset, 4); {2919#(not (= 0 |ULTIMATE.start_inspect_before_#t~mem27.base|))} is VALID [2020-07-28 17:56:09,406 INFO L280 TraceCheckUtils]: 21: Hoare triple {2919#(not (= 0 |ULTIMATE.start_inspect_before_#t~mem27.base|))} assume inspect_before_#t~mem27.base == 0 && inspect_before_#t~mem27.offset == 0;havoc inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset; {2914#false} is VALID [2020-07-28 17:56:09,406 INFO L280 TraceCheckUtils]: 22: Hoare triple {2914#false} assume !false; {2914#false} is VALID [2020-07-28 17:56:09,408 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:56:09,408 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1881710219] [2020-07-28 17:56:09,408 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:09,408 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 17:56:09,409 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784410312] [2020-07-28 17:56:09,409 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-28 17:56:09,409 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:09,410 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 17:56:09,435 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:09,436 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 17:56:09,436 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:09,436 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 17:56:09,436 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:56:09,436 INFO L87 Difference]: Start difference. First operand 92 states and 103 transitions. Second operand 7 states. [2020-07-28 17:56:10,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:10,482 INFO L93 Difference]: Finished difference Result 210 states and 230 transitions. [2020-07-28 17:56:10,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 17:56:10,483 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-28 17:56:10,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:10,483 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:56:10,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2020-07-28 17:56:10,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:56:10,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 230 transitions. [2020-07-28 17:56:10,493 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 230 transitions. [2020-07-28 17:56:10,809 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 230 edges. 230 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:10,814 INFO L225 Difference]: With dead ends: 210 [2020-07-28 17:56:10,814 INFO L226 Difference]: Without dead ends: 208 [2020-07-28 17:56:10,814 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:56:10,815 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 208 states. [2020-07-28 17:56:10,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 208 to 98. [2020-07-28 17:56:10,864 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:10,864 INFO L82 GeneralOperation]: Start isEquivalent. First operand 208 states. Second operand 98 states. [2020-07-28 17:56:10,864 INFO L74 IsIncluded]: Start isIncluded. First operand 208 states. Second operand 98 states. [2020-07-28 17:56:10,864 INFO L87 Difference]: Start difference. First operand 208 states. Second operand 98 states. [2020-07-28 17:56:10,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:10,871 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2020-07-28 17:56:10,871 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 228 transitions. [2020-07-28 17:56:10,872 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:10,872 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:10,872 INFO L74 IsIncluded]: Start isIncluded. First operand 98 states. Second operand 208 states. [2020-07-28 17:56:10,872 INFO L87 Difference]: Start difference. First operand 98 states. Second operand 208 states. [2020-07-28 17:56:10,879 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:10,879 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2020-07-28 17:56:10,879 INFO L276 IsEmpty]: Start isEmpty. Operand 208 states and 228 transitions. [2020-07-28 17:56:10,880 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:10,880 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:10,880 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:10,880 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:10,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 98 states. [2020-07-28 17:56:10,883 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 109 transitions. [2020-07-28 17:56:10,883 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 109 transitions. Word has length 23 [2020-07-28 17:56:10,883 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:10,883 INFO L479 AbstractCegarLoop]: Abstraction has 98 states and 109 transitions. [2020-07-28 17:56:10,884 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 17:56:10,884 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 109 transitions. [2020-07-28 17:56:10,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 17:56:10,884 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:10,884 INFO L422 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] [2020-07-28 17:56:10,884 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2020-07-28 17:56:10,885 INFO L427 AbstractCegarLoop]: === Iteration 7 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:10,885 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:10,885 INFO L82 PathProgramCache]: Analyzing trace with hash 1760261746, now seen corresponding path program 1 times [2020-07-28 17:56:10,885 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:10,886 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [262200027] [2020-07-28 17:56:10,886 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:10,902 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 17:56:10,976 INFO L280 TraceCheckUtils]: 0: Hoare triple {3694#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {3694#true} is VALID [2020-07-28 17:56:10,976 INFO L280 TraceCheckUtils]: 1: Hoare triple {3694#true} havoc main_#res;havoc main_#t~malloc37.base, main_#t~malloc37.offset, main_#t~nondet38, main_#t~malloc39.base, main_#t~malloc39.offset, main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, main_#t~nondet36, main_#t~ret40.base, main_#t~ret40.offset, main_#t~mem41.base, main_#t~mem41.offset, main_#t~mem42.base, main_#t~mem42.offset, main_#t~mem43.base, main_#t~mem43.offset, main_~snext~0.base, main_~snext~0.offset, main_~data~0.base, main_~data~0.offset, main_~node~2.base, main_~node~2.offset;main_~data~0.base, main_~data~0.offset := 0, 0; {3694#true} is VALID [2020-07-28 17:56:10,977 INFO L280 TraceCheckUtils]: 2: Hoare triple {3694#true} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {3694#true} is VALID [2020-07-28 17:56:10,977 INFO L280 TraceCheckUtils]: 3: Hoare triple {3694#true} assume !!(0 != main_#t~nondet36);havoc main_#t~nondet36;call main_#t~malloc37.base, main_#t~malloc37.offset := #Ultimate.allocOnHeap(8);main_~node~1.base, main_~node~1.offset := main_#t~malloc37.base, main_#t~malloc37.offset; {3696#(= 0 ULTIMATE.start_main_~node~1.offset)} is VALID [2020-07-28 17:56:10,978 INFO L280 TraceCheckUtils]: 4: Hoare triple {3696#(= 0 ULTIMATE.start_main_~node~1.offset)} assume !(main_~node~1.base == 0 && main_~node~1.offset == 0); {3697#(not (= 0 ULTIMATE.start_main_~node~1.base))} is VALID [2020-07-28 17:56:10,979 INFO L280 TraceCheckUtils]: 5: Hoare triple {3697#(not (= 0 ULTIMATE.start_main_~node~1.base))} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~node~1.base, main_~node~1.offset, 4);assume -2147483648 <= main_#t~nondet38 && main_#t~nondet38 <= 2147483647;call write~int(main_#t~nondet38, main_~node~1.base, 4 + main_~node~1.offset, 4);havoc main_#t~nondet38;call main_#t~malloc39.base, main_#t~malloc39.offset := #Ultimate.allocOnHeap(8);main_~item~0.base, main_~item~0.offset := main_#t~malloc39.base, main_#t~malloc39.offset; {3697#(not (= 0 ULTIMATE.start_main_~node~1.base))} is VALID [2020-07-28 17:56:10,979 INFO L280 TraceCheckUtils]: 6: Hoare triple {3697#(not (= 0 ULTIMATE.start_main_~node~1.base))} assume !(main_~item~0.base == 0 && main_~item~0.offset == 0); {3697#(not (= 0 ULTIMATE.start_main_~node~1.base))} is VALID [2020-07-28 17:56:10,980 INFO L280 TraceCheckUtils]: 7: Hoare triple {3697#(not (= 0 ULTIMATE.start_main_~node~1.base))} call write~$Pointer$(main_~node~1.base, main_~node~1.offset, main_~item~0.base, main_~item~0.offset, 4);call write~$Pointer$(main_~data~0.base, main_~data~0.offset, main_~item~0.base, 4 + main_~item~0.offset, 4);main_~data~0.base, main_~data~0.offset := main_~item~0.base, main_~item~0.offset; {3698#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} is VALID [2020-07-28 17:56:10,981 INFO L280 TraceCheckUtils]: 8: Hoare triple {3698#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} assume -2147483648 <= main_#t~nondet36 && main_#t~nondet36 <= 2147483647; {3698#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} is VALID [2020-07-28 17:56:10,982 INFO L280 TraceCheckUtils]: 9: Hoare triple {3698#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} assume !(0 != main_#t~nondet36);havoc main_#t~nondet36; {3698#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} is VALID [2020-07-28 17:56:10,982 INFO L280 TraceCheckUtils]: 10: Hoare triple {3698#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_main_~data~0.base) ULTIMATE.start_main_~data~0.offset)))} assume !(main_~data~0.base == 0 && main_~data~0.offset == 0);inspect_before_#in~shape.base, inspect_before_#in~shape.offset := main_~data~0.base, main_~data~0.offset;havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset, inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset, inspect_before_#t~mem23.base, inspect_before_#t~mem23.offset, inspect_before_#t~mem24.base, inspect_before_#t~mem24.offset, inspect_before_#t~mem20.base, inspect_before_#t~mem20.offset, inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset, inspect_before_#t~mem26.base, inspect_before_#t~mem26.offset, inspect_before_#t~mem27.base, inspect_before_#t~mem27.offset, inspect_before_#t~mem28.base, inspect_before_#t~mem28.offset, inspect_before_#t~mem29.base, inspect_before_#t~mem29.offset, inspect_before_~shape.base, inspect_before_~shape.offset;inspect_before_~shape.base, inspect_before_~shape.offset := inspect_before_#in~shape.base, inspect_before_#in~shape.offset; {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,983 INFO L280 TraceCheckUtils]: 11: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,983 INFO L280 TraceCheckUtils]: 12: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} goto; {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,984 INFO L280 TraceCheckUtils]: 13: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} call inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,984 INFO L280 TraceCheckUtils]: 14: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !!(inspect_before_#t~mem25.base != 0 || inspect_before_#t~mem25.offset != 0);havoc inspect_before_#t~mem25.base, inspect_before_#t~mem25.offset; {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,985 INFO L280 TraceCheckUtils]: 15: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !(inspect_before_~shape.base == 0 && inspect_before_~shape.offset == 0); {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,986 INFO L280 TraceCheckUtils]: 16: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} goto; {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,986 INFO L280 TraceCheckUtils]: 17: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} call inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset := read~$Pointer$(inspect_before_~shape.base, 4 + inspect_before_~shape.offset, 4); {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,991 INFO L280 TraceCheckUtils]: 18: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} assume !(inspect_before_#t~mem21.base == 0 && inspect_before_#t~mem21.offset == 0);havoc inspect_before_#t~mem21.base, inspect_before_#t~mem21.offset; {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,991 INFO L280 TraceCheckUtils]: 19: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} goto; {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} is VALID [2020-07-28 17:56:10,992 INFO L280 TraceCheckUtils]: 20: Hoare triple {3699#(not (= 0 (select (select |#memory_$Pointer$.base| ULTIMATE.start_inspect_before_~shape.base) ULTIMATE.start_inspect_before_~shape.offset)))} call inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset := read~$Pointer$(inspect_before_~shape.base, inspect_before_~shape.offset, 4); {3700#(not (= 0 |ULTIMATE.start_inspect_before_#t~mem22.base|))} is VALID [2020-07-28 17:56:10,993 INFO L280 TraceCheckUtils]: 21: Hoare triple {3700#(not (= 0 |ULTIMATE.start_inspect_before_#t~mem22.base|))} assume inspect_before_#t~mem22.base == 0 && inspect_before_#t~mem22.offset == 0;havoc inspect_before_#t~mem22.base, inspect_before_#t~mem22.offset; {3695#false} is VALID [2020-07-28 17:56:10,993 INFO L280 TraceCheckUtils]: 22: Hoare triple {3695#false} assume !false; {3695#false} is VALID [2020-07-28 17:56:10,994 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 17:56:10,994 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [262200027] [2020-07-28 17:56:10,995 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 17:56:10,995 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2020-07-28 17:56:10,995 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531372643] [2020-07-28 17:56:10,995 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-28 17:56:10,996 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 17:56:10,996 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states. [2020-07-28 17:56:11,020 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 23 edges. 23 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:11,020 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2020-07-28 17:56:11,020 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 17:56:11,021 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2020-07-28 17:56:11,021 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2020-07-28 17:56:11,021 INFO L87 Difference]: Start difference. First operand 98 states and 109 transitions. Second operand 7 states. [2020-07-28 17:56:12,176 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:12,176 INFO L93 Difference]: Finished difference Result 208 states and 228 transitions. [2020-07-28 17:56:12,176 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2020-07-28 17:56:12,176 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2020-07-28 17:56:12,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 17:56:12,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:56:12,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2020-07-28 17:56:12,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2020-07-28 17:56:12,183 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 228 transitions. [2020-07-28 17:56:12,183 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 7 states and 228 transitions. [2020-07-28 17:56:12,502 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 228 edges. 228 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 17:56:12,507 INFO L225 Difference]: With dead ends: 208 [2020-07-28 17:56:12,508 INFO L226 Difference]: Without dead ends: 206 [2020-07-28 17:56:12,508 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=47, Invalid=85, Unknown=0, NotChecked=0, Total=132 [2020-07-28 17:56:12,509 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 206 states. [2020-07-28 17:56:12,551 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 206 to 104. [2020-07-28 17:56:12,551 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 17:56:12,552 INFO L82 GeneralOperation]: Start isEquivalent. First operand 206 states. Second operand 104 states. [2020-07-28 17:56:12,552 INFO L74 IsIncluded]: Start isIncluded. First operand 206 states. Second operand 104 states. [2020-07-28 17:56:12,552 INFO L87 Difference]: Start difference. First operand 206 states. Second operand 104 states. [2020-07-28 17:56:12,559 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:12,559 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-28 17:56:12,559 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2020-07-28 17:56:12,560 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:12,560 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:12,560 INFO L74 IsIncluded]: Start isIncluded. First operand 104 states. Second operand 206 states. [2020-07-28 17:56:12,560 INFO L87 Difference]: Start difference. First operand 104 states. Second operand 206 states. [2020-07-28 17:56:12,566 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 17:56:12,567 INFO L93 Difference]: Finished difference Result 206 states and 226 transitions. [2020-07-28 17:56:12,567 INFO L276 IsEmpty]: Start isEmpty. Operand 206 states and 226 transitions. [2020-07-28 17:56:12,567 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 17:56:12,567 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 17:56:12,568 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 17:56:12,568 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 17:56:12,568 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2020-07-28 17:56:12,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 115 transitions. [2020-07-28 17:56:12,571 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 115 transitions. Word has length 23 [2020-07-28 17:56:12,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 17:56:12,571 INFO L479 AbstractCegarLoop]: Abstraction has 104 states and 115 transitions. [2020-07-28 17:56:12,571 INFO L480 AbstractCegarLoop]: Interpolant automaton has 7 states. [2020-07-28 17:56:12,571 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 115 transitions. [2020-07-28 17:56:12,572 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2020-07-28 17:56:12,572 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 17:56:12,572 INFO L422 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] [2020-07-28 17:56:12,572 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2020-07-28 17:56:12,572 INFO L427 AbstractCegarLoop]: === Iteration 8 === [ULTIMATE.startErr1ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr8ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr7ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr3ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr2ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr12ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr4ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr5ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr6ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr10ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr11ASSERT_VIOLATIONERROR_FUNCTION, ULTIMATE.startErr9ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 17:56:12,573 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 17:56:12,573 INFO L82 PathProgramCache]: Analyzing trace with hash -2060804288, now seen corresponding path program 1 times [2020-07-28 17:56:12,573 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 17:56:12,573 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1324983177] [2020-07-28 17:56:12,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 17:56:12,613 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:56:12,613 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:56:12,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2020-07-28 17:56:12,651 INFO L221 TraceCheck]: Trace is feasible, we will do another trace check, this time with branch encoders. [2020-07-28 17:56:12,679 INFO L174 FreeRefinementEngine]: Strategy CAMEL found a feasible trace [2020-07-28 17:56:12,679 INFO L520 BasicCegarLoop]: Counterexample might be feasible [2020-07-28 17:56:12,679 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2020-07-28 17:56:12,721 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 17:56:12,721 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 17:56:12,721 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2020-07-28 17:56:12,721 WARN L170 areAnnotationChecker]: L628-3 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L628-4 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L628-1 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L654 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L604-2 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-28 17:56:12,722 WARN L170 areAnnotationChecker]: L630 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L605-3 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L554 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L604-1 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L630-2 has no Hoare annotation [2020-07-28 17:56:12,723 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L605 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L611-1 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L635 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L606-2 has no Hoare annotation [2020-07-28 17:56:12,724 WARN L170 areAnnotationChecker]: L612-2 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L612-2 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L554-5 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L611 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L635-2 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L607-2 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L607-2 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2020-07-28 17:56:12,725 WARN L170 areAnnotationChecker]: L554-1 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L606-1 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L612 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L613-2 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L613-2 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L607 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L608-2 has no Hoare annotation [2020-07-28 17:56:12,726 WARN L170 areAnnotationChecker]: L608-2 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L554-6 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L612-1 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L613 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L614-2 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L614-2 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L554-2 has no Hoare annotation [2020-07-28 17:56:12,727 WARN L170 areAnnotationChecker]: L554-2 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L607-1 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L608 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L609-2 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L609-2 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L554-7 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L554-7 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-28 17:56:12,728 WARN L170 areAnnotationChecker]: L613-1 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L614 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L644-2 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L554-3 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L608-1 has no Hoare annotation [2020-07-28 17:56:12,729 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L609 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L605-2 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L554-8 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L554-8 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L614-1 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L644-3 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L644 has no Hoare annotation [2020-07-28 17:56:12,730 WARN L170 areAnnotationChecker]: L554-4 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L554-4 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L609-1 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L618-2 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L587-2 has no Hoare annotation [2020-07-28 17:56:12,731 WARN L170 areAnnotationChecker]: L619-2 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L619-2 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L554-9 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L554-9 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L618-1 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L587-3 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L589 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-28 17:56:12,732 WARN L170 areAnnotationChecker]: L619 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L620-2 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L620-2 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L600 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L564-1 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L564-1 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L554-10 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L554-10 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L619-1 has no Hoare annotation [2020-07-28 17:56:12,733 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L620 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L620-3 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L577-5 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L577-1 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L554-11 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L554-11 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L620-1 has no Hoare annotation [2020-07-28 17:56:12,734 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L573 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L577-3 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L622-1 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L623-2 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L623-2 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-28 17:56:12,735 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L622-3 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L623 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L616 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L578-5 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L578-2 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L554-12 has no Hoare annotation [2020-07-28 17:56:12,736 WARN L170 areAnnotationChecker]: L554-12 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L623-1 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L649-2 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L578-4 has no Hoare annotation [2020-07-28 17:56:12,737 WARN L170 areAnnotationChecker]: L649-3 has no Hoare annotation [2020-07-28 17:56:12,737 INFO L163 areAnnotationChecker]: CFG has 0 edges. 0 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 17:56:12,740 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 05:56:12 BoogieIcfgContainer [2020-07-28 17:56:12,740 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 17:56:12,740 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 17:56:12,740 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 17:56:12,740 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 17:56:12,741 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 05:56:04" (3/4) ... [2020-07-28 17:56:12,743 INFO L131 WitnessPrinter]: Generating witness for reachability counterexample [2020-07-28 17:56:12,804 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 17:56:12,804 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 17:56:12,807 INFO L168 Benchmark]: Toolchain (without parser) took 10457.78 ms. Allocated memory was 1.0 GB in the beginning and 1.4 GB in the end (delta: 324.5 MB). Free memory was 950.8 MB in the beginning and 1.2 GB in the end (delta: -245.8 MB). Peak memory consumption was 78.7 MB. Max. memory is 11.5 GB. [2020-07-28 17:56:12,807 INFO L168 Benchmark]: CDTParser took 0.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:56:12,808 INFO L168 Benchmark]: CACSL2BoogieTranslator took 711.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. [2020-07-28 17:56:12,808 INFO L168 Benchmark]: Boogie Procedure Inliner took 79.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:56:12,809 INFO L168 Benchmark]: Boogie Preprocessor took 95.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:56:12,810 INFO L168 Benchmark]: RCFGBuilder took 943.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. [2020-07-28 17:56:12,810 INFO L168 Benchmark]: TraceAbstraction took 8554.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -177.8 MB). There was no memory consumed. Max. memory is 11.5 GB. [2020-07-28 17:56:12,811 INFO L168 Benchmark]: Witness Printer took 64.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. [2020-07-28 17:56:12,814 INFO L336 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.33 ms. Allocated memory is still 1.0 GB. Free memory is still 987.1 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 711.25 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 147.8 MB). Free memory was 950.8 MB in the beginning and 1.1 GB in the end (delta: -166.9 MB). Peak memory consumption was 26.2 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 79.10 ms. Allocated memory is still 1.2 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 95.42 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * RCFGBuilder took 943.56 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 1.0 GB in the end (delta: 76.6 MB). Peak memory consumption was 76.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 8554.64 ms. Allocated memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: 176.7 MB). Free memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: -177.8 MB). There was no memory consumed. Max. memory is 11.5 GB. * Witness Printer took 64.01 ms. Allocated memory is still 1.4 GB. Free memory was 1.2 GB in the beginning and 1.2 GB in the end (delta: 9.1 MB). Peak memory consumption was 9.1 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 554]: a call of __VERIFIER_error() is reachable a call of __VERIFIER_error() is reachable We found a FailurePath: [L627] struct list *data = ((void *)0); [L628] COND TRUE __VERIFIER_nondet_int() [L629] struct node *node = malloc(sizeof *node); [L630] COND FALSE !(!node) [L632] node->next = node [L633] node->value = __VERIFIER_nondet_int() [L634] struct list *item = malloc(sizeof *item); [L635] COND FALSE !(!item) [L637] item->slist = node [L638] item->next = data [L639] data = item [L628] COND FALSE !(__VERIFIER_nondet_int()) [L641] COND FALSE !(!data) [L604] COND FALSE !(!(shape)) [L605] shape->next [L605] COND FALSE !(shape->next) [L611] COND FALSE !(!(shape)) [L612] EXPR shape->next [L612] COND FALSE !(!(shape->next == ((void *)0))) [L613] EXPR shape->slist [L613] COND FALSE !(!(shape->slist)) [L614] EXPR shape->slist [L614] EXPR shape->slist->next [L614] COND TRUE !(shape->slist->next == ((void *)0)) [L554] __VERIFIER_error() - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 99 locations, 13 error locations. Started 1 CEGAR loops. VerificationResult: UNSAFE, OverallTime: 8.4s, OverallIterations: 8, TraceHistogramMax: 2, AutomataDifference: 6.7s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 606 SDtfs, 1778 SDslu, 983 SDs, 0 SdLazy, 504 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.8s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 52 GetRequests, 17 SyntacticMatches, 0 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.4s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=104occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.4s AutomataMinimizationTime, 7 MinimizatonAttempts, 396 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 138 NumberOfCodeBlocks, 138 NumberOfCodeBlocksAsserted, 8 NumberOfCheckSat, 105 ConstructedInterpolants, 0 QuantifiedInterpolants, 9955 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 7 InterpolantComputations, 7 PerfectInterpolantSequences, 10/10 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, ACCELERATED_INTERPOLATION: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...