./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/ldv-sets/test_add-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cad46833 Calling Ultimate with: /usr/lib/jvm/java-8-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/config/AutomizerReach.xml -i ../../sv-benchmarks/c/ldv-sets/test_add-2.i -s /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer --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 c69389479aaa51869578ea93cca3b02df528e19e ........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.24-cad4683 [2019-10-22 09:00:18,202 INFO L177 SettingsManager]: Resetting all preferences to default values... [2019-10-22 09:00:18,204 INFO L181 SettingsManager]: Resetting UltimateCore preferences to default values [2019-10-22 09:00:18,215 INFO L184 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2019-10-22 09:00:18,216 INFO L181 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2019-10-22 09:00:18,216 INFO L181 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2019-10-22 09:00:18,217 INFO L181 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2019-10-22 09:00:18,219 INFO L181 SettingsManager]: Resetting LassoRanker preferences to default values [2019-10-22 09:00:18,220 INFO L181 SettingsManager]: Resetting Reaching Definitions preferences to default values [2019-10-22 09:00:18,221 INFO L181 SettingsManager]: Resetting SyntaxChecker preferences to default values [2019-10-22 09:00:18,221 INFO L181 SettingsManager]: Resetting Sifa preferences to default values [2019-10-22 09:00:18,222 INFO L184 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2019-10-22 09:00:18,222 INFO L181 SettingsManager]: Resetting LTL2Aut preferences to default values [2019-10-22 09:00:18,223 INFO L181 SettingsManager]: Resetting PEA to Boogie preferences to default values [2019-10-22 09:00:18,224 INFO L181 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2019-10-22 09:00:18,224 INFO L181 SettingsManager]: Resetting ChcToBoogie preferences to default values [2019-10-22 09:00:18,225 INFO L181 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2019-10-22 09:00:18,226 INFO L181 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2019-10-22 09:00:18,227 INFO L181 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2019-10-22 09:00:18,229 INFO L181 SettingsManager]: Resetting CodeCheck preferences to default values [2019-10-22 09:00:18,230 INFO L181 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2019-10-22 09:00:18,231 INFO L181 SettingsManager]: Resetting RCFGBuilder preferences to default values [2019-10-22 09:00:18,232 INFO L181 SettingsManager]: Resetting Referee preferences to default values [2019-10-22 09:00:18,232 INFO L181 SettingsManager]: Resetting TraceAbstraction preferences to default values [2019-10-22 09:00:18,234 INFO L184 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2019-10-22 09:00:18,235 INFO L184 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2019-10-22 09:00:18,235 INFO L181 SettingsManager]: Resetting TreeAutomizer preferences to default values [2019-10-22 09:00:18,235 INFO L181 SettingsManager]: Resetting IcfgToChc preferences to default values [2019-10-22 09:00:18,236 INFO L181 SettingsManager]: Resetting IcfgTransformer preferences to default values [2019-10-22 09:00:18,237 INFO L184 SettingsManager]: ReqToTest provides no preferences, ignoring... [2019-10-22 09:00:18,237 INFO L181 SettingsManager]: Resetting Boogie Printer preferences to default values [2019-10-22 09:00:18,237 INFO L181 SettingsManager]: Resetting ChcSmtPrinter preferences to default values [2019-10-22 09:00:18,238 INFO L181 SettingsManager]: Resetting ReqPrinter preferences to default values [2019-10-22 09:00:18,239 INFO L181 SettingsManager]: Resetting Witness Printer preferences to default values [2019-10-22 09:00:18,240 INFO L184 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2019-10-22 09:00:18,240 INFO L181 SettingsManager]: Resetting CDTParser preferences to default values [2019-10-22 09:00:18,240 INFO L184 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2019-10-22 09:00:18,240 INFO L184 SettingsManager]: ReqParser provides no preferences, ignoring... [2019-10-22 09:00:18,241 INFO L181 SettingsManager]: Resetting SmtParser preferences to default values [2019-10-22 09:00:18,241 INFO L181 SettingsManager]: Resetting Witness Parser preferences to default values [2019-10-22 09:00:18,242 INFO L188 SettingsManager]: Finished resetting all preferences to default values... [2019-10-22 09:00:18,243 INFO L101 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/config/svcomp-Reach-32bit-Automizer_Default.epf [2019-10-22 09:00:18,260 INFO L113 SettingsManager]: Loading preferences was successful [2019-10-22 09:00:18,260 INFO L115 SettingsManager]: Preferences different from defaults after loading the file: [2019-10-22 09:00:18,261 INFO L136 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2019-10-22 09:00:18,261 INFO L138 SettingsManager]: * Create parallel compositions if possible=false [2019-10-22 09:00:18,261 INFO L138 SettingsManager]: * Use SBE=true [2019-10-22 09:00:18,262 INFO L136 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2019-10-22 09:00:18,262 INFO L138 SettingsManager]: * sizeof long=4 [2019-10-22 09:00:18,262 INFO L138 SettingsManager]: * Overapproximate operations on floating types=true [2019-10-22 09:00:18,262 INFO L138 SettingsManager]: * sizeof POINTER=4 [2019-10-22 09:00:18,265 INFO L138 SettingsManager]: * Check division by zero=IGNORE [2019-10-22 09:00:18,265 INFO L138 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2019-10-22 09:00:18,265 INFO L138 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2019-10-22 09:00:18,265 INFO L138 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2019-10-22 09:00:18,265 INFO L138 SettingsManager]: * sizeof long double=12 [2019-10-22 09:00:18,266 INFO L138 SettingsManager]: * Check if freed pointer was valid=false [2019-10-22 09:00:18,266 INFO L138 SettingsManager]: * Use constant arrays=true [2019-10-22 09:00:18,266 INFO L138 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2019-10-22 09:00:18,266 INFO L136 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2019-10-22 09:00:18,266 INFO L138 SettingsManager]: * Size of a code block=SequenceOfStatements [2019-10-22 09:00:18,266 INFO L138 SettingsManager]: * To the following directory=./dump/ [2019-10-22 09:00:18,267 INFO L138 SettingsManager]: * SMT solver=External_DefaultMode [2019-10-22 09:00:18,267 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2019-10-22 09:00:18,267 INFO L136 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2019-10-22 09:00:18,267 INFO L138 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2019-10-22 09:00:18,267 INFO L138 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2019-10-22 09:00:18,268 INFO L138 SettingsManager]: * Trace refinement strategy=CAMEL [2019-10-22 09:00:18,268 INFO L138 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2019-10-22 09:00:18,268 INFO L138 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2019-10-22 09:00:18,268 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 -> /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer 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 -> c69389479aaa51869578ea93cca3b02df528e19e [2019-10-22 09:00:18,299 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2019-10-22 09:00:18,309 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2019-10-22 09:00:18,317 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2019-10-22 09:00:18,323 INFO L271 PluginConnector]: Initializing CDTParser... [2019-10-22 09:00:18,323 INFO L275 PluginConnector]: CDTParser initialized [2019-10-22 09:00:18,324 INFO L428 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/../../sv-benchmarks/c/ldv-sets/test_add-2.i [2019-10-22 09:00:18,374 INFO L220 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/data/94a5d5928/1e9d4ecf97c24e6889240b007590f359/FLAGb239abcde [2019-10-22 09:00:18,818 INFO L306 CDTParser]: Found 1 translation units. [2019-10-22 09:00:18,818 INFO L160 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/sv-benchmarks/c/ldv-sets/test_add-2.i [2019-10-22 09:00:18,832 INFO L349 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/data/94a5d5928/1e9d4ecf97c24e6889240b007590f359/FLAGb239abcde [2019-10-22 09:00:19,350 INFO L357 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/data/94a5d5928/1e9d4ecf97c24e6889240b007590f359 [2019-10-22 09:00:19,353 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2019-10-22 09:00:19,355 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2019-10-22 09:00:19,356 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:19,356 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2019-10-22 09:00:19,360 INFO L275 PluginConnector]: CACSL2BoogieTranslator initialized [2019-10-22 09:00:19,361 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:19,364 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4b7f90e9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19, skipping insertion in model container [2019-10-22 09:00:19,364 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:19,372 INFO L142 MainTranslator]: Starting translation in SV-COMP mode [2019-10-22 09:00:19,422 INFO L173 MainTranslator]: Built tables and reachable declarations [2019-10-22 09:00:19,799 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:19,811 INFO L188 MainTranslator]: Completed pre-run [2019-10-22 09:00:19,883 INFO L206 PostProcessor]: Analyzing one entry point: main [2019-10-22 09:00:19,933 INFO L192 MainTranslator]: Completed translation [2019-10-22 09:00:19,933 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19 WrapperNode [2019-10-22 09:00:19,933 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2019-10-22 09:00:19,934 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:19,934 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2019-10-22 09:00:19,935 INFO L275 PluginConnector]: Boogie Procedure Inliner initialized [2019-10-22 09:00:19,943 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:19,965 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:19,990 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2019-10-22 09:00:19,991 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2019-10-22 09:00:19,991 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2019-10-22 09:00:19,991 INFO L275 PluginConnector]: Boogie Preprocessor initialized [2019-10-22 09:00:20,000 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,001 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,004 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,004 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,016 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,028 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,030 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... [2019-10-22 09:00:20,033 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2019-10-22 09:00:20,033 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2019-10-22 09:00:20,033 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2019-10-22 09:00:20,033 INFO L275 PluginConnector]: RCFGBuilder initialized [2019-10-22 09:00:20,034 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/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 [2019-10-22 09:00:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2019-10-22 09:00:20,090 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2019-10-22 09:00:20,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2019-10-22 09:00:20,091 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2019-10-22 09:00:20,091 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2019-10-22 09:00:20,091 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2019-10-22 09:00:20,092 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2019-10-22 09:00:20,092 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2019-10-22 09:00:20,092 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2019-10-22 09:00:20,488 INFO L279 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2019-10-22 09:00:20,489 INFO L284 CfgBuilder]: Removed 20 assume(true) statements. [2019-10-22 09:00:20,490 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:20 BoogieIcfgContainer [2019-10-22 09:00:20,490 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2019-10-22 09:00:20,493 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2019-10-22 09:00:20,493 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2019-10-22 09:00:20,498 INFO L275 PluginConnector]: TraceAbstraction initialized [2019-10-22 09:00:20,498 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 22.10 09:00:19" (1/3) ... [2019-10-22 09:00:20,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218794fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:20, skipping insertion in model container [2019-10-22 09:00:20,499 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 22.10 09:00:19" (2/3) ... [2019-10-22 09:00:20,499 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@218794fa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 22.10 09:00:20, skipping insertion in model container [2019-10-22 09:00:20,500 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:20" (3/3) ... [2019-10-22 09:00:20,501 INFO L109 eAbstractionObserver]: Analyzing ICFG test_add-2.i [2019-10-22 09:00:20,511 INFO L152 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2019-10-22 09:00:20,518 INFO L164 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2019-10-22 09:00:20,531 INFO L249 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2019-10-22 09:00:20,548 INFO L373 AbstractCegarLoop]: Interprodecural is true [2019-10-22 09:00:20,549 INFO L374 AbstractCegarLoop]: Hoare is true [2019-10-22 09:00:20,549 INFO L375 AbstractCegarLoop]: Compute interpolants for FPandBP [2019-10-22 09:00:20,549 INFO L376 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2019-10-22 09:00:20,549 INFO L377 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2019-10-22 09:00:20,549 INFO L378 AbstractCegarLoop]: Difference is false [2019-10-22 09:00:20,549 INFO L379 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2019-10-22 09:00:20,549 INFO L383 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2019-10-22 09:00:20,560 INFO L276 IsEmpty]: Start isEmpty. Operand 23 states. [2019-10-22 09:00:20,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:00:20,566 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:20,567 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:20,569 INFO L410 AbstractCegarLoop]: === Iteration 1 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:20,574 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:20,574 INFO L82 PathProgramCache]: Analyzing trace with hash -923442845, now seen corresponding path program 1 times [2019-10-22 09:00:20,582 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:20,583 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34317410] [2019-10-22 09:00:20,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:20,583 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:20,583 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:20,662 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:20,699 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:20,700 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34317410] [2019-10-22 09:00:20,700 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:20,701 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2019-10-22 09:00:20,701 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1250656029] [2019-10-22 09:00:20,705 INFO L442 AbstractCegarLoop]: Interpolant automaton has 2 states [2019-10-22 09:00:20,705 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:20,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2019-10-22 09:00:20,723 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:20,726 INFO L87 Difference]: Start difference. First operand 23 states. Second operand 2 states. [2019-10-22 09:00:20,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:20,745 INFO L93 Difference]: Finished difference Result 41 states and 52 transitions. [2019-10-22 09:00:20,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2019-10-22 09:00:20,748 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2019-10-22 09:00:20,749 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:20,759 INFO L225 Difference]: With dead ends: 41 [2019-10-22 09:00:20,759 INFO L226 Difference]: Without dead ends: 19 [2019-10-22 09:00:20,763 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2019-10-22 09:00:20,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19 states. [2019-10-22 09:00:20,799 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19 to 19. [2019-10-22 09:00:20,801 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2019-10-22 09:00:20,801 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 23 transitions. [2019-10-22 09:00:20,806 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 23 transitions. Word has length 12 [2019-10-22 09:00:20,806 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:20,806 INFO L462 AbstractCegarLoop]: Abstraction has 19 states and 23 transitions. [2019-10-22 09:00:20,806 INFO L463 AbstractCegarLoop]: Interpolant automaton has 2 states. [2019-10-22 09:00:20,807 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 23 transitions. [2019-10-22 09:00:20,807 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:00:20,807 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:20,807 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:20,808 INFO L410 AbstractCegarLoop]: === Iteration 2 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:20,808 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:20,808 INFO L82 PathProgramCache]: Analyzing trace with hash 1228046979, now seen corresponding path program 1 times [2019-10-22 09:00:20,808 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:20,808 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1005264129] [2019-10-22 09:00:20,808 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:20,809 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:20,809 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:20,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:20,903 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:20,903 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1005264129] [2019-10-22 09:00:20,904 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:20,904 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:20,904 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1558898567] [2019-10-22 09:00:20,905 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:00:20,906 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:20,906 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:20,906 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:20,909 INFO L87 Difference]: Start difference. First operand 19 states and 23 transitions. Second operand 4 states. [2019-10-22 09:00:21,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:21,002 INFO L93 Difference]: Finished difference Result 37 states and 42 transitions. [2019-10-22 09:00:21,004 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:21,004 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 09:00:21,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:21,004 INFO L225 Difference]: With dead ends: 37 [2019-10-22 09:00:21,005 INFO L226 Difference]: Without dead ends: 28 [2019-10-22 09:00:21,006 INFO L600 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 [2019-10-22 09:00:21,006 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2019-10-22 09:00:21,009 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 21. [2019-10-22 09:00:21,009 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2019-10-22 09:00:21,010 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 25 transitions. [2019-10-22 09:00:21,010 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 25 transitions. Word has length 12 [2019-10-22 09:00:21,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:21,010 INFO L462 AbstractCegarLoop]: Abstraction has 21 states and 25 transitions. [2019-10-22 09:00:21,011 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:00:21,011 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 25 transitions. [2019-10-22 09:00:21,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2019-10-22 09:00:21,011 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:21,011 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,012 INFO L410 AbstractCegarLoop]: === Iteration 3 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:21,012 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,012 INFO L82 PathProgramCache]: Analyzing trace with hash -1885213511, now seen corresponding path program 1 times [2019-10-22 09:00:21,012 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,012 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [164686174] [2019-10-22 09:00:21,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,013 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,013 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,043 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,209 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:21,209 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [164686174] [2019-10-22 09:00:21,210 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:21,210 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2019-10-22 09:00:21,210 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2021140262] [2019-10-22 09:00:21,210 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:00:21,211 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:21,211 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:21,211 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:21,211 INFO L87 Difference]: Start difference. First operand 21 states and 25 transitions. Second operand 4 states. [2019-10-22 09:00:21,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:21,347 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2019-10-22 09:00:21,349 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2019-10-22 09:00:21,349 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2019-10-22 09:00:21,349 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:21,349 INFO L225 Difference]: With dead ends: 36 [2019-10-22 09:00:21,350 INFO L226 Difference]: Without dead ends: 17 [2019-10-22 09:00:21,350 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2019-10-22 09:00:21,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2019-10-22 09:00:21,353 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 17. [2019-10-22 09:00:21,353 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2019-10-22 09:00:21,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 18 transitions. [2019-10-22 09:00:21,354 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 18 transitions. Word has length 12 [2019-10-22 09:00:21,356 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:21,357 INFO L462 AbstractCegarLoop]: Abstraction has 17 states and 18 transitions. [2019-10-22 09:00:21,357 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:00:21,357 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 18 transitions. [2019-10-22 09:00:21,357 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:00:21,358 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:21,358 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,358 INFO L410 AbstractCegarLoop]: === Iteration 4 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:21,358 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,358 INFO L82 PathProgramCache]: Analyzing trace with hash 2054053118, now seen corresponding path program 1 times [2019-10-22 09:00:21,359 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,359 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2040074507] [2019-10-22 09:00:21,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,359 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,359 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,547 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:21,547 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2040074507] [2019-10-22 09:00:21,547 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:21,548 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2019-10-22 09:00:21,548 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1261003463] [2019-10-22 09:00:21,548 INFO L442 AbstractCegarLoop]: Interpolant automaton has 7 states [2019-10-22 09:00:21,548 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:21,549 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2019-10-22 09:00:21,549 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2019-10-22 09:00:21,549 INFO L87 Difference]: Start difference. First operand 17 states and 18 transitions. Second operand 7 states. [2019-10-22 09:00:21,667 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:21,667 INFO L93 Difference]: Finished difference Result 29 states and 30 transitions. [2019-10-22 09:00:21,668 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2019-10-22 09:00:21,668 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 14 [2019-10-22 09:00:21,668 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:21,668 INFO L225 Difference]: With dead ends: 29 [2019-10-22 09:00:21,669 INFO L226 Difference]: Without dead ends: 24 [2019-10-22 09:00:21,669 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:21,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2019-10-22 09:00:21,673 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 18. [2019-10-22 09:00:21,673 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:00:21,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 19 transitions. [2019-10-22 09:00:21,674 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 19 transitions. Word has length 14 [2019-10-22 09:00:21,674 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:21,674 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 19 transitions. [2019-10-22 09:00:21,674 INFO L463 AbstractCegarLoop]: Interpolant automaton has 7 states. [2019-10-22 09:00:21,674 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 19 transitions. [2019-10-22 09:00:21,675 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2019-10-22 09:00:21,675 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:21,675 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,675 INFO L410 AbstractCegarLoop]: === Iteration 5 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:21,676 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,676 INFO L82 PathProgramCache]: Analyzing trace with hash 2055661832, now seen corresponding path program 1 times [2019-10-22 09:00:21,676 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,676 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1188875730] [2019-10-22 09:00:21,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,676 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,677 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,692 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:21,718 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:21,718 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1188875730] [2019-10-22 09:00:21,718 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:21,718 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2019-10-22 09:00:21,719 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2113464779] [2019-10-22 09:00:21,719 INFO L442 AbstractCegarLoop]: Interpolant automaton has 4 states [2019-10-22 09:00:21,719 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:21,719 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2019-10-22 09:00:21,720 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2019-10-22 09:00:21,720 INFO L87 Difference]: Start difference. First operand 18 states and 19 transitions. Second operand 4 states. [2019-10-22 09:00:21,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:21,742 INFO L93 Difference]: Finished difference Result 22 states and 22 transitions. [2019-10-22 09:00:21,742 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2019-10-22 09:00:21,742 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2019-10-22 09:00:21,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:21,743 INFO L225 Difference]: With dead ends: 22 [2019-10-22 09:00:21,743 INFO L226 Difference]: Without dead ends: 18 [2019-10-22 09:00:21,744 INFO L600 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 [2019-10-22 09:00:21,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2019-10-22 09:00:21,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2019-10-22 09:00:21,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2019-10-22 09:00:21,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2019-10-22 09:00:21,748 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2019-10-22 09:00:21,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:21,748 INFO L462 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2019-10-22 09:00:21,748 INFO L463 AbstractCegarLoop]: Interpolant automaton has 4 states. [2019-10-22 09:00:21,748 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2019-10-22 09:00:21,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2019-10-22 09:00:21,749 INFO L372 BasicCegarLoop]: Found error trace [2019-10-22 09:00:21,749 INFO L380 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2019-10-22 09:00:21,749 INFO L410 AbstractCegarLoop]: === Iteration 6 === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2019-10-22 09:00:21,749 INFO L144 PredicateUnifier]: Initialized classic predicate unifier [2019-10-22 09:00:21,750 INFO L82 PathProgramCache]: Analyzing trace with hash -130550515, now seen corresponding path program 1 times [2019-10-22 09:00:21,750 INFO L157 tionRefinementEngine]: Executing refinement strategy CAMEL [2019-10-22 09:00:21,750 INFO L342 tionRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [641352615] [2019-10-22 09:00:21,750 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,751 INFO L116 rtionOrderModulation]: Craig_NestedInterpolation forces the order to NOT_INCREMENTALLY [2019-10-22 09:00:21,751 INFO L94 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2019-10-22 09:00:21,833 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2019-10-22 09:00:22,101 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2019-10-22 09:00:22,101 INFO L342 tionRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [641352615] [2019-10-22 09:00:22,101 INFO L223 tionRefinementEngine]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2019-10-22 09:00:22,102 INFO L236 tionRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2019-10-22 09:00:22,102 INFO L342 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2096117716] [2019-10-22 09:00:22,102 INFO L442 AbstractCegarLoop]: Interpolant automaton has 10 states [2019-10-22 09:00:22,102 INFO L137 tionRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2019-10-22 09:00:22,103 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2019-10-22 09:00:22,103 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=68, Unknown=0, NotChecked=0, Total=90 [2019-10-22 09:00:22,103 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 10 states. [2019-10-22 09:00:22,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2019-10-22 09:00:22,273 INFO L93 Difference]: Finished difference Result 19 states and 19 transitions. [2019-10-22 09:00:22,273 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2019-10-22 09:00:22,273 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 17 [2019-10-22 09:00:22,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2019-10-22 09:00:22,274 INFO L225 Difference]: With dead ends: 19 [2019-10-22 09:00:22,274 INFO L226 Difference]: Without dead ends: 0 [2019-10-22 09:00:22,275 INFO L600 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=44, Invalid=138, Unknown=0, NotChecked=0, Total=182 [2019-10-22 09:00:22,275 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2019-10-22 09:00:22,275 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2019-10-22 09:00:22,276 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2019-10-22 09:00:22,276 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2019-10-22 09:00:22,276 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 17 [2019-10-22 09:00:22,276 INFO L84 Accepts]: Finished accepts. word is rejected. [2019-10-22 09:00:22,276 INFO L462 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2019-10-22 09:00:22,277 INFO L463 AbstractCegarLoop]: Interpolant automaton has 10 states. [2019-10-22 09:00:22,277 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2019-10-22 09:00:22,277 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2019-10-22 09:00:22,282 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2019-10-22 09:00:22,477 INFO L443 ceAbstractionStarter]: For program point L576(lines 576 584) no Hoare annotation was computed. [2019-10-22 09:00:22,478 INFO L446 ceAbstractionStarter]: At program point L659(lines 656 660) the Hoare annotation is: true [2019-10-22 09:00:22,478 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION(line 654) no Hoare annotation was computed. [2019-10-22 09:00:22,478 INFO L443 ceAbstractionStarter]: For program point L-1(line -1) no Hoare annotation was computed. [2019-10-22 09:00:22,478 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startENTRY(line -1) no Hoare annotation was computed. [2019-10-22 09:00:22,478 INFO L443 ceAbstractionStarter]: For program point L639-2(lines 639 643) no Hoare annotation was computed. [2019-10-22 09:00:22,479 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2019-10-22 09:00:22,479 INFO L439 ceAbstractionStarter]: At program point L639-3(lines 639 643) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (<= |~#s1~0.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= 1 (select |#valid| |~#s1~0.base|)))) [2019-10-22 09:00:22,479 INFO L443 ceAbstractionStarter]: For program point L639-4(lines 639 643) no Hoare annotation was computed. [2019-10-22 09:00:22,479 INFO L443 ceAbstractionStarter]: For program point L639-7(lines 639 643) no Hoare annotation was computed. [2019-10-22 09:00:22,480 INFO L439 ceAbstractionStarter]: At program point L639-8(lines 639 643) the Hoare annotation is: (let ((.cse2 (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|)) (.cse1 (+ |~#s1~0.offset| 4)) (.cse0 (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (not (= |~#s1~0.base| .cse0)) (not (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base)) (= ULTIMATE.start_ldv_is_in_set_~e (select (select |#memory_int| ULTIMATE.start_ldv_is_in_set_~m~1.base) ULTIMATE.start_ldv_is_in_set_~m~1.offset)) (<= .cse1 .cse2) (<= .cse2 .cse1) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= 1 (select |#valid| |~#s1~0.base|)) (= (select (select |#memory_int| .cse0) |~#s1~0.offset|) ULTIMATE.start_foo_~j~0))) [2019-10-22 09:00:22,480 INFO L443 ceAbstractionStarter]: For program point L639-9(lines 639 643) no Hoare annotation was computed. [2019-10-22 09:00:22,480 INFO L439 ceAbstractionStarter]: At program point L565(lines 562 566) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= 0 |ULTIMATE.start_ldv_is_in_set_#res|) (<= |~#s1~0.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= 0 |ULTIMATE.start_ldv_successful_malloc_#res.offset|) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= 1 (select |#valid| |~#s1~0.base|)))) [2019-10-22 09:00:22,480 INFO L443 ceAbstractionStarter]: For program point L619(lines 619 626) no Hoare annotation was computed. [2019-10-22 09:00:22,481 INFO L439 ceAbstractionStarter]: At program point L644(lines 637 645) the Hoare annotation is: (let ((.cse0 (+ ULTIMATE.start_ldv_is_in_set_~m~1.offset 4))) (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= ULTIMATE.start_ldv_is_in_set_~m~1.base ULTIMATE.start_ldv_is_in_set_~s.base) (= |~#s1~0.base| ULTIMATE.start_ldv_is_in_set_~s.base) (= (select (select |#memory_$Pointer$.offset| |~#s1~0.base|) |~#s1~0.offset|) |~#s1~0.offset|) (<= (+ |~#s1~0.base| 1) |#StackHeapBarrier|) (<= |~#s1~0.offset| .cse0) (= 0 |ULTIMATE.start_ldv_is_in_set_#res|) (<= |~#s1~0.offset| 0) (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_is_in_set_~s.offset) (<= .cse0 |~#s1~0.offset|) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (<= 0 |~#s1~0.offset|) (= ULTIMATE.start_ldv_set_add_~new ULTIMATE.start_foo_~j~0) (= 1 (select |#valid| |~#s1~0.base|)))) [2019-10-22 09:00:22,481 INFO L439 ceAbstractionStarter]: At program point L644-1(lines 637 645) the Hoare annotation is: (and (= |~#s1~0.base| ULTIMATE.start_ldv_set_add_~s.base) (= 1 |ULTIMATE.start_ldv_is_in_set_#res|) (not (= |~#s1~0.base| (select (select |#memory_$Pointer$.base| |~#s1~0.base|) |~#s1~0.offset|))) (not (= |~#s1~0.base| |ULTIMATE.start_ldv_successful_malloc_#res.base|)) (= |~#s1~0.offset| ULTIMATE.start_ldv_set_add_~s.offset) (= 1 (select |#valid| |~#s1~0.base|))) [2019-10-22 09:00:22,481 INFO L443 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2019-10-22 09:00:22,481 INFO L443 ceAbstractionStarter]: For program point L640(lines 640 642) no Hoare annotation was computed. [2019-10-22 09:00:22,481 INFO L443 ceAbstractionStarter]: For program point L640-1(lines 640 642) no Hoare annotation was computed. [2019-10-22 09:00:22,481 INFO L443 ceAbstractionStarter]: For program point L620(lines 620 625) no Hoare annotation was computed. [2019-10-22 09:00:22,481 INFO L443 ceAbstractionStarter]: For program point L654(line 654) no Hoare annotation was computed. [2019-10-22 09:00:22,482 INFO L443 ceAbstractionStarter]: For program point L654-1(line 654) no Hoare annotation was computed. [2019-10-22 09:00:22,482 INFO L443 ceAbstractionStarter]: For program point L650(lines 650 655) no Hoare annotation was computed. [2019-10-22 09:00:22,495 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,497 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,500 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,502 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,505 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,507 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,509 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,511 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,512 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,513 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,514 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,514 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,515 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,516 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,517 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,518 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,523 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,524 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,525 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,526 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,531 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,532 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,533 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,533 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,534 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,535 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,535 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,536 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,537 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,538 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,539 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,539 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,540 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,541 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,541 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,542 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,543 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,543 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,544 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,545 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,548 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 22.10 09:00:22 BoogieIcfgContainer [2019-10-22 09:00:22,548 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2019-10-22 09:00:22,548 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2019-10-22 09:00:22,548 INFO L271 PluginConnector]: Initializing Witness Printer... [2019-10-22 09:00:22,549 INFO L275 PluginConnector]: Witness Printer initialized [2019-10-22 09:00:22,549 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 22.10 09:00:20" (3/4) ... [2019-10-22 09:00:22,554 INFO L137 WitnessPrinter]: Generating witness for correct program [2019-10-22 09:00:22,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 11 nodes and edges [2019-10-22 09:00:22,567 INFO L902 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2019-10-22 09:00:22,600 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && new == j) && 1 == \valid[s1] [2019-10-22 09:00:22,601 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: (((((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && !(s1 == \result)) && s1 == s) && 0 <= s1) && 0 == \result) && new == j) && 1 == \valid[s1] [2019-10-22 09:00:22,602 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((((((s1 == s && !(s1 == #memory_$Pointer$[s1][s1])) && !(m == s)) && e == unknown-#memory_int-unknown[m][m]) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1]) && unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1] == j [2019-10-22 09:00:22,603 WARN L221 nessWitnessGenerator]: Not writing invariant because ACSL is forbidden: ((((s1 == s && 1 == \result) && !(s1 == #memory_$Pointer$[s1][s1])) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1] [2019-10-22 09:00:22,638 INFO L141 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_d74115c2-9d47-4665-a1c3-02a3dafa0baf/bin/uautomizer/witness.graphml [2019-10-22 09:00:22,638 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2019-10-22 09:00:22,643 INFO L168 Benchmark]: Toolchain (without parser) took 3284.90 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.1 MB in the beginning and 907.5 MB in the end (delta: 31.6 MB). Peak memory consumption was 175.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,644 INFO L168 Benchmark]: CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2019-10-22 09:00:22,644 INFO L168 Benchmark]: CACSL2BoogieTranslator took 577.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,644 INFO L168 Benchmark]: Boogie Procedure Inliner took 56.17 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,645 INFO L168 Benchmark]: Boogie Preprocessor took 42.23 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,645 INFO L168 Benchmark]: RCFGBuilder took 459.02 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,645 INFO L168 Benchmark]: TraceAbstraction took 2055.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 180.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,646 INFO L168 Benchmark]: Witness Printer took 89.98 ms. Allocated memory is still 1.2 GB. Free memory was 911.5 MB in the beginning and 907.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. [2019-10-22 09:00:22,648 INFO L335 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.15 ms. Allocated memory is still 1.0 GB. Free memory is still 964.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 577.46 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 143.7 MB). Free memory was 939.1 MB in the beginning and 1.1 GB in the end (delta: -185.6 MB). Peak memory consumption was 22.1 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 56.17 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: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 42.23 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: 1.3 MB). Peak memory consumption was 1.3 MB. Max. memory is 11.5 GB. * RCFGBuilder took 459.02 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: 27.9 MB). Peak memory consumption was 27.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 2055.04 ms. Allocated memory is still 1.2 GB. Free memory was 1.1 GB in the beginning and 911.5 MB in the end (delta: 180.0 MB). Peak memory consumption was 180.0 MB. Max. memory is 11.5 GB. * Witness Printer took 89.98 ms. Allocated memory is still 1.2 GB. Free memory was 911.5 MB in the beginning and 907.5 MB in the end (delta: 4.0 MB). Peak memory consumption was 4.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.boogie.preprocessor: - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset - GenericResult: Unfinished Backtranslation Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ - GenericResult: Unfinished Backtranslation unknown boogie variable #StackHeapBarrier - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_$Pointer$ * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 654]: 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: 637]: Loop Invariant [2019-10-22 09:00:22,656 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,657 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,658 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,659 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,659 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,660 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,660 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,661 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && new == j) && 1 == \valid[s1] - InvariantResult [Line: 637]: Loop Invariant [2019-10-22 09:00:22,661 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,662 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,662 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,663 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((s1 == s && 1 == \result) && !(s1 == #memory_$Pointer$[s1][s1])) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1] - InvariantResult [Line: 656]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 639]: Loop Invariant [2019-10-22 09:00:22,663 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,664 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,665 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,666 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,667 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,668 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_int [2019-10-22 09:00:22,669 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((s1 == s && !(s1 == #memory_$Pointer$[s1][s1])) && !(m == s)) && e == unknown-#memory_int-unknown[m][m]) && s1 + 4 <= #memory_$Pointer$[s1][s1]) && #memory_$Pointer$[s1][s1] <= s1 + 4) && !(s1 == \result)) && s1 == s) && 1 == \valid[s1]) && unknown-#memory_int-unknown[#memory_$Pointer$[s1][s1]][s1] == j - InvariantResult [Line: 639]: Loop Invariant [2019-10-22 09:00:22,669 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,670 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,671 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,674 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,675 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,675 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,676 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: ((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && s1 == s) && 0 <= s1) && new == j) && 1 == \valid[s1] - InvariantResult [Line: 562]: Loop Invariant [2019-10-22 09:00:22,676 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,677 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,677 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,678 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.offset [2019-10-22 09:00:22,679 WARN L417 cessorBacktranslator]: Unfinished backtranslation: Name guessing unsuccessful for VarDecl var #memory_$Pointer$ : [$Pointer$]$Pointer$; and expression #memory_$Pointer$.base [2019-10-22 09:00:22,679 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ [2019-10-22 09:00:22,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #StackHeapBarrier [2019-10-22 09:00:22,680 WARN L1295 BoogieBacktranslator]: unknown boogie variable #memory_$Pointer$ Derived loop invariant: (((((((((((((((s1 == s && m == s) && s1 == s) && #memory_$Pointer$[s1][s1] == s1) && s1 + 1 <= unknown-#StackHeapBarrier-unknown) && s1 <= m + 4) && 0 == \result) && s1 <= 0) && s1 == #memory_$Pointer$[s1][s1]) && s1 == s) && m + 4 <= s1) && !(s1 == \result)) && s1 == s) && 0 <= s1) && 0 == \result) && new == j) && 1 == \valid[s1] - StatisticsResult: Ultimate Automizer benchmark data CFG has 1 procedures, 23 locations, 1 error locations. Result: SAFE, OverallTime: 1.9s, OverallIterations: 6, TraceHistogramMax: 1, AutomataDifference: 0.6s, DeadEndRemovalTime: 0.0s, HoareAnnotationTime: 0.1s, HoareTripleCheckerStatistics: 95 SDtfs, 107 SDslu, 107 SDs, 0 SdLazy, 89 SolverSat, 12 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 38 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 26 ImplicationChecksByTransitivity, 0.5s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=23occurred 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.0s AutomataMinimizationTime, 6 MinimizatonAttempts, 13 StatesRemovedByMinimization, 2 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 6 LocationsWithAnnotation, 6 PreInvPairs, 12 NumberOfFragments, 282 HoareAnnotationTreeSize, 6 FomulaSimplifications, 29 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 6 FomulaSimplificationsInter, 0 FormulaSimplificationTreeSizeReductionInter, 0.1s HoareSimplificationTimeInter, RefinementEngineStatistics: TRACE_CHECK: 0.0s SsaConstructionTime, 0.2s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 81 NumberOfCodeBlocks, 81 NumberOfCodeBlocksAsserted, 6 NumberOfCheckSat, 75 ConstructedInterpolants, 0 QuantifiedInterpolants, 6023 SizeOfPredicates, 0 NumberOfNonLiveVariables, 0 ConjunctsInSsa, 0 ConjunctsInUnsatCore, 6 InterpolantComputations, 6 PerfectInterpolantSequences, 1/1 InterpolantCoveringCapability, INVARIANT_SYNTHESIS: No data available, INTERPOLANT_CONSOLIDATION: No data available, ABSTRACT_INTERPRETATION: No data available, PDR: No data available, SIFA: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...