./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 1dbac8bc Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan --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 Taipan --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash b4fbc36a28ccee76a98a185e0c5cc58738af3c30 .................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-1dbac8b [2018-11-10 06:34:04,263 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 06:34:04,264 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 06:34:04,271 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 06:34:04,271 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 06:34:04,272 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 06:34:04,273 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 06:34:04,274 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 06:34:04,275 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 06:34:04,276 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 06:34:04,276 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 06:34:04,276 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 06:34:04,277 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 06:34:04,278 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 06:34:04,279 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 06:34:04,279 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 06:34:04,280 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 06:34:04,281 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 06:34:04,282 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 06:34:04,283 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 06:34:04,284 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 06:34:04,285 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 06:34:04,287 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 06:34:04,287 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 06:34:04,287 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 06:34:04,288 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 06:34:04,289 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 06:34:04,289 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 06:34:04,290 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 06:34:04,291 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 06:34:04,291 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 06:34:04,291 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 06:34:04,291 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 06:34:04,292 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 06:34:04,292 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 06:34:04,293 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 06:34:04,293 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 06:34:04,304 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 06:34:04,304 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 06:34:04,305 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 06:34:04,305 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 06:34:04,305 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 06:34:04,305 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 06:34:04,305 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 06:34:04,305 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 06:34:04,305 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 06:34:04,306 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 06:34:04,306 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 06:34:04,306 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 06:34:04,306 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 06:34:04,307 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 06:34:04,308 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 06:34:04,308 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 06:34:04,308 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 06:34:04,308 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 06:34:04,308 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 06:34:04,308 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 06:34:04,308 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 06:34:04,309 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 06:34:04,309 INFO L133 SettingsManager]: * Abstract interpretation Mode=USE_PREDICATES 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_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan 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 -> Taipan 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 -> b4fbc36a28ccee76a98a185e0c5cc58738af3c30 [2018-11-10 06:34:04,333 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 06:34:04,342 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 06:34:04,344 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 06:34:04,346 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 06:34:04,346 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 06:34:04,347 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/../../sv-benchmarks/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i [2018-11-10 06:34:04,393 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/data/65b566626/44dd7ef0d89e43e981390aa69f6b4585/FLAGd2dc90edf [2018-11-10 06:34:04,715 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 06:34:04,716 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/sv-benchmarks/c/array-examples/standard_sentinel_true-unreach-call_true-termination.i [2018-11-10 06:34:04,721 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/data/65b566626/44dd7ef0d89e43e981390aa69f6b4585/FLAGd2dc90edf [2018-11-10 06:34:04,733 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/data/65b566626/44dd7ef0d89e43e981390aa69f6b4585 [2018-11-10 06:34:04,735 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 06:34:04,736 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 06:34:04,737 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 06:34:04,737 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 06:34:04,740 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 06:34:04,741 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,743 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@305850f2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04, skipping insertion in model container [2018-11-10 06:34:04,743 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,751 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 06:34:04,767 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 06:34:04,875 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:34:04,877 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 06:34:04,889 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 06:34:04,901 INFO L193 MainTranslator]: Completed translation [2018-11-10 06:34:04,901 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04 WrapperNode [2018-11-10 06:34:04,901 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 06:34:04,902 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 06:34:04,902 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 06:34:04,902 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 06:34:04,907 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,912 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,924 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 06:34:04,924 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 06:34:04,924 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 06:34:04,924 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 06:34:04,930 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,930 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,931 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,931 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,933 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,936 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,936 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... [2018-11-10 06:34:04,937 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 06:34:04,938 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 06:34:04,938 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 06:34:04,938 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 06:34:04,938 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/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 [2018-11-10 06:34:05,009 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 06:34:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 06:34:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 06:34:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 06:34:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 06:34:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 06:34:05,010 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-11-10 06:34:05,010 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-11-10 06:34:05,125 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 06:34:05,125 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:34:05 BoogieIcfgContainer [2018-11-10 06:34:05,125 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 06:34:05,126 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 06:34:05,126 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 06:34:05,128 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 06:34:05,128 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 06:34:04" (1/3) ... [2018-11-10 06:34:05,128 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6c3ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:05, skipping insertion in model container [2018-11-10 06:34:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 06:34:04" (2/3) ... [2018-11-10 06:34:05,129 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7c6c3ee4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 06:34:05, skipping insertion in model container [2018-11-10 06:34:05,129 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:34:05" (3/3) ... [2018-11-10 06:34:05,130 INFO L112 eAbstractionObserver]: Analyzing ICFG standard_sentinel_true-unreach-call_true-termination.i [2018-11-10 06:34:05,138 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 06:34:05,143 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-11-10 06:34:05,152 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-11-10 06:34:05,172 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 06:34:05,172 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 06:34:05,172 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 06:34:05,172 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 06:34:05,172 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 06:34:05,173 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 06:34:05,173 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 06:34:05,173 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 06:34:05,185 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states. [2018-11-10 06:34:05,189 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-10 06:34:05,189 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:34:05,190 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:34:05,191 INFO L424 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:34:05,195 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:34:05,196 INFO L82 PathProgramCache]: Analyzing trace with hash -136856004, now seen corresponding path program 1 times [2018-11-10 06:34:05,197 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:34:05,229 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:05,230 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:34:05,230 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:05,230 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:34:05,264 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:34:05,298 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:05,299 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:34:05,300 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-10 06:34:05,300 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:34:05,303 INFO L460 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-11-10 06:34:05,312 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-11-10 06:34:05,313 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-11-10 06:34:05,314 INFO L87 Difference]: Start difference. First operand 22 states. Second operand 2 states. [2018-11-10 06:34:05,327 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:34:05,327 INFO L93 Difference]: Finished difference Result 34 states and 38 transitions. [2018-11-10 06:34:05,327 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-11-10 06:34:05,328 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 12 [2018-11-10 06:34:05,329 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:34:05,336 INFO L225 Difference]: With dead ends: 34 [2018-11-10 06:34:05,336 INFO L226 Difference]: Without dead ends: 15 [2018-11-10 06:34:05,339 INFO L605 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 [2018-11-10 06:34:05,354 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-10 06:34:05,365 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-10 06:34:05,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-10 06:34:05,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-10 06:34:05,368 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 12 [2018-11-10 06:34:05,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:34:05,368 INFO L481 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-10 06:34:05,368 INFO L482 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-11-10 06:34:05,368 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-10 06:34:05,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 06:34:05,368 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:34:05,369 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:34:05,369 INFO L424 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:34:05,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:34:05,369 INFO L82 PathProgramCache]: Analyzing trace with hash 1358164726, now seen corresponding path program 1 times [2018-11-10 06:34:05,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:34:05,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:05,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:34:05,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:05,371 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:34:05,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:34:05,468 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:05,468 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 06:34:05,468 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 06:34:05,468 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 06:34:05,469 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 06:34:05,469 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 06:34:05,470 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-11-10 06:34:05,470 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 5 states. [2018-11-10 06:34:05,515 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:34:05,515 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-10 06:34:05,515 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 06:34:05,515 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 14 [2018-11-10 06:34:05,516 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:34:05,516 INFO L225 Difference]: With dead ends: 23 [2018-11-10 06:34:05,516 INFO L226 Difference]: Without dead ends: 18 [2018-11-10 06:34:05,516 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 06:34:05,517 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-10 06:34:05,518 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2018-11-10 06:34:05,518 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18 states. [2018-11-10 06:34:05,519 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 18 transitions. [2018-11-10 06:34:05,519 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 18 transitions. Word has length 14 [2018-11-10 06:34:05,519 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:34:05,519 INFO L481 AbstractCegarLoop]: Abstraction has 18 states and 18 transitions. [2018-11-10 06:34:05,519 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 06:34:05,519 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 18 transitions. [2018-11-10 06:34:05,519 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-10 06:34:05,519 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:34:05,519 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:34:05,520 INFO L424 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:34:05,520 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:34:05,520 INFO L82 PathProgramCache]: Analyzing trace with hash -1389199971, now seen corresponding path program 1 times [2018-11-10 06:34:05,520 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:34:05,520 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:05,520 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:34:05,521 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:05,521 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:34:05,534 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:34:05,792 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:05,792 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:34:05,792 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:34:05,793 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-11-10 06:34:05,794 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [12], [14], [17], [19], [29], [32], [34], [40], [41], [42], [44] [2018-11-10 06:34:05,828 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 06:34:05,829 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 06:34:07,261 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 06:34:07,262 INFO L272 AbstractInterpreter]: Visited 15 different actions 446 times. Merged at 4 different actions 216 times. Widened at 1 different actions 50 times. Found 1 fixpoints after 1 different actions. Largest state had 32 variables. [2018-11-10 06:34:07,267 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:34:07,268 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 06:34:07,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:34:07,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:34:07,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:34:07,274 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 06:34:07,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:34:07,307 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:34:07,339 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 06:34:07,347 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:34:07,348 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:34:07,350 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:07,364 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:07,364 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 06:34:07,389 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 19 [2018-11-10 06:34:07,395 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 16 [2018-11-10 06:34:07,396 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 06:34:07,398 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:34:07,403 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: 1 dim-0 vars, and 2 xjuncts. [2018-11-10 06:34:07,404 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 3 variables, input treesize:29, output treesize:30 [2018-11-10 06:34:07,497 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:07,497 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:34:07,573 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:07,591 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:34:07,591 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 7, 7] total 16 [2018-11-10 06:34:07,591 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:34:07,592 INFO L460 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-10 06:34:07,592 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-10 06:34:07,592 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2018-11-10 06:34:07,592 INFO L87 Difference]: Start difference. First operand 18 states and 18 transitions. Second operand 12 states. [2018-11-10 06:34:07,723 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:34:07,723 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-10 06:34:07,723 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 06:34:07,723 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 17 [2018-11-10 06:34:07,724 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:34:07,724 INFO L225 Difference]: With dead ends: 26 [2018-11-10 06:34:07,724 INFO L226 Difference]: Without dead ends: 21 [2018-11-10 06:34:07,725 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 45 GetRequests, 27 SyntacticMatches, 1 SemanticMatches, 17 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 80 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=76, Invalid=266, Unknown=0, NotChecked=0, Total=342 [2018-11-10 06:34:07,725 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-11-10 06:34:07,727 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-11-10 06:34:07,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-10 06:34:07,727 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-10 06:34:07,727 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 17 [2018-11-10 06:34:07,727 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:34:07,727 INFO L481 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-10 06:34:07,728 INFO L482 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-10 06:34:07,728 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-10 06:34:07,728 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 06:34:07,728 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:34:07,728 INFO L375 BasicCegarLoop]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:34:07,728 INFO L424 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:34:07,728 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:34:07,729 INFO L82 PathProgramCache]: Analyzing trace with hash 1060871574, now seen corresponding path program 2 times [2018-11-10 06:34:07,729 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:34:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:07,729 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 06:34:07,729 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:07,730 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:34:07,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:34:07,999 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:07,999 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:34:07,999 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:34:08,000 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:34:08,000 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:34:08,000 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:34:08,000 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:34:08,010 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-10 06:34:08,010 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-10 06:34:08,025 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-10 06:34:08,025 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:34:08,028 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:34:08,035 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 06:34:08,036 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:34:08,036 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,038 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,042 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,042 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:22, output treesize:18 [2018-11-10 06:34:08,082 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 25 [2018-11-10 06:34:08,094 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 25 treesize of output 41 [2018-11-10 06:34:08,095 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 3 xjuncts. [2018-11-10 06:34:08,106 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:34:08,117 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-0 vars, 1 dim-2 vars, End of recursive call: 2 dim-0 vars, and 2 xjuncts. [2018-11-10 06:34:08,117 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 2 variables, input treesize:37, output treesize:58 [2018-11-10 06:34:08,172 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:08,173 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:34:08,269 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:34:08,270 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,270 INFO L267 ElimStorePlain]: Start of recursive call 1: 2 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,271 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 3 variables, input treesize:43, output treesize:1 [2018-11-10 06:34:08,274 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:08,290 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:34:08,290 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2018-11-10 06:34:08,290 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:34:08,291 INFO L460 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-10 06:34:08,291 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-10 06:34:08,291 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=384, Unknown=0, NotChecked=0, Total=462 [2018-11-10 06:34:08,291 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 16 states. [2018-11-10 06:34:08,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:34:08,531 INFO L93 Difference]: Finished difference Result 33 states and 34 transitions. [2018-11-10 06:34:08,531 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-10 06:34:08,531 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 20 [2018-11-10 06:34:08,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:34:08,532 INFO L225 Difference]: With dead ends: 33 [2018-11-10 06:34:08,532 INFO L226 Difference]: Without dead ends: 27 [2018-11-10 06:34:08,532 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 56 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 188 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=143, Invalid=613, Unknown=0, NotChecked=0, Total=756 [2018-11-10 06:34:08,532 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-10 06:34:08,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 27. [2018-11-10 06:34:08,535 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 27 states. [2018-11-10 06:34:08,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 27 transitions. [2018-11-10 06:34:08,536 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 27 transitions. Word has length 20 [2018-11-10 06:34:08,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:34:08,536 INFO L481 AbstractCegarLoop]: Abstraction has 27 states and 27 transitions. [2018-11-10 06:34:08,537 INFO L482 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-10 06:34:08,537 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 27 transitions. [2018-11-10 06:34:08,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2018-11-10 06:34:08,537 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 06:34:08,537 INFO L375 BasicCegarLoop]: trace histogram [5, 5, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 06:34:08,538 INFO L424 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 06:34:08,538 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 06:34:08,538 INFO L82 PathProgramCache]: Analyzing trace with hash 260100150, now seen corresponding path program 3 times [2018-11-10 06:34:08,538 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 06:34:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:08,539 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-10 06:34:08,539 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 06:34:08,539 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 06:34:08,555 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 06:34:08,934 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 3 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:08,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:34:08,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 06:34:08,934 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-10 06:34:08,934 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-10 06:34:08,934 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 06:34:08,934 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-10 06:34:08,939 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-10 06:34:08,940 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-10 06:34:08,955 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-10 06:34:08,955 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-10 06:34:08,958 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 06:34:08,962 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 12 [2018-11-10 06:34:08,965 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 12 treesize of output 11 [2018-11-10 06:34:08,965 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,966 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,976 INFO L267 ElimStorePlain]: Start of recursive call 1: 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:08,976 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 1 variables, input treesize:25, output treesize:21 [2018-11-10 06:34:09,138 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 37 [2018-11-10 06:34:09,202 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 6 disjoint index pairs (out of 10 index pairs), introduced 3 new quantified variables, introduced 7 case distinctions, treesize of input 37 treesize of output 113 [2018-11-10 06:34:09,203 WARN L138 XnfTransformerHelper]: expecting exponential blowup for input size 7 [2018-11-10 06:34:09,232 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 72 xjuncts. [2018-11-10 06:34:09,489 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:34:09,513 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 1 dim-2 vars, End of recursive call: and 2 xjuncts. [2018-11-10 06:34:09,514 INFO L202 ElimStorePlain]: Needed 3 recursive calls to eliminate 4 variables, input treesize:63, output treesize:239 [2018-11-10 06:34:09,616 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:09,617 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 06:34:09,806 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 06:34:09,807 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-11-10 06:34:09,807 INFO L267 ElimStorePlain]: Start of recursive call 1: 6 dim-0 vars, 1 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-11-10 06:34:09,807 INFO L202 ElimStorePlain]: Needed 2 recursive calls to eliminate 7 variables, input treesize:91, output treesize:1 [2018-11-10 06:34:09,818 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 06:34:09,837 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 06:34:09,837 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 33 [2018-11-10 06:34:09,837 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 06:34:09,838 INFO L460 AbstractCegarLoop]: Interpolant automaton has 23 states [2018-11-10 06:34:09,838 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2018-11-10 06:34:09,838 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=228, Invalid=828, Unknown=0, NotChecked=0, Total=1056 [2018-11-10 06:34:09,839 INFO L87 Difference]: Start difference. First operand 27 states and 27 transitions. Second operand 23 states. [2018-11-10 06:34:10,122 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 06:34:10,122 INFO L93 Difference]: Finished difference Result 31 states and 32 transitions. [2018-11-10 06:34:10,123 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-10 06:34:10,123 INFO L78 Accepts]: Start accepts. Automaton has 23 states. Word has length 26 [2018-11-10 06:34:10,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 06:34:10,123 INFO L225 Difference]: With dead ends: 31 [2018-11-10 06:34:10,123 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 06:34:10,124 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 591 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=345, Invalid=1137, Unknown=0, NotChecked=0, Total=1482 [2018-11-10 06:34:10,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 06:34:10,125 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 06:34:10,125 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 06:34:10,125 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 06:34:10,125 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 26 [2018-11-10 06:34:10,125 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 06:34:10,125 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 06:34:10,125 INFO L482 AbstractCegarLoop]: Interpolant automaton has 23 states. [2018-11-10 06:34:10,125 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 06:34:10,125 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 06:34:10,128 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 06:34:10,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:34:10,207 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:34:10,207 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 06:34:10,208 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 4 17) the Hoare annotation is: true [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 4 17) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 4 17) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point L11-1(lines 11 13) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point L11-2(lines 11 13) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point L8(lines 8 15) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L421 ceAbstractionStarter]: At program point L11-4(lines 11 13) the Hoare annotation is: (let ((.cse4 (* 4 main_~pos~0))) (let ((.cse2 (+ .cse4 |main_~#a~0.offset|)) (.cse0 (<= 0 main_~pos~0)) (.cse1 (select |#memory_int| |main_~#a~0.base|)) (.cse3 (= |main_~#a~0.offset| 0))) (or (and .cse0 (= (select .cse1 .cse2) main_~marker~0) (= main_~i~0 0) .cse3) (and (not (= .cse2 0)) .cse0 (= main_~marker~0 (select .cse1 (+ |main_~#a~0.offset| .cse4))) (< main_~i~0 (+ main_~pos~0 1)) .cse3)))) [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point L8-1(lines 8 15) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L421 ceAbstractionStarter]: At program point L11-5(lines 11 13) the Hoare annotation is: (let ((.cse0 (<= 0 main_~pos~0))) (or (and .cse0 (= main_~i~0 0)) (and (<= main_~i~0 main_~pos~0) (not (= (+ (* 4 main_~pos~0) |main_~#a~0.offset|) 0)) .cse0 (= |main_~#a~0.offset| 0)))) [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 3) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point L3-3(line 3) no Hoare annotation was computed. [2018-11-10 06:34:10,208 INFO L428 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(line 3) the Hoare annotation is: true [2018-11-10 06:34:10,208 INFO L425 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(line 3) no Hoare annotation was computed. [2018-11-10 06:34:10,209 INFO L425 ceAbstractionStarter]: For program point L3(line 3) no Hoare annotation was computed. [2018-11-10 06:34:10,209 INFO L425 ceAbstractionStarter]: For program point L3-1(line 3) no Hoare annotation was computed. [2018-11-10 06:34:10,212 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,213 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,216 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,217 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,218 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 06:34:10 BoogieIcfgContainer [2018-11-10 06:34:10,218 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 06:34:10,218 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 06:34:10,218 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 06:34:10,218 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 06:34:10,219 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 06:34:05" (3/4) ... [2018-11-10 06:34:10,221 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 06:34:10,224 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 06:34:10,224 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 06:34:10,224 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-11-10 06:34:10,227 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 19 nodes and edges [2018-11-10 06:34:10,227 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 9 nodes and edges [2018-11-10 06:34:10,227 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-11-10 06:34:10,227 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-11-10 06:34:10,252 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_acea94c9-2735-4016-a002-13d6f1d24ac6/bin-2019/utaipan/witness.graphml [2018-11-10 06:34:10,252 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 06:34:10,253 INFO L168 Benchmark]: Toolchain (without parser) took 5517.19 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 544.2 MB). Free memory was 963.0 MB in the beginning and 1.2 GB in the end (delta: -243.2 MB). Peak memory consumption was 301.0 MB. Max. memory is 11.5 GB. [2018-11-10 06:34:10,254 INFO L168 Benchmark]: CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:34:10,254 INFO L168 Benchmark]: CACSL2BoogieTranslator took 164.39 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-10 06:34:10,254 INFO L168 Benchmark]: Boogie Procedure Inliner took 22.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. [2018-11-10 06:34:10,254 INFO L168 Benchmark]: Boogie Preprocessor took 13.42 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:34:10,255 INFO L168 Benchmark]: RCFGBuilder took 187.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. [2018-11-10 06:34:10,255 INFO L168 Benchmark]: TraceAbstraction took 5092.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.1 MB). Peak memory consumption was 323.6 MB. Max. memory is 11.5 GB. [2018-11-10 06:34:10,255 INFO L168 Benchmark]: Witness Printer took 34.12 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 06:34:10,257 INFO L336 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.17 ms. Allocated memory is still 1.0 GB. Free memory is still 982.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 164.39 ms. Allocated memory is still 1.0 GB. Free memory was 963.0 MB in the beginning and 952.3 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 22.02 ms. Allocated memory is still 1.0 GB. Free memory was 952.3 MB in the beginning and 946.9 MB in the end (delta: 5.4 MB). Peak memory consumption was 5.4 MB. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.42 ms. Allocated memory is still 1.0 GB. Free memory is still 946.9 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 187.62 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 129.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -168.2 MB). Peak memory consumption was 14.9 MB. Max. memory is 11.5 GB. * TraceAbstraction took 5092.22 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 414.7 MB). Free memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: -91.1 MB). Peak memory consumption was 323.6 MB. Max. memory is 11.5 GB. * Witness Printer took 34.12 ms. Allocated memory is still 1.6 GB. Free memory is still 1.2 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int - GenericResult: Unfinished Backtranslation unknown boogie variable #memory_int * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 3]: 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: 11]: Loop Invariant [2018-11-10 06:34:10,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,261 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 06:34:10,262 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (((0 <= pos && unknown-#memory_int-unknown[a][4 * pos + a] == marker) && i == 0) && a == 0) || ((((!(4 * pos + a == 0) && 0 <= pos) && marker == unknown-#memory_int-unknown[a][a + 4 * pos]) && i < pos + 1) && a == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 22 locations, 1 error locations. SAFE Result, 5.0s OverallTime, 5 OverallIterations, 5 TraceHistogramMax, 0.7s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 67 SDtfs, 75 SDslu, 226 SDs, 0 SdLazy, 224 SolverSat, 38 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 181 GetRequests, 93 SyntacticMatches, 4 SemanticMatches, 84 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 859 ImplicationChecksByTransitivity, 1.9s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=27occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.4s AbstIntTime, 1 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 0 StatesRemovedByMinimization, 0 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 13 PreInvPairs, 24 NumberOfFragments, 84 HoareAnnotationTreeSize, 13 FomulaSimplifications, 16 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 7 FomulaSimplificationsInter, 347 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 2.3s InterpolantComputationTime, 152 NumberOfCodeBlocks, 152 NumberOfCodeBlocksAsserted, 11 NumberOfCheckSat, 204 ConstructedInterpolants, 17 QuantifiedInterpolants, 58699 SizeOfPredicates, 62 NumberOfNonLiveVariables, 356 ConjunctsInSsa, 132 ConjunctsInUnsatCore, 11 InterpolantComputations, 2 PerfectInterpolantSequences, 3/126 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...