./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.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/list-simple/dll2n_update_all_reverse.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 cfdde8b1798318c3bb26b76a748741913b280952 ....................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.25-8bd4bc6 [2020-07-28 18:06:02,089 INFO L177 SettingsManager]: Resetting all preferences to default values... [2020-07-28 18:06:02,091 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2020-07-28 18:06:02,104 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2020-07-28 18:06:02,105 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2020-07-28 18:06:02,106 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2020-07-28 18:06:02,107 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2020-07-28 18:06:02,110 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2020-07-28 18:06:02,112 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2020-07-28 18:06:02,113 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2020-07-28 18:06:02,114 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2020-07-28 18:06:02,115 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2020-07-28 18:06:02,116 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2020-07-28 18:06:02,117 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2020-07-28 18:06:02,118 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2020-07-28 18:06:02,120 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2020-07-28 18:06:02,121 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2020-07-28 18:06:02,122 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2020-07-28 18:06:02,124 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2020-07-28 18:06:02,126 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2020-07-28 18:06:02,128 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2020-07-28 18:06:02,129 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2020-07-28 18:06:02,130 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2020-07-28 18:06:02,131 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2020-07-28 18:06:02,134 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2020-07-28 18:06:02,137 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2020-07-28 18:06:02,138 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2020-07-28 18:06:02,139 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2020-07-28 18:06:02,140 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2020-07-28 18:06:02,141 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2020-07-28 18:06:02,141 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2020-07-28 18:06:02,142 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2020-07-28 18:06:02,144 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2020-07-28 18:06:02,146 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2020-07-28 18:06:02,149 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2020-07-28 18:06:02,151 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2020-07-28 18:06:02,152 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2020-07-28 18:06:02,152 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2020-07-28 18:06:02,153 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2020-07-28 18:06:02,154 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2020-07-28 18:06:02,156 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2020-07-28 18:06:02,157 INFO L101 SettingsManager]: Beginning loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2020-07-28 18:06:02,182 INFO L113 SettingsManager]: Loading preferences was successful [2020-07-28 18:06:02,182 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2020-07-28 18:06:02,183 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2020-07-28 18:06:02,184 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2020-07-28 18:06:02,184 INFO L138 SettingsManager]: * Use SBE=true [2020-07-28 18:06:02,185 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2020-07-28 18:06:02,185 INFO L138 SettingsManager]: * sizeof long=4 [2020-07-28 18:06:02,185 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2020-07-28 18:06:02,185 INFO L138 SettingsManager]: * sizeof POINTER=4 [2020-07-28 18:06:02,186 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2020-07-28 18:06:02,186 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2020-07-28 18:06:02,186 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2020-07-28 18:06:02,187 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2020-07-28 18:06:02,187 INFO L138 SettingsManager]: * sizeof long double=12 [2020-07-28 18:06:02,187 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2020-07-28 18:06:02,187 INFO L138 SettingsManager]: * Use constant arrays=true [2020-07-28 18:06:02,188 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2020-07-28 18:06:02,188 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2020-07-28 18:06:02,188 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2020-07-28 18:06:02,189 INFO L138 SettingsManager]: * To the following directory=./dump/ [2020-07-28 18:06:02,189 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2020-07-28 18:06:02,189 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2020-07-28 18:06:02,189 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2020-07-28 18:06:02,190 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2020-07-28 18:06:02,190 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2020-07-28 18:06:02,190 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2020-07-28 18:06:02,191 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2020-07-28 18:06:02,191 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2020-07-28 18:06:02,191 INFO L138 SettingsManager]: * Trace refinement exception blacklist=NONE [2020-07-28 18:06:02,191 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 -> cfdde8b1798318c3bb26b76a748741913b280952 [2020-07-28 18:06:02,523 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2020-07-28 18:06:02,540 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2020-07-28 18:06:02,544 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2020-07-28 18:06:02,546 INFO L271 PluginConnector]: Initializing CDTParser... [2020-07-28 18:06:02,546 INFO L275 PluginConnector]: CDTParser initialized [2020-07-28 18:06:02,547 INFO L429 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2020-07-28 18:06:02,604 INFO L220 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c872404a7/2d0722f3d7224aadb8bb0a37aff1b71a/FLAG326c419d4 [2020-07-28 18:06:03,072 INFO L306 CDTParser]: Found 1 translation units. [2020-07-28 18:06:03,073 INFO L160 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_update_all_reverse.i [2020-07-28 18:06:03,094 INFO L349 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c872404a7/2d0722f3d7224aadb8bb0a37aff1b71a/FLAG326c419d4 [2020-07-28 18:06:03,418 INFO L357 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/c872404a7/2d0722f3d7224aadb8bb0a37aff1b71a [2020-07-28 18:06:03,422 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2020-07-28 18:06:03,425 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2020-07-28 18:06:03,427 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2020-07-28 18:06:03,427 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2020-07-28 18:06:03,431 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2020-07-28 18:06:03,433 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:06:03" (1/1) ... [2020-07-28 18:06:03,436 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@437dda0e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:03, skipping insertion in model container [2020-07-28 18:06:03,436 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 28.07 06:06:03" (1/1) ... [2020-07-28 18:06:03,443 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2020-07-28 18:06:03,493 INFO L178 MainTranslator]: Built tables and reachable declarations [2020-07-28 18:06:03,895 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:06:03,910 INFO L203 MainTranslator]: Completed pre-run [2020-07-28 18:06:03,965 INFO L206 PostProcessor]: Analyzing one entry point: main [2020-07-28 18:06:04,025 INFO L208 MainTranslator]: Completed translation [2020-07-28 18:06:04,026 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04 WrapperNode [2020-07-28 18:06:04,026 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2020-07-28 18:06:04,028 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2020-07-28 18:06:04,028 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2020-07-28 18:06:04,028 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2020-07-28 18:06:04,038 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,055 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,089 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2020-07-28 18:06:04,090 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2020-07-28 18:06:04,090 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2020-07-28 18:06:04,090 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2020-07-28 18:06:04,098 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,098 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,104 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,104 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,114 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,121 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,124 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (1/1) ... [2020-07-28 18:06:04,127 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2020-07-28 18:06:04,128 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2020-07-28 18:06:04,128 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2020-07-28 18:06:04,128 INFO L275 PluginConnector]: RCFGBuilder initialized [2020-07-28 18:06:04,130 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (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 18:06:04,203 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2020-07-28 18:06:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2020-07-28 18:06:04,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2020-07-28 18:06:04,205 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2020-07-28 18:06:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2020-07-28 18:06:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2020-07-28 18:06:04,206 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2020-07-28 18:06:04,206 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2020-07-28 18:06:04,893 INFO L290 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2020-07-28 18:06:04,893 INFO L295 CfgBuilder]: Removed 20 assume(true) statements. [2020-07-28 18:06:04,897 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:06:04 BoogieIcfgContainer [2020-07-28 18:06:04,898 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2020-07-28 18:06:04,899 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2020-07-28 18:06:04,900 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2020-07-28 18:06:04,904 INFO L275 PluginConnector]: TraceAbstraction initialized [2020-07-28 18:06:04,905 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 28.07 06:06:03" (1/3) ... [2020-07-28 18:06:04,906 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb9e12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:06:04, skipping insertion in model container [2020-07-28 18:06:04,906 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 28.07 06:06:04" (2/3) ... [2020-07-28 18:06:04,907 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@6eb9e12b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 28.07 06:06:04, skipping insertion in model container [2020-07-28 18:06:04,907 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:06:04" (3/3) ... [2020-07-28 18:06:04,909 INFO L109 eAbstractionObserver]: Analyzing ICFG dll2n_update_all_reverse.i [2020-07-28 18:06:04,921 INFO L157 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2020-07-28 18:06:04,931 INFO L169 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2020-07-28 18:06:04,947 INFO L251 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2020-07-28 18:06:04,975 INFO L375 AbstractCegarLoop]: Interprodecural is true [2020-07-28 18:06:04,975 INFO L376 AbstractCegarLoop]: Hoare is true [2020-07-28 18:06:04,976 INFO L377 AbstractCegarLoop]: Compute interpolants for FPandBP [2020-07-28 18:06:04,976 INFO L378 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2020-07-28 18:06:04,976 INFO L379 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2020-07-28 18:06:04,977 INFO L380 AbstractCegarLoop]: Difference is false [2020-07-28 18:06:04,977 INFO L381 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2020-07-28 18:06:04,977 INFO L385 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2020-07-28 18:06:04,995 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states. [2020-07-28 18:06:05,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2020-07-28 18:06:05,003 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:06:05,004 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:06:05,005 INFO L427 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:06:05,011 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:06:05,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1608020802, now seen corresponding path program 1 times [2020-07-28 18:06:05,024 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:06:05,024 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [433064463] [2020-07-28 18:06:05,025 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:06:05,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:06:05,238 INFO L280 TraceCheckUtils]: 0: Hoare triple {32#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {32#true} is VALID [2020-07-28 18:06:05,241 INFO L280 TraceCheckUtils]: 1: Hoare triple {32#true} havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~post12, main_~new_data~0, main_#t~ret14, main_#t~post13, main_~expected~0, main_~len~0, main_~data~0, main_~s~0.base, main_~s~0.offset, main_~i~0;main_~len~0 := 2;main_~data~0 := 1;dll_create_#in~len, dll_create_#in~data := main_~len~0, main_~data~0;havoc dll_create_#res.base, dll_create_#res.offset;havoc dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset, dll_create_#t~post4, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~len, dll_create_~data, dll_create_~head~0.base, dll_create_~head~0.offset;dll_create_~len := dll_create_#in~len;dll_create_~data := dll_create_#in~data;dll_create_~head~0.base, dll_create_~head~0.offset := 0, 0; {34#(= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:05,242 INFO L280 TraceCheckUtils]: 2: Hoare triple {34#(= 2 ULTIMATE.start_dll_create_~len)} assume !(dll_create_~len > 0); {33#false} is VALID [2020-07-28 18:06:05,243 INFO L280 TraceCheckUtils]: 3: Hoare triple {33#false} dll_create_#res.base, dll_create_#res.offset := dll_create_~head~0.base, dll_create_~head~0.offset; {33#false} is VALID [2020-07-28 18:06:05,243 INFO L280 TraceCheckUtils]: 4: Hoare triple {33#false} main_#t~ret11.base, main_#t~ret11.offset := dll_create_#res.base, dll_create_#res.offset;main_~s~0.base, main_~s~0.offset := main_#t~ret11.base, main_#t~ret11.offset;havoc main_#t~ret11.base, main_#t~ret11.offset;havoc main_~i~0;main_~i~0 := main_~len~0 - 1; {33#false} is VALID [2020-07-28 18:06:05,244 INFO L280 TraceCheckUtils]: 5: Hoare triple {33#false} assume !(main_~i~0 >= 0); {33#false} is VALID [2020-07-28 18:06:05,244 INFO L280 TraceCheckUtils]: 6: Hoare triple {33#false} main_~i~0 := main_~len~0 - 1; {33#false} is VALID [2020-07-28 18:06:05,245 INFO L280 TraceCheckUtils]: 7: Hoare triple {33#false} assume !!(main_~i~0 <= 0);main_~expected~0 := main_~i~0 + main_~len~0;dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset, dll_get_data_at_#in~index := main_~s~0.base, main_~s~0.offset, main_~i~0;havoc dll_get_data_at_#res;havoc dll_get_data_at_#t~mem6.base, dll_get_data_at_#t~mem6.offset, dll_get_data_at_#t~post7, dll_get_data_at_#t~mem8, dll_get_data_at_~head.base, dll_get_data_at_~head.offset, dll_get_data_at_~index;dll_get_data_at_~head.base, dll_get_data_at_~head.offset := dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset;dll_get_data_at_~index := dll_get_data_at_#in~index; {33#false} is VALID [2020-07-28 18:06:05,245 INFO L280 TraceCheckUtils]: 8: Hoare triple {33#false} assume !(dll_get_data_at_~index > 0); {33#false} is VALID [2020-07-28 18:06:05,246 INFO L280 TraceCheckUtils]: 9: Hoare triple {33#false} call dll_get_data_at_#t~mem8 := read~int(dll_get_data_at_~head.base, dll_get_data_at_~head.offset, 4);dll_get_data_at_#res := dll_get_data_at_#t~mem8;havoc dll_get_data_at_#t~mem8; {33#false} is VALID [2020-07-28 18:06:05,246 INFO L280 TraceCheckUtils]: 10: Hoare triple {33#false} main_#t~ret14 := dll_get_data_at_#res;assume -2147483648 <= main_#t~ret14 && main_#t~ret14 <= 2147483647; {33#false} is VALID [2020-07-28 18:06:05,246 INFO L280 TraceCheckUtils]: 11: Hoare triple {33#false} assume main_~expected~0 != main_#t~ret14;havoc main_#t~ret14; {33#false} is VALID [2020-07-28 18:06:05,247 INFO L280 TraceCheckUtils]: 12: Hoare triple {33#false} assume !false; {33#false} is VALID [2020-07-28 18:06:05,250 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 18:06:05,251 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [433064463] [2020-07-28 18:06:05,252 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:06:05,253 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:06:05,254 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272317446] [2020-07-28 18:06:05,260 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-28 18:06:05,262 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:06:05,266 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:06:05,292 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 18:06:05,292 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:06:05,293 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:06:05,302 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:06:05,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:06:05,305 INFO L87 Difference]: Start difference. First operand 29 states. Second operand 3 states. [2020-07-28 18:06:05,456 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:05,456 INFO L93 Difference]: Finished difference Result 56 states and 84 transitions. [2020-07-28 18:06:05,457 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:06:05,457 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2020-07-28 18:06:05,457 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:06:05,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:06:05,468 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2020-07-28 18:06:05,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:06:05,472 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 84 transitions. [2020-07-28 18:06:05,472 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 84 transitions. [2020-07-28 18:06:05,615 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 84 edges. 84 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:06:05,627 INFO L225 Difference]: With dead ends: 56 [2020-07-28 18:06:05,627 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 18:06:05,631 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 18:06:05,649 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 18:06:05,668 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 23. [2020-07-28 18:06:05,669 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:06:05,669 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 23 states. [2020-07-28 18:06:05,670 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 23 states. [2020-07-28 18:06:05,670 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 23 states. [2020-07-28 18:06:05,673 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:05,674 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-28 18:06:05,674 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-28 18:06:05,675 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:05,675 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:05,675 INFO L74 IsIncluded]: Start isIncluded. First operand 23 states. Second operand 27 states. [2020-07-28 18:06:05,676 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 27 states. [2020-07-28 18:06:05,678 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:05,679 INFO L93 Difference]: Finished difference Result 27 states and 33 transitions. [2020-07-28 18:06:05,679 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2020-07-28 18:06:05,679 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:05,680 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:05,680 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:06:05,680 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:06:05,681 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23 states. [2020-07-28 18:06:05,682 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23 states to 23 states and 28 transitions. [2020-07-28 18:06:05,684 INFO L78 Accepts]: Start accepts. Automaton has 23 states and 28 transitions. Word has length 13 [2020-07-28 18:06:05,684 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:06:05,685 INFO L479 AbstractCegarLoop]: Abstraction has 23 states and 28 transitions. [2020-07-28 18:06:05,685 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:06:05,685 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states and 28 transitions. [2020-07-28 18:06:05,686 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 18:06:05,686 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:06:05,686 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:06:05,687 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2020-07-28 18:06:05,687 INFO L427 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:06:05,688 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:06:05,688 INFO L82 PathProgramCache]: Analyzing trace with hash -780239213, now seen corresponding path program 1 times [2020-07-28 18:06:05,688 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:06:05,689 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [863358860] [2020-07-28 18:06:05,689 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:06:05,716 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:06:05,768 INFO L280 TraceCheckUtils]: 0: Hoare triple {201#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {201#true} is VALID [2020-07-28 18:06:05,770 INFO L280 TraceCheckUtils]: 1: Hoare triple {201#true} havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~post12, main_~new_data~0, main_#t~ret14, main_#t~post13, main_~expected~0, main_~len~0, main_~data~0, main_~s~0.base, main_~s~0.offset, main_~i~0;main_~len~0 := 2;main_~data~0 := 1;dll_create_#in~len, dll_create_#in~data := main_~len~0, main_~data~0;havoc dll_create_#res.base, dll_create_#res.offset;havoc dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset, dll_create_#t~post4, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~len, dll_create_~data, dll_create_~head~0.base, dll_create_~head~0.offset;dll_create_~len := dll_create_#in~len;dll_create_~data := dll_create_#in~data;dll_create_~head~0.base, dll_create_~head~0.offset := 0, 0; {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} is VALID [2020-07-28 18:06:05,772 INFO L280 TraceCheckUtils]: 2: Hoare triple {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} assume !!(dll_create_~len > 0);call dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0.base, dll_create_~new_head~0.offset := dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset; {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} is VALID [2020-07-28 18:06:05,774 INFO L280 TraceCheckUtils]: 3: Hoare triple {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} assume !(0 == dll_create_~new_head~0.base && 0 == dll_create_~new_head~0.offset); {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} is VALID [2020-07-28 18:06:05,776 INFO L280 TraceCheckUtils]: 4: Hoare triple {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} call write~int(dll_create_~data, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, 4);call write~$Pointer$(dll_create_~head~0.base, dll_create_~head~0.offset, dll_create_~new_head~0.base, 4 + dll_create_~new_head~0.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0.base, 8 + dll_create_~new_head~0.offset, 4); {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} is VALID [2020-07-28 18:06:05,778 INFO L280 TraceCheckUtils]: 5: Hoare triple {203#(and (= ULTIMATE.start_dll_create_~head~0.base 0) (= 0 ULTIMATE.start_dll_create_~head~0.offset))} assume dll_create_~head~0.base != 0 || dll_create_~head~0.offset != 0;call write~$Pointer$(dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~head~0.base, 8 + dll_create_~head~0.offset, 4); {202#false} is VALID [2020-07-28 18:06:05,779 INFO L280 TraceCheckUtils]: 6: Hoare triple {202#false} dll_create_~head~0.base, dll_create_~head~0.offset := dll_create_~new_head~0.base, dll_create_~new_head~0.offset;dll_create_#t~post4 := dll_create_~len;dll_create_~len := dll_create_#t~post4 - 1;havoc dll_create_#t~post4; {202#false} is VALID [2020-07-28 18:06:05,779 INFO L280 TraceCheckUtils]: 7: Hoare triple {202#false} assume !(dll_create_~len > 0); {202#false} is VALID [2020-07-28 18:06:05,780 INFO L280 TraceCheckUtils]: 8: Hoare triple {202#false} dll_create_#res.base, dll_create_#res.offset := dll_create_~head~0.base, dll_create_~head~0.offset; {202#false} is VALID [2020-07-28 18:06:05,780 INFO L280 TraceCheckUtils]: 9: Hoare triple {202#false} main_#t~ret11.base, main_#t~ret11.offset := dll_create_#res.base, dll_create_#res.offset;main_~s~0.base, main_~s~0.offset := main_#t~ret11.base, main_#t~ret11.offset;havoc main_#t~ret11.base, main_#t~ret11.offset;havoc main_~i~0;main_~i~0 := main_~len~0 - 1; {202#false} is VALID [2020-07-28 18:06:05,781 INFO L280 TraceCheckUtils]: 10: Hoare triple {202#false} assume !(main_~i~0 >= 0); {202#false} is VALID [2020-07-28 18:06:05,781 INFO L280 TraceCheckUtils]: 11: Hoare triple {202#false} main_~i~0 := main_~len~0 - 1; {202#false} is VALID [2020-07-28 18:06:05,781 INFO L280 TraceCheckUtils]: 12: Hoare triple {202#false} assume !!(main_~i~0 <= 0);main_~expected~0 := main_~i~0 + main_~len~0;dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset, dll_get_data_at_#in~index := main_~s~0.base, main_~s~0.offset, main_~i~0;havoc dll_get_data_at_#res;havoc dll_get_data_at_#t~mem6.base, dll_get_data_at_#t~mem6.offset, dll_get_data_at_#t~post7, dll_get_data_at_#t~mem8, dll_get_data_at_~head.base, dll_get_data_at_~head.offset, dll_get_data_at_~index;dll_get_data_at_~head.base, dll_get_data_at_~head.offset := dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset;dll_get_data_at_~index := dll_get_data_at_#in~index; {202#false} is VALID [2020-07-28 18:06:05,782 INFO L280 TraceCheckUtils]: 13: Hoare triple {202#false} assume !(dll_get_data_at_~index > 0); {202#false} is VALID [2020-07-28 18:06:05,782 INFO L280 TraceCheckUtils]: 14: Hoare triple {202#false} call dll_get_data_at_#t~mem8 := read~int(dll_get_data_at_~head.base, dll_get_data_at_~head.offset, 4);dll_get_data_at_#res := dll_get_data_at_#t~mem8;havoc dll_get_data_at_#t~mem8; {202#false} is VALID [2020-07-28 18:06:05,782 INFO L280 TraceCheckUtils]: 15: Hoare triple {202#false} main_#t~ret14 := dll_get_data_at_#res;assume -2147483648 <= main_#t~ret14 && main_#t~ret14 <= 2147483647; {202#false} is VALID [2020-07-28 18:06:05,783 INFO L280 TraceCheckUtils]: 16: Hoare triple {202#false} assume main_~expected~0 != main_#t~ret14;havoc main_#t~ret14; {202#false} is VALID [2020-07-28 18:06:05,783 INFO L280 TraceCheckUtils]: 17: Hoare triple {202#false} assume !false; {202#false} is VALID [2020-07-28 18:06:05,786 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:06:05,787 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [863358860] [2020-07-28 18:06:05,787 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:06:05,787 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2020-07-28 18:06:05,788 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [49740343] [2020-07-28 18:06:05,790 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 18:06:05,790 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:06:05,790 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states. [2020-07-28 18:06:05,821 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 18 edges. 18 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:06:05,821 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2020-07-28 18:06:05,821 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:06:05,822 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2020-07-28 18:06:05,822 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2020-07-28 18:06:05,822 INFO L87 Difference]: Start difference. First operand 23 states and 28 transitions. Second operand 3 states. [2020-07-28 18:06:05,920 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:05,920 INFO L93 Difference]: Finished difference Result 47 states and 58 transitions. [2020-07-28 18:06:05,921 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2020-07-28 18:06:05,921 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 18 [2020-07-28 18:06:05,921 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:06:05,921 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:06:05,924 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-28 18:06:05,924 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2020-07-28 18:06:05,926 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 58 transitions. [2020-07-28 18:06:05,926 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 3 states and 58 transitions. [2020-07-28 18:06:06,033 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 58 edges. 58 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:06:06,034 INFO L225 Difference]: With dead ends: 47 [2020-07-28 18:06:06,035 INFO L226 Difference]: Without dead ends: 27 [2020-07-28 18:06:06,036 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 18:06:06,037 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2020-07-28 18:06:06,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2020-07-28 18:06:06,050 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:06:06,050 INFO L82 GeneralOperation]: Start isEquivalent. First operand 27 states. Second operand 26 states. [2020-07-28 18:06:06,050 INFO L74 IsIncluded]: Start isIncluded. First operand 27 states. Second operand 26 states. [2020-07-28 18:06:06,050 INFO L87 Difference]: Start difference. First operand 27 states. Second operand 26 states. [2020-07-28 18:06:06,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:06,053 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-28 18:06:06,054 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-28 18:06:06,055 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:06,055 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:06,055 INFO L74 IsIncluded]: Start isIncluded. First operand 26 states. Second operand 27 states. [2020-07-28 18:06:06,056 INFO L87 Difference]: Start difference. First operand 26 states. Second operand 27 states. [2020-07-28 18:06:06,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:06,061 INFO L93 Difference]: Finished difference Result 27 states and 32 transitions. [2020-07-28 18:06:06,061 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 32 transitions. [2020-07-28 18:06:06,062 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:06,063 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:06,063 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:06:06,063 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:06:06,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2020-07-28 18:06:06,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 31 transitions. [2020-07-28 18:06:06,074 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 31 transitions. Word has length 18 [2020-07-28 18:06:06,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:06:06,075 INFO L479 AbstractCegarLoop]: Abstraction has 26 states and 31 transitions. [2020-07-28 18:06:06,075 INFO L480 AbstractCegarLoop]: Interpolant automaton has 3 states. [2020-07-28 18:06:06,075 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 31 transitions. [2020-07-28 18:06:06,078 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2020-07-28 18:06:06,078 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:06:06,079 INFO L422 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:06:06,079 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2020-07-28 18:06:06,079 INFO L427 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:06:06,080 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:06:06,080 INFO L82 PathProgramCache]: Analyzing trace with hash -1367045227, now seen corresponding path program 1 times [2020-07-28 18:06:06,082 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:06:06,082 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [890869893] [2020-07-28 18:06:06,083 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:06:06,144 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:06:06,228 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-28 18:06:06,229 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~post12, main_~new_data~0, main_#t~ret14, main_#t~post13, main_~expected~0, main_~len~0, main_~data~0, main_~s~0.base, main_~s~0.offset, main_~i~0;main_~len~0 := 2;main_~data~0 := 1;dll_create_#in~len, dll_create_#in~data := main_~len~0, main_~data~0;havoc dll_create_#res.base, dll_create_#res.offset;havoc dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset, dll_create_#t~post4, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~len, dll_create_~data, dll_create_~head~0.base, dll_create_~head~0.offset;dll_create_~len := dll_create_#in~len;dll_create_~data := dll_create_#in~data;dll_create_~head~0.base, dll_create_~head~0.offset := 0, 0; {361#(= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,230 INFO L280 TraceCheckUtils]: 2: Hoare triple {361#(= 2 ULTIMATE.start_dll_create_~len)} assume !!(dll_create_~len > 0);call dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0.base, dll_create_~new_head~0.offset := dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset; {361#(= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,231 INFO L280 TraceCheckUtils]: 3: Hoare triple {361#(= 2 ULTIMATE.start_dll_create_~len)} assume !(0 == dll_create_~new_head~0.base && 0 == dll_create_~new_head~0.offset); {361#(= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,232 INFO L280 TraceCheckUtils]: 4: Hoare triple {361#(= 2 ULTIMATE.start_dll_create_~len)} call write~int(dll_create_~data, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, 4);call write~$Pointer$(dll_create_~head~0.base, dll_create_~head~0.offset, dll_create_~new_head~0.base, 4 + dll_create_~new_head~0.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0.base, 8 + dll_create_~new_head~0.offset, 4); {361#(= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,233 INFO L280 TraceCheckUtils]: 5: Hoare triple {361#(= 2 ULTIMATE.start_dll_create_~len)} assume !(dll_create_~head~0.base != 0 || dll_create_~head~0.offset != 0); {361#(= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,235 INFO L280 TraceCheckUtils]: 6: Hoare triple {361#(= 2 ULTIMATE.start_dll_create_~len)} dll_create_~head~0.base, dll_create_~head~0.offset := dll_create_~new_head~0.base, dll_create_~new_head~0.offset;dll_create_#t~post4 := dll_create_~len;dll_create_~len := dll_create_#t~post4 - 1;havoc dll_create_#t~post4; {362#(<= 1 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,236 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(<= 1 ULTIMATE.start_dll_create_~len)} assume !(dll_create_~len > 0); {360#false} is VALID [2020-07-28 18:06:06,237 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#false} dll_create_#res.base, dll_create_#res.offset := dll_create_~head~0.base, dll_create_~head~0.offset; {360#false} is VALID [2020-07-28 18:06:06,237 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#false} main_#t~ret11.base, main_#t~ret11.offset := dll_create_#res.base, dll_create_#res.offset;main_~s~0.base, main_~s~0.offset := main_#t~ret11.base, main_#t~ret11.offset;havoc main_#t~ret11.base, main_#t~ret11.offset;havoc main_~i~0;main_~i~0 := main_~len~0 - 1; {360#false} is VALID [2020-07-28 18:06:06,238 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#false} assume !(main_~i~0 >= 0); {360#false} is VALID [2020-07-28 18:06:06,238 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#false} main_~i~0 := main_~len~0 - 1; {360#false} is VALID [2020-07-28 18:06:06,239 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#false} assume !!(main_~i~0 <= 0);main_~expected~0 := main_~i~0 + main_~len~0;dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset, dll_get_data_at_#in~index := main_~s~0.base, main_~s~0.offset, main_~i~0;havoc dll_get_data_at_#res;havoc dll_get_data_at_#t~mem6.base, dll_get_data_at_#t~mem6.offset, dll_get_data_at_#t~post7, dll_get_data_at_#t~mem8, dll_get_data_at_~head.base, dll_get_data_at_~head.offset, dll_get_data_at_~index;dll_get_data_at_~head.base, dll_get_data_at_~head.offset := dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset;dll_get_data_at_~index := dll_get_data_at_#in~index; {360#false} is VALID [2020-07-28 18:06:06,239 INFO L280 TraceCheckUtils]: 13: Hoare triple {360#false} assume !(dll_get_data_at_~index > 0); {360#false} is VALID [2020-07-28 18:06:06,240 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#false} call dll_get_data_at_#t~mem8 := read~int(dll_get_data_at_~head.base, dll_get_data_at_~head.offset, 4);dll_get_data_at_#res := dll_get_data_at_#t~mem8;havoc dll_get_data_at_#t~mem8; {360#false} is VALID [2020-07-28 18:06:06,240 INFO L280 TraceCheckUtils]: 15: Hoare triple {360#false} main_#t~ret14 := dll_get_data_at_#res;assume -2147483648 <= main_#t~ret14 && main_#t~ret14 <= 2147483647; {360#false} is VALID [2020-07-28 18:06:06,240 INFO L280 TraceCheckUtils]: 16: Hoare triple {360#false} assume main_~expected~0 != main_#t~ret14;havoc main_#t~ret14; {360#false} is VALID [2020-07-28 18:06:06,241 INFO L280 TraceCheckUtils]: 17: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-28 18:06:06,242 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:06:06,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [890869893] [2020-07-28 18:06:06,243 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [122650903] [2020-07-28 18:06:06,244 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true [2020-07-28 18:06:06,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:06:06,330 INFO L263 TraceCheckSpWp]: Trace formula consists of 92 conjuncts, 5 conjunts are in the unsatisfiable core [2020-07-28 18:06:06,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:06:06,350 INFO L286 TraceCheckSpWp]: Computing forward predicates... [2020-07-28 18:06:06,534 INFO L280 TraceCheckUtils]: 0: Hoare triple {359#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {359#true} is VALID [2020-07-28 18:06:06,535 INFO L280 TraceCheckUtils]: 1: Hoare triple {359#true} havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~post12, main_~new_data~0, main_#t~ret14, main_#t~post13, main_~expected~0, main_~len~0, main_~data~0, main_~s~0.base, main_~s~0.offset, main_~i~0;main_~len~0 := 2;main_~data~0 := 1;dll_create_#in~len, dll_create_#in~data := main_~len~0, main_~data~0;havoc dll_create_#res.base, dll_create_#res.offset;havoc dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset, dll_create_#t~post4, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~len, dll_create_~data, dll_create_~head~0.base, dll_create_~head~0.offset;dll_create_~len := dll_create_#in~len;dll_create_~data := dll_create_#in~data;dll_create_~head~0.base, dll_create_~head~0.offset := 0, 0; {369#(<= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,537 INFO L280 TraceCheckUtils]: 2: Hoare triple {369#(<= 2 ULTIMATE.start_dll_create_~len)} assume !!(dll_create_~len > 0);call dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0.base, dll_create_~new_head~0.offset := dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset; {369#(<= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,538 INFO L280 TraceCheckUtils]: 3: Hoare triple {369#(<= 2 ULTIMATE.start_dll_create_~len)} assume !(0 == dll_create_~new_head~0.base && 0 == dll_create_~new_head~0.offset); {369#(<= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,539 INFO L280 TraceCheckUtils]: 4: Hoare triple {369#(<= 2 ULTIMATE.start_dll_create_~len)} call write~int(dll_create_~data, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, 4);call write~$Pointer$(dll_create_~head~0.base, dll_create_~head~0.offset, dll_create_~new_head~0.base, 4 + dll_create_~new_head~0.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0.base, 8 + dll_create_~new_head~0.offset, 4); {369#(<= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,540 INFO L280 TraceCheckUtils]: 5: Hoare triple {369#(<= 2 ULTIMATE.start_dll_create_~len)} assume !(dll_create_~head~0.base != 0 || dll_create_~head~0.offset != 0); {369#(<= 2 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,542 INFO L280 TraceCheckUtils]: 6: Hoare triple {369#(<= 2 ULTIMATE.start_dll_create_~len)} dll_create_~head~0.base, dll_create_~head~0.offset := dll_create_~new_head~0.base, dll_create_~new_head~0.offset;dll_create_#t~post4 := dll_create_~len;dll_create_~len := dll_create_#t~post4 - 1;havoc dll_create_#t~post4; {362#(<= 1 ULTIMATE.start_dll_create_~len)} is VALID [2020-07-28 18:06:06,543 INFO L280 TraceCheckUtils]: 7: Hoare triple {362#(<= 1 ULTIMATE.start_dll_create_~len)} assume !(dll_create_~len > 0); {360#false} is VALID [2020-07-28 18:06:06,543 INFO L280 TraceCheckUtils]: 8: Hoare triple {360#false} dll_create_#res.base, dll_create_#res.offset := dll_create_~head~0.base, dll_create_~head~0.offset; {360#false} is VALID [2020-07-28 18:06:06,544 INFO L280 TraceCheckUtils]: 9: Hoare triple {360#false} main_#t~ret11.base, main_#t~ret11.offset := dll_create_#res.base, dll_create_#res.offset;main_~s~0.base, main_~s~0.offset := main_#t~ret11.base, main_#t~ret11.offset;havoc main_#t~ret11.base, main_#t~ret11.offset;havoc main_~i~0;main_~i~0 := main_~len~0 - 1; {360#false} is VALID [2020-07-28 18:06:06,544 INFO L280 TraceCheckUtils]: 10: Hoare triple {360#false} assume !(main_~i~0 >= 0); {360#false} is VALID [2020-07-28 18:06:06,544 INFO L280 TraceCheckUtils]: 11: Hoare triple {360#false} main_~i~0 := main_~len~0 - 1; {360#false} is VALID [2020-07-28 18:06:06,545 INFO L280 TraceCheckUtils]: 12: Hoare triple {360#false} assume !!(main_~i~0 <= 0);main_~expected~0 := main_~i~0 + main_~len~0;dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset, dll_get_data_at_#in~index := main_~s~0.base, main_~s~0.offset, main_~i~0;havoc dll_get_data_at_#res;havoc dll_get_data_at_#t~mem6.base, dll_get_data_at_#t~mem6.offset, dll_get_data_at_#t~post7, dll_get_data_at_#t~mem8, dll_get_data_at_~head.base, dll_get_data_at_~head.offset, dll_get_data_at_~index;dll_get_data_at_~head.base, dll_get_data_at_~head.offset := dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset;dll_get_data_at_~index := dll_get_data_at_#in~index; {360#false} is VALID [2020-07-28 18:06:06,545 INFO L280 TraceCheckUtils]: 13: Hoare triple {360#false} assume !(dll_get_data_at_~index > 0); {360#false} is VALID [2020-07-28 18:06:06,546 INFO L280 TraceCheckUtils]: 14: Hoare triple {360#false} call dll_get_data_at_#t~mem8 := read~int(dll_get_data_at_~head.base, dll_get_data_at_~head.offset, 4);dll_get_data_at_#res := dll_get_data_at_#t~mem8;havoc dll_get_data_at_#t~mem8; {360#false} is VALID [2020-07-28 18:06:06,546 INFO L280 TraceCheckUtils]: 15: Hoare triple {360#false} main_#t~ret14 := dll_get_data_at_#res;assume -2147483648 <= main_#t~ret14 && main_#t~ret14 <= 2147483647; {360#false} is VALID [2020-07-28 18:06:06,547 INFO L280 TraceCheckUtils]: 16: Hoare triple {360#false} assume main_~expected~0 != main_#t~ret14;havoc main_#t~ret14; {360#false} is VALID [2020-07-28 18:06:06,547 INFO L280 TraceCheckUtils]: 17: Hoare triple {360#false} assume !false; {360#false} is VALID [2020-07-28 18:06:06,549 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2020-07-28 18:06:06,549 INFO L220 FreeRefinementEngine]: Constructing automaton from 0 perfect and 2 imperfect interpolant sequences. [2020-07-28 18:06:06,550 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 5 [2020-07-28 18:06:06,550 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743775776] [2020-07-28 18:06:06,551 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-28 18:06:06,551 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:06:06,552 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 5 states. [2020-07-28 18:06:06,587 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 24 edges. 24 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:06:06,588 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2020-07-28 18:06:06,588 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:06:06,589 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2020-07-28 18:06:06,589 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:06:06,589 INFO L87 Difference]: Start difference. First operand 26 states and 31 transitions. Second operand 5 states. [2020-07-28 18:06:06,712 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:06,712 INFO L93 Difference]: Finished difference Result 43 states and 52 transitions. [2020-07-28 18:06:06,713 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:06:06,713 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 18 [2020-07-28 18:06:06,713 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:06:06,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:06:06,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-28 18:06:06,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2020-07-28 18:06:06,716 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 52 transitions. [2020-07-28 18:06:06,717 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 52 transitions. [2020-07-28 18:06:06,796 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 52 edges. 52 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:06:06,797 INFO L225 Difference]: With dead ends: 43 [2020-07-28 18:06:06,797 INFO L226 Difference]: Without dead ends: 28 [2020-07-28 18:06:06,798 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:06:06,798 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2020-07-28 18:06:06,808 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2020-07-28 18:06:06,809 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:06:06,809 INFO L82 GeneralOperation]: Start isEquivalent. First operand 28 states. Second operand 28 states. [2020-07-28 18:06:06,809 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 18:06:06,809 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 18:06:06,811 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:06,811 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-28 18:06:06,812 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 18:06:06,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:06,812 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:06,813 INFO L74 IsIncluded]: Start isIncluded. First operand 28 states. Second operand 28 states. [2020-07-28 18:06:06,813 INFO L87 Difference]: Start difference. First operand 28 states. Second operand 28 states. [2020-07-28 18:06:06,815 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:06,815 INFO L93 Difference]: Finished difference Result 28 states and 33 transitions. [2020-07-28 18:06:06,815 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 18:06:06,816 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:06,816 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:06,817 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:06:06,817 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:06:06,817 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2020-07-28 18:06:06,818 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 33 transitions. [2020-07-28 18:06:06,819 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 33 transitions. Word has length 18 [2020-07-28 18:06:06,819 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:06:06,819 INFO L479 AbstractCegarLoop]: Abstraction has 28 states and 33 transitions. [2020-07-28 18:06:06,819 INFO L480 AbstractCegarLoop]: Interpolant automaton has 5 states. [2020-07-28 18:06:06,820 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 33 transitions. [2020-07-28 18:06:06,820 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2020-07-28 18:06:06,821 INFO L414 BasicCegarLoop]: Found error trace [2020-07-28 18:06:06,821 INFO L422 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2020-07-28 18:06:07,035 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2020-07-28 18:06:07,036 INFO L427 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2020-07-28 18:06:07,037 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2020-07-28 18:06:07,037 INFO L82 PathProgramCache]: Analyzing trace with hash 980561436, now seen corresponding path program 1 times [2020-07-28 18:06:07,038 INFO L163 FreeRefinementEngine]: Executing refinement strategy CAMEL [2020-07-28 18:06:07,039 INFO L354 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [835930845] [2020-07-28 18:06:07,039 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2020-07-28 18:06:07,067 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2020-07-28 18:06:07,123 INFO L280 TraceCheckUtils]: 0: Hoare triple {571#true} #NULL.base, #NULL.offset := 0, 0;#valid := #valid[0 := 0];assume 0 < #StackHeapBarrier; {571#true} is VALID [2020-07-28 18:06:07,124 INFO L280 TraceCheckUtils]: 1: Hoare triple {571#true} havoc main_#res;havoc main_#t~ret11.base, main_#t~ret11.offset, main_#t~post12, main_~new_data~0, main_#t~ret14, main_#t~post13, main_~expected~0, main_~len~0, main_~data~0, main_~s~0.base, main_~s~0.offset, main_~i~0;main_~len~0 := 2;main_~data~0 := 1;dll_create_#in~len, dll_create_#in~data := main_~len~0, main_~data~0;havoc dll_create_#res.base, dll_create_#res.offset;havoc dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset, dll_create_#t~post4, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~len, dll_create_~data, dll_create_~head~0.base, dll_create_~head~0.offset;dll_create_~len := dll_create_#in~len;dll_create_~data := dll_create_#in~data;dll_create_~head~0.base, dll_create_~head~0.offset := 0, 0; {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,125 INFO L280 TraceCheckUtils]: 2: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume !!(dll_create_~len > 0);call dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0.base, dll_create_~new_head~0.offset := dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset; {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,126 INFO L280 TraceCheckUtils]: 3: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume !(0 == dll_create_~new_head~0.base && 0 == dll_create_~new_head~0.offset); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,127 INFO L280 TraceCheckUtils]: 4: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} call write~int(dll_create_~data, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, 4);call write~$Pointer$(dll_create_~head~0.base, dll_create_~head~0.offset, dll_create_~new_head~0.base, 4 + dll_create_~new_head~0.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0.base, 8 + dll_create_~new_head~0.offset, 4); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,127 INFO L280 TraceCheckUtils]: 5: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume !(dll_create_~head~0.base != 0 || dll_create_~head~0.offset != 0); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,128 INFO L280 TraceCheckUtils]: 6: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} dll_create_~head~0.base, dll_create_~head~0.offset := dll_create_~new_head~0.base, dll_create_~new_head~0.offset;dll_create_#t~post4 := dll_create_~len;dll_create_~len := dll_create_#t~post4 - 1;havoc dll_create_#t~post4; {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,129 INFO L280 TraceCheckUtils]: 7: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume !!(dll_create_~len > 0);call dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset := #Ultimate.allocOnHeap(12);dll_create_~new_head~0.base, dll_create_~new_head~0.offset := dll_create_#t~malloc3.base, dll_create_#t~malloc3.offset; {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,130 INFO L280 TraceCheckUtils]: 8: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume !(0 == dll_create_~new_head~0.base && 0 == dll_create_~new_head~0.offset); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,131 INFO L280 TraceCheckUtils]: 9: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} call write~int(dll_create_~data, dll_create_~new_head~0.base, dll_create_~new_head~0.offset, 4);call write~$Pointer$(dll_create_~head~0.base, dll_create_~head~0.offset, dll_create_~new_head~0.base, 4 + dll_create_~new_head~0.offset, 4);call write~$Pointer$(0, 0, dll_create_~new_head~0.base, 8 + dll_create_~new_head~0.offset, 4); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,131 INFO L280 TraceCheckUtils]: 10: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume dll_create_~head~0.base != 0 || dll_create_~head~0.offset != 0;call write~$Pointer$(dll_create_~new_head~0.base, dll_create_~new_head~0.offset, dll_create_~head~0.base, 8 + dll_create_~head~0.offset, 4); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,132 INFO L280 TraceCheckUtils]: 11: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} dll_create_~head~0.base, dll_create_~head~0.offset := dll_create_~new_head~0.base, dll_create_~new_head~0.offset;dll_create_#t~post4 := dll_create_~len;dll_create_~len := dll_create_#t~post4 - 1;havoc dll_create_#t~post4; {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,133 INFO L280 TraceCheckUtils]: 12: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} assume !(dll_create_~len > 0); {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,134 INFO L280 TraceCheckUtils]: 13: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} dll_create_#res.base, dll_create_#res.offset := dll_create_~head~0.base, dll_create_~head~0.offset; {573#(<= 2 ULTIMATE.start_main_~len~0)} is VALID [2020-07-28 18:06:07,135 INFO L280 TraceCheckUtils]: 14: Hoare triple {573#(<= 2 ULTIMATE.start_main_~len~0)} main_#t~ret11.base, main_#t~ret11.offset := dll_create_#res.base, dll_create_#res.offset;main_~s~0.base, main_~s~0.offset := main_#t~ret11.base, main_#t~ret11.offset;havoc main_#t~ret11.base, main_#t~ret11.offset;havoc main_~i~0;main_~i~0 := main_~len~0 - 1; {574#(<= 1 ULTIMATE.start_main_~i~0)} is VALID [2020-07-28 18:06:07,136 INFO L280 TraceCheckUtils]: 15: Hoare triple {574#(<= 1 ULTIMATE.start_main_~i~0)} assume !(main_~i~0 >= 0); {572#false} is VALID [2020-07-28 18:06:07,136 INFO L280 TraceCheckUtils]: 16: Hoare triple {572#false} main_~i~0 := main_~len~0 - 1; {572#false} is VALID [2020-07-28 18:06:07,137 INFO L280 TraceCheckUtils]: 17: Hoare triple {572#false} assume !!(main_~i~0 <= 0);main_~expected~0 := main_~i~0 + main_~len~0;dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset, dll_get_data_at_#in~index := main_~s~0.base, main_~s~0.offset, main_~i~0;havoc dll_get_data_at_#res;havoc dll_get_data_at_#t~mem6.base, dll_get_data_at_#t~mem6.offset, dll_get_data_at_#t~post7, dll_get_data_at_#t~mem8, dll_get_data_at_~head.base, dll_get_data_at_~head.offset, dll_get_data_at_~index;dll_get_data_at_~head.base, dll_get_data_at_~head.offset := dll_get_data_at_#in~head.base, dll_get_data_at_#in~head.offset;dll_get_data_at_~index := dll_get_data_at_#in~index; {572#false} is VALID [2020-07-28 18:06:07,137 INFO L280 TraceCheckUtils]: 18: Hoare triple {572#false} assume !(dll_get_data_at_~index > 0); {572#false} is VALID [2020-07-28 18:06:07,137 INFO L280 TraceCheckUtils]: 19: Hoare triple {572#false} call dll_get_data_at_#t~mem8 := read~int(dll_get_data_at_~head.base, dll_get_data_at_~head.offset, 4);dll_get_data_at_#res := dll_get_data_at_#t~mem8;havoc dll_get_data_at_#t~mem8; {572#false} is VALID [2020-07-28 18:06:07,138 INFO L280 TraceCheckUtils]: 20: Hoare triple {572#false} main_#t~ret14 := dll_get_data_at_#res;assume -2147483648 <= main_#t~ret14 && main_#t~ret14 <= 2147483647; {572#false} is VALID [2020-07-28 18:06:07,138 INFO L280 TraceCheckUtils]: 21: Hoare triple {572#false} assume main_~expected~0 != main_#t~ret14;havoc main_#t~ret14; {572#false} is VALID [2020-07-28 18:06:07,138 INFO L280 TraceCheckUtils]: 22: Hoare triple {572#false} assume !false; {572#false} is VALID [2020-07-28 18:06:07,140 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2020-07-28 18:06:07,141 INFO L354 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [835930845] [2020-07-28 18:06:07,141 INFO L220 FreeRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2020-07-28 18:06:07,141 INFO L233 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2020-07-28 18:06:07,141 INFO L156 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1932457467] [2020-07-28 18:06:07,142 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-28 18:06:07,142 INFO L84 Accepts]: Finished accepts. word is accepted. [2020-07-28 18:06:07,142 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states. [2020-07-28 18:06:07,170 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 18:06:07,170 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2020-07-28 18:06:07,171 INFO L143 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2020-07-28 18:06:07,171 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2020-07-28 18:06:07,171 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2020-07-28 18:06:07,171 INFO L87 Difference]: Start difference. First operand 28 states and 33 transitions. Second operand 4 states. [2020-07-28 18:06:07,264 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:07,265 INFO L93 Difference]: Finished difference Result 34 states and 41 transitions. [2020-07-28 18:06:07,265 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2020-07-28 18:06:07,265 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 23 [2020-07-28 18:06:07,265 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2020-07-28 18:06:07,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:06:07,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-28 18:06:07,267 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2020-07-28 18:06:07,267 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 35 transitions. [2020-07-28 18:06:07,268 INFO L86 InductivityCheck]: Starting indutivity check of a Floyd-Hoare automaton with 4 states and 35 transitions. [2020-07-28 18:06:07,321 INFO L119 InductivityCheck]: Floyd-Hoare automaton has 35 edges. 35 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. [2020-07-28 18:06:07,322 INFO L225 Difference]: With dead ends: 34 [2020-07-28 18:06:07,322 INFO L226 Difference]: Without dead ends: 0 [2020-07-28 18:06:07,322 INFO L675 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2020-07-28 18:06:07,323 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2020-07-28 18:06:07,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2020-07-28 18:06:07,323 INFO L214 AbstractMinimizeNwa]: Start testing correctness of minimizeSevpa [2020-07-28 18:06:07,323 INFO L82 GeneralOperation]: Start isEquivalent. First operand 0 states. Second operand 0 states. [2020-07-28 18:06:07,324 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:06:07,324 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:06:07,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:07,325 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:06:07,325 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:06:07,325 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:07,326 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:07,326 INFO L74 IsIncluded]: Start isIncluded. First operand 0 states. Second operand 0 states. [2020-07-28 18:06:07,327 INFO L87 Difference]: Start difference. First operand 0 states. Second operand 0 states. [2020-07-28 18:06:07,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2020-07-28 18:06:07,327 INFO L93 Difference]: Finished difference Result 0 states and 0 transitions. [2020-07-28 18:06:07,327 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:06:07,327 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:07,328 INFO L83 IsIncluded]: Finished isIncluded. Language is included [2020-07-28 18:06:07,328 INFO L88 GeneralOperation]: Finished isEquivalent. [2020-07-28 18:06:07,328 INFO L221 AbstractMinimizeNwa]: Finished testing correctness of minimizeSevpa [2020-07-28 18:06:07,328 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2020-07-28 18:06:07,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2020-07-28 18:06:07,329 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 23 [2020-07-28 18:06:07,329 INFO L84 Accepts]: Finished accepts. word is rejected. [2020-07-28 18:06:07,329 INFO L479 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2020-07-28 18:06:07,329 INFO L480 AbstractCegarLoop]: Interpolant automaton has 4 states. [2020-07-28 18:06:07,329 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2020-07-28 18:06:07,329 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2020-07-28 18:06:07,330 WARN L516 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2020-07-28 18:06:07,332 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2020-07-28 18:06:07,392 INFO L268 CegarLoopResult]: For program point L622-2(lines 622 627) no Hoare annotation was computed. [2020-07-28 18:06:07,393 INFO L264 CegarLoopResult]: At program point L622-3(lines 622 627) the Hoare annotation is: (and (<= 1 ULTIMATE.start_main_~i~0) (<= 2 ULTIMATE.start_main_~len~0)) [2020-07-28 18:06:07,393 INFO L268 CegarLoopResult]: For program point L622-4(lines 622 627) no Hoare annotation was computed. [2020-07-28 18:06:07,393 INFO L268 CegarLoopResult]: For program point L606(lines 1 632) no Hoare annotation was computed. [2020-07-28 18:06:07,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2020-07-28 18:06:07,393 INFO L268 CegarLoopResult]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2020-07-28 18:06:07,394 INFO L271 CegarLoopResult]: At program point L631(lines 613 632) the Hoare annotation is: true [2020-07-28 18:06:07,394 INFO L264 CegarLoopResult]: At program point L590(lines 574 591) the Hoare annotation is: (<= 2 ULTIMATE.start_main_~len~0) [2020-07-28 18:06:07,394 INFO L264 CegarLoopResult]: At program point L607-2(lines 607 610) the Hoare annotation is: (<= 2 ULTIMATE.start_main_~len~0) [2020-07-28 18:06:07,394 INFO L268 CegarLoopResult]: For program point L607-3(lines 607 610) no Hoare annotation was computed. [2020-07-28 18:06:07,394 INFO L268 CegarLoopResult]: For program point L624(lines 624 626) no Hoare annotation was computed. [2020-07-28 18:06:07,394 INFO L264 CegarLoopResult]: At program point L600-2(lines 600 603) the Hoare annotation is: false [2020-07-28 18:06:07,395 INFO L268 CegarLoopResult]: For program point L600-3(lines 600 603) no Hoare annotation was computed. [2020-07-28 18:06:07,395 INFO L264 CegarLoopResult]: At program point L625(lines 613 632) the Hoare annotation is: false [2020-07-28 18:06:07,395 INFO L268 CegarLoopResult]: For program point L592(lines 592 598) no Hoare annotation was computed. [2020-07-28 18:06:07,395 INFO L268 CegarLoopResult]: For program point L584(lines 584 586) no Hoare annotation was computed. [2020-07-28 18:06:07,395 INFO L268 CegarLoopResult]: For program point L584-2(lines 584 586) no Hoare annotation was computed. [2020-07-28 18:06:07,395 INFO L264 CegarLoopResult]: At program point L576-2(lines 576 589) the Hoare annotation is: (<= 2 ULTIMATE.start_main_~len~0) [2020-07-28 18:06:07,396 INFO L268 CegarLoopResult]: For program point L576-3(lines 576 589) no Hoare annotation was computed. [2020-07-28 18:06:07,396 INFO L271 CegarLoopResult]: At program point L593-2(lines 593 597) the Hoare annotation is: true [2020-07-28 18:06:07,396 INFO L264 CegarLoopResult]: At program point L618-2(lines 618 621) the Hoare annotation is: (<= 2 ULTIMATE.start_main_~len~0) [2020-07-28 18:06:07,396 INFO L268 CegarLoopResult]: For program point L618-3(lines 618 621) no Hoare annotation was computed. [2020-07-28 18:06:07,396 INFO L268 CegarLoopResult]: For program point L-1(line -1) no Hoare annotation was computed. [2020-07-28 18:06:07,396 INFO L268 CegarLoopResult]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 630) no Hoare annotation was computed. [2020-07-28 18:06:07,397 INFO L268 CegarLoopResult]: For program point L578(lines 578 580) no Hoare annotation was computed. [2020-07-28 18:06:07,397 INFO L268 CegarLoopResult]: For program point L578-1(lines 578 580) no Hoare annotation was computed. [2020-07-28 18:06:07,397 INFO L268 CegarLoopResult]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2020-07-28 18:06:07,397 INFO L271 CegarLoopResult]: At program point L562(line 562) the Hoare annotation is: true [2020-07-28 18:06:07,397 INFO L264 CegarLoopResult]: At program point L604(lines 599 605) the Hoare annotation is: false [2020-07-28 18:06:07,402 WARN L170 areAnnotationChecker]: ULTIMATE.startENTRY has no Hoare annotation [2020-07-28 18:06:07,402 WARN L170 areAnnotationChecker]: L-1 has no Hoare annotation [2020-07-28 18:06:07,402 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-28 18:06:07,402 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-28 18:06:07,402 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-28 18:06:07,402 WARN L170 areAnnotationChecker]: L576-3 has no Hoare annotation [2020-07-28 18:06:07,403 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-28 18:06:07,403 WARN L170 areAnnotationChecker]: L578 has no Hoare annotation [2020-07-28 18:06:07,404 WARN L170 areAnnotationChecker]: L578-1 has no Hoare annotation [2020-07-28 18:06:07,404 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-28 18:06:07,404 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-28 18:06:07,405 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-28 18:06:07,405 WARN L170 areAnnotationChecker]: L584 has no Hoare annotation [2020-07-28 18:06:07,405 WARN L170 areAnnotationChecker]: L618-3 has no Hoare annotation [2020-07-28 18:06:07,405 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-28 18:06:07,405 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-28 18:06:07,406 WARN L170 areAnnotationChecker]: L584-2 has no Hoare annotation [2020-07-28 18:06:07,406 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-28 18:06:07,406 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-28 18:06:07,407 WARN L170 areAnnotationChecker]: L607-3 has no Hoare annotation [2020-07-28 18:06:07,407 WARN L170 areAnnotationChecker]: L622-4 has no Hoare annotation [2020-07-28 18:06:07,408 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-28 18:06:07,408 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-28 18:06:07,408 WARN L170 areAnnotationChecker]: L606 has no Hoare annotation [2020-07-28 18:06:07,408 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2020-07-28 18:06:07,408 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2020-07-28 18:06:07,408 WARN L170 areAnnotationChecker]: L600-3 has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: L592 has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: L624 has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: ULTIMATE.startFINAL has no Hoare annotation [2020-07-28 18:06:07,409 WARN L170 areAnnotationChecker]: ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION has no Hoare annotation [2020-07-28 18:06:07,410 WARN L170 areAnnotationChecker]: L622-2 has no Hoare annotation [2020-07-28 18:06:07,410 INFO L163 areAnnotationChecker]: CFG has 8 edges. 8 inductive. 0 not inductive. 0 times theorem prover too weak to decide inductivity. 0 times interpolants missing. [2020-07-28 18:06:07,422 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 28.07 06:06:07 BoogieIcfgContainer [2020-07-28 18:06:07,422 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2020-07-28 18:06:07,423 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2020-07-28 18:06:07,423 INFO L271 PluginConnector]: Initializing Witness Printer... [2020-07-28 18:06:07,423 INFO L275 PluginConnector]: Witness Printer initialized [2020-07-28 18:06:07,424 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 28.07 06:06:04" (3/4) ... [2020-07-28 18:06:07,428 INFO L137 WitnessPrinter]: Generating witness for correct program [2020-07-28 18:06:07,442 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2020-07-28 18:06:07,442 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 5 nodes and edges [2020-07-28 18:06:07,443 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2020-07-28 18:06:07,518 INFO L141 WitnessManager]: Wrote witness to /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/witness.graphml [2020-07-28 18:06:07,521 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2020-07-28 18:06:07,524 INFO L168 Benchmark]: Toolchain (without parser) took 4100.41 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 953.5 MB in the beginning and 829.5 MB in the end (delta: 124.0 MB). Peak memory consumption was 261.4 MB. Max. memory is 11.5 GB. [2020-07-28 18:06:07,525 INFO L168 Benchmark]: CDTParser took 0.31 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 18:06:07,525 INFO L168 Benchmark]: CACSL2BoogieTranslator took 600.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. [2020-07-28 18:06:07,526 INFO L168 Benchmark]: Boogie Procedure Inliner took 61.73 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 18:06:07,526 INFO L168 Benchmark]: Boogie Preprocessor took 38.08 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 18:06:07,527 INFO L168 Benchmark]: RCFGBuilder took 770.10 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:06:07,527 INFO L168 Benchmark]: TraceAbstraction took 2522.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 836.1 MB in the end (delta: 233.2 MB). Peak memory consumption was 233.2 MB. Max. memory is 11.5 GB. [2020-07-28 18:06:07,528 INFO L168 Benchmark]: Witness Printer took 98.82 ms. Allocated memory is still 1.2 GB. Free memory was 836.1 MB in the beginning and 829.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. [2020-07-28 18:06:07,532 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.31 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 600.07 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 137.4 MB). Free memory was 953.5 MB in the beginning and 1.1 GB in the end (delta: -160.0 MB). Peak memory consumption was 27.5 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 61.73 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. * Boogie Preprocessor took 38.08 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. * RCFGBuilder took 770.10 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: 37.6 MB). Peak memory consumption was 37.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2522.86 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 836.1 MB in the end (delta: 233.2 MB). Peak memory consumption was 233.2 MB. Max. memory is 11.5 GB. * Witness Printer took 98.82 ms. Allocated memory is still 1.2 GB. Free memory was 836.1 MB in the beginning and 829.5 MB in the end (delta: 6.6 MB). Peak memory consumption was 6.6 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 630]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 1 specifications checked. All of them hold - InvariantResult [Line: 574]: Loop Invariant Derived loop invariant: 2 <= len - InvariantResult [Line: 576]: Loop Invariant Derived loop invariant: 2 <= len - InvariantResult [Line: 618]: Loop Invariant Derived loop invariant: 2 <= len - InvariantResult [Line: 607]: Loop Invariant Derived loop invariant: 2 <= len - InvariantResult [Line: 562]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 599]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 613]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 600]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 622]: Loop Invariant Derived loop invariant: 1 <= i && 2 <= len - InvariantResult [Line: 593]: Loop Invariant Derived loop invariant: 1 - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 29 locations, 1 error locations. Started 1 CEGAR loops. VerificationResult: SAFE, OverallTime: 2.3s, OverallIterations: 4, TraceHistogramMax: 2, AutomataDifference: 0.9s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.0s, InitialAbstractionConstructionTime: 0.0s, HoareTripleCheckerStatistics: 98 SDtfs, 33 SDslu, 108 SDs, 0 SdLazy, 26 SolverSat, 6 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.0s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 32 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=29occurred in iteration=0, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 4 MinimizatonAttempts, 5 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 11 LocationsWithAnnotation, 11 PreInvPairs, 23 NumberOfFragments, 25 HoareAnnotationTreeSize, 11 FomulaSimplifications, 37 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 11 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 0.5s InterpolantComputationTime, 90 NumberOfCodeBlocks, 90 NumberOfCodeBlocksAsserted, 5 NumberOfCheckSat, 85 ConstructedInterpolants, 0 QuantifiedInterpolants, 2951 SizeOfPredicates, 3 NumberOfNonLiveVariables, 92 ConjunctsInSsa, 5 ConjunctsInUnsatCore, 5 InterpolantComputations, 3 PerfectInterpolantSequences, 8/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 correct! Received shutdown request...