./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i -s /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/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 8538ad1ae962a1ba831f755fb5c2de9d27f82db5 ................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-08 23:59:55,421 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-08 23:59:55,422 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-08 23:59:55,428 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-08 23:59:55,428 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-08 23:59:55,429 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-08 23:59:55,429 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-08 23:59:55,430 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-08 23:59:55,431 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-08 23:59:55,431 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-08 23:59:55,432 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-08 23:59:55,432 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-08 23:59:55,432 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-08 23:59:55,433 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-08 23:59:55,434 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-08 23:59:55,434 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-08 23:59:55,434 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-08 23:59:55,435 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-08 23:59:55,436 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-08 23:59:55,437 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-08 23:59:55,438 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-08 23:59:55,438 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-08 23:59:55,439 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-08 23:59:55,439 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-08 23:59:55,440 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-08 23:59:55,440 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-08 23:59:55,441 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-08 23:59:55,441 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-08 23:59:55,442 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-08 23:59:55,442 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-08 23:59:55,442 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-08 23:59:55,443 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-08 23:59:55,443 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-08 23:59:55,443 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-08 23:59:55,443 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-08 23:59:55,444 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-08 23:59:55,444 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-12-08 23:59:55,451 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-08 23:59:55,451 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-08 23:59:55,452 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-08 23:59:55,452 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-08 23:59:55,452 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-08 23:59:55,452 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-08 23:59:55,452 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-08 23:59:55,452 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-08 23:59:55,453 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-08 23:59:55,453 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-08 23:59:55,453 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-08 23:59:55,453 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-08 23:59:55,453 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-08 23:59:55,454 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * sizeof long=4 [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-08 23:59:55,454 INFO L133 SettingsManager]: * sizeof long double=12 [2018-12-08 23:59:55,455 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-08 23:59:55,455 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-08 23:59:55,455 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-08 23:59:55,455 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-08 23:59:55,455 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-08 23:59:55,455 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-08 23:59:55,455 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-08 23:59:55,455 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-08 23:59:55,456 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-08 23:59:55,456 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-08 23:59:55,456 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-08 23:59:55,456 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-08 23:59:55,456 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-08 23:59:55,456 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-08 23:59:55,456 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_993f8206-bcc5-4352-a135-d60d2f7af230/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 -> 8538ad1ae962a1ba831f755fb5c2de9d27f82db5 [2018-12-08 23:59:55,474 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-08 23:59:55,483 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-08 23:59:55,486 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-08 23:59:55,487 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-08 23:59:55,487 INFO L276 PluginConnector]: CDTParser initialized [2018-12-08 23:59:55,488 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-12-08 23:59:55,532 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/data/1c427c136/f53335318f7347e1bc0566dbb3640902/FLAG84eeaa295 [2018-12-08 23:59:55,920 INFO L307 CDTParser]: Found 1 translation units. [2018-12-08 23:59:55,920 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4_true-termination.i [2018-12-08 23:59:55,923 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/data/1c427c136/f53335318f7347e1bc0566dbb3640902/FLAG84eeaa295 [2018-12-08 23:59:55,932 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/data/1c427c136/f53335318f7347e1bc0566dbb3640902 [2018-12-08 23:59:55,934 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-08 23:59:55,935 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-08 23:59:55,936 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-08 23:59:55,936 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-08 23:59:55,938 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-08 23:59:55,938 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:59:55" (1/1) ... [2018-12-08 23:59:55,940 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6ba821c7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:55, skipping insertion in model container [2018-12-08 23:59:55,940 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.12 11:59:55" (1/1) ... [2018-12-08 23:59:55,944 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-08 23:59:55,953 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-08 23:59:56,040 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:59:56,042 INFO L191 MainTranslator]: Completed pre-run [2018-12-08 23:59:56,054 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-08 23:59:56,064 INFO L195 MainTranslator]: Completed translation [2018-12-08 23:59:56,065 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56 WrapperNode [2018-12-08 23:59:56,065 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-08 23:59:56,065 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-08 23:59:56,065 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-08 23:59:56,065 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-08 23:59:56,070 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,074 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,078 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-08 23:59:56,078 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-08 23:59:56,078 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-08 23:59:56,079 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-08 23:59:56,112 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,112 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,113 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,113 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,118 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,122 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,123 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... [2018-12-08 23:59:56,125 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-08 23:59:56,125 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-08 23:59:56,125 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-08 23:59:56,125 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-08 23:59:56,126 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/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-12-08 23:59:56,158 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-08 23:59:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-08 23:59:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.alloc [2018-12-08 23:59:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-08 23:59:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-08 23:59:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2018-12-08 23:59:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-08 23:59:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-08 23:59:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure __VERIFIER_assert [2018-12-08 23:59:56,159 INFO L138 BoogieDeclarations]: Found implementation of procedure __VERIFIER_assert [2018-12-08 23:59:56,159 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2018-12-08 23:59:56,259 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-08 23:59:56,259 INFO L280 CfgBuilder]: Removed 2 assue(true) statements. [2018-12-08 23:59:56,260 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:59:56 BoogieIcfgContainer [2018-12-08 23:59:56,260 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-08 23:59:56,260 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-08 23:59:56,260 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-08 23:59:56,262 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-08 23:59:56,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.12 11:59:55" (1/3) ... [2018-12-08 23:59:56,262 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615cb015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:59:56, skipping insertion in model container [2018-12-08 23:59:56,262 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.12 11:59:56" (2/3) ... [2018-12-08 23:59:56,263 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@615cb015 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.12 11:59:56, skipping insertion in model container [2018-12-08 23:59:56,263 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:59:56" (3/3) ... [2018-12-08 23:59:56,264 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4_true-termination.i [2018-12-08 23:59:56,269 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-08 23:59:56,274 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 1 error locations. [2018-12-08 23:59:56,283 INFO L257 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2018-12-08 23:59:56,300 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-08 23:59:56,300 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-08 23:59:56,300 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-08 23:59:56,300 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-08 23:59:56,300 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-08 23:59:56,301 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-08 23:59:56,301 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-08 23:59:56,301 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-08 23:59:56,310 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states. [2018-12-08 23:59:56,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-08 23:59:56,313 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:56,313 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:59:56,314 INFO L423 AbstractCegarLoop]: === Iteration 1 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:56,317 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:56,317 INFO L82 PathProgramCache]: Analyzing trace with hash -1079158542, now seen corresponding path program 1 times [2018-12-08 23:59:56,319 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,346 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:56,346 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,346 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:56,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:56,433 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:56,435 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:56,435 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-12-08 23:59:56,435 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:56,437 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-08 23:59:56,445 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-08 23:59:56,445 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2018-12-08 23:59:56,446 INFO L87 Difference]: Start difference. First operand 24 states. Second operand 5 states. [2018-12-08 23:59:56,520 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:56,520 INFO L93 Difference]: Finished difference Result 56 states and 79 transitions. [2018-12-08 23:59:56,521 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-08 23:59:56,522 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 11 [2018-12-08 23:59:56,522 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:56,527 INFO L225 Difference]: With dead ends: 56 [2018-12-08 23:59:56,527 INFO L226 Difference]: Without dead ends: 30 [2018-12-08 23:59:56,530 INFO L631 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-12-08 23:59:56,540 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-12-08 23:59:56,553 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 25. [2018-12-08 23:59:56,553 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 23:59:56,554 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 28 transitions. [2018-12-08 23:59:56,555 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 28 transitions. Word has length 11 [2018-12-08 23:59:56,556 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:56,556 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 28 transitions. [2018-12-08 23:59:56,556 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-08 23:59:56,556 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 28 transitions. [2018-12-08 23:59:56,557 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-08 23:59:56,557 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:56,557 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:59:56,558 INFO L423 AbstractCegarLoop]: === Iteration 2 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:56,558 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:56,558 INFO L82 PathProgramCache]: Analyzing trace with hash -476045897, now seen corresponding path program 1 times [2018-12-08 23:59:56,558 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,559 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:56,559 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,559 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:56,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:56,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:56,595 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:56,595 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-08 23:59:56,595 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:56,596 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-08 23:59:56,596 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-08 23:59:56,596 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:56,597 INFO L87 Difference]: Start difference. First operand 25 states and 28 transitions. Second operand 3 states. [2018-12-08 23:59:56,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:56,604 INFO L93 Difference]: Finished difference Result 36 states and 39 transitions. [2018-12-08 23:59:56,604 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-08 23:59:56,604 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-08 23:59:56,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:56,605 INFO L225 Difference]: With dead ends: 36 [2018-12-08 23:59:56,605 INFO L226 Difference]: Without dead ends: 26 [2018-12-08 23:59:56,605 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-08 23:59:56,606 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-08 23:59:56,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 25. [2018-12-08 23:59:56,608 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25 states. [2018-12-08 23:59:56,608 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25 states to 25 states and 27 transitions. [2018-12-08 23:59:56,608 INFO L78 Accepts]: Start accepts. Automaton has 25 states and 27 transitions. Word has length 13 [2018-12-08 23:59:56,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:56,609 INFO L480 AbstractCegarLoop]: Abstraction has 25 states and 27 transitions. [2018-12-08 23:59:56,609 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-08 23:59:56,609 INFO L276 IsEmpty]: Start isEmpty. Operand 25 states and 27 transitions. [2018-12-08 23:59:56,609 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-08 23:59:56,609 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:56,609 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:59:56,609 INFO L423 AbstractCegarLoop]: === Iteration 3 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:56,610 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:56,610 INFO L82 PathProgramCache]: Analyzing trace with hash 1393486425, now seen corresponding path program 1 times [2018-12-08 23:59:56,610 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,610 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:56,610 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,610 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:56,629 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:56,709 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 4 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:56,710 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-08 23:59:56,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2018-12-08 23:59:56,710 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-08 23:59:56,710 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-08 23:59:56,710 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-08 23:59:56,710 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2018-12-08 23:59:56,710 INFO L87 Difference]: Start difference. First operand 25 states and 27 transitions. Second operand 8 states. [2018-12-08 23:59:56,780 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-08 23:59:56,780 INFO L93 Difference]: Finished difference Result 38 states and 41 transitions. [2018-12-08 23:59:56,780 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-08 23:59:56,780 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 18 [2018-12-08 23:59:56,781 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-08 23:59:56,781 INFO L225 Difference]: With dead ends: 38 [2018-12-08 23:59:56,781 INFO L226 Difference]: Without dead ends: 36 [2018-12-08 23:59:56,781 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2018-12-08 23:59:56,781 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-08 23:59:56,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 24. [2018-12-08 23:59:56,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-08 23:59:56,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 25 transitions. [2018-12-08 23:59:56,784 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 25 transitions. Word has length 18 [2018-12-08 23:59:56,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-08 23:59:56,785 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 25 transitions. [2018-12-08 23:59:56,785 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-08 23:59:56,785 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 25 transitions. [2018-12-08 23:59:56,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-08 23:59:56,785 INFO L394 BasicCegarLoop]: Found error trace [2018-12-08 23:59:56,785 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-08 23:59:56,785 INFO L423 AbstractCegarLoop]: === Iteration 4 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-08 23:59:56,785 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:56,785 INFO L82 PathProgramCache]: Analyzing trace with hash 618852702, now seen corresponding path program 1 times [2018-12-08 23:59:56,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-08 23:59:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,786 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:56,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-08 23:59:56,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-08 23:59:56,806 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:57,037 WARN L180 SmtUtils]: Spent 133.00 ms on a formula simplification. DAG size of input: 98 DAG size of output: 71 [2018-12-08 23:59:57,087 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 2 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-08 23:59:57,088 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:59:57,088 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-08 23:59:57,088 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-08 23:59:57,089 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [12], [14], [16], [22], [31], [42], [45], [47], [50], [52], [53], [54], [55], [57], [58], [59] [2018-12-08 23:59:57,111 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-08 23:59:57,111 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-08 23:59:57,229 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-08 23:59:57,230 INFO L272 AbstractInterpreter]: Visited 19 different actions 35 times. Merged at 4 different actions 4 times. Never widened. Performed 158 root evaluator evaluations with a maximum evaluation depth of 7. Performed 158 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 1 fixpoints after 1 different actions. Largest state had 23 variables. [2018-12-08 23:59:57,237 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-08 23:59:57,238 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-08 23:59:57,238 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-08 23:59:57,238 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/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-12-08 23:59:57,246 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-08 23:59:57,247 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-08 23:59:57,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-08 23:59:57,285 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:00:02,004 WARN L307 Elim1Store]: Array PQE input equivalent to false [2018-12-09 00:00:02,004 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:00:06,055 INFO L478 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 58 treesize of output 50 [2018-12-09 00:00:06,060 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:00:06,062 INFO L701 Elim1Store]: detected not equals via solver [2018-12-09 00:00:06,094 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:00:06,116 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:00:06,344 INFO L303 Elim1Store]: Index analysis took 287 ms [2018-12-09 00:00:06,345 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 76 [2018-12-09 00:00:06,345 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-12-09 00:00:06,365 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:00:09,043 INFO L267 ElimStorePlain]: Start of recursive call 1: 16 dim-0 vars, 4 dim-2 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:00:09,043 INFO L202 ElimStorePlain]: Needed 4 recursive calls to eliminate 20 variables, input treesize:433, output treesize:7 [2018-12-09 00:00:09,072 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:00:09,072 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:00:09,309 WARN L180 SmtUtils]: Spent 104.00 ms on a formula simplification. DAG size of input: 74 DAG size of output: 63 [2018-12-09 00:00:09,508 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-12-09 00:00:09,509 INFO L267 ElimStorePlain]: Start of recursive call 2: End of recursive call: and 1 xjuncts. [2018-12-09 00:01:28,574 INFO L478 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 124 treesize of output 112 [2018-12-09 00:01:28,579 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:28,580 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:28,582 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:28,583 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:28,585 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:28,693 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:28,696 INFO L303 Elim1Store]: Index analysis took 120 ms [2018-12-09 00:01:28,705 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 1 case distinctions, treesize of input 82 treesize of output 137 [2018-12-09 00:01:28,708 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 2 xjuncts. [2018-12-09 00:01:29,299 INFO L267 ElimStorePlain]: Start of recursive call 3: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:01:53,850 INFO L478 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 170 treesize of output 150 [2018-12-09 00:01:53,864 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,864 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,876 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,877 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,877 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,878 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,878 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,879 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,885 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,886 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,886 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,887 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,887 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:53,969 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:01:54,535 INFO L303 Elim1Store]: Index analysis took 684 ms [2018-12-09 00:01:54,559 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 132 treesize of output 309 [2018-12-09 00:01:54,564 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 4 xjuncts. [2018-12-09 00:01:54,642 INFO L267 ElimStorePlain]: Start of recursive call 5: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:02:33,624 INFO L478 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 174 treesize of output 154 [2018-12-09 00:02:33,629 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,630 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,641 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,642 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,642 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,643 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,644 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,645 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,649 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,655 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,656 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,659 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,659 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:33,692 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 14 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 2 case distinctions, treesize of input 136 treesize of output 319 [2018-12-09 00:02:33,696 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 4 xjuncts. [2018-12-09 00:02:33,801 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:02:44,091 INFO L478 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 148 treesize of output 132 [2018-12-09 00:02:44,095 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,096 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,140 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,142 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,143 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,144 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,144 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,145 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,175 INFO L683 Elim1Store]: detected equality via solver [2018-12-09 00:02:44,191 INFO L478 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 10 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 1 case distinctions, treesize of input 109 treesize of output 218 [2018-12-09 00:02:44,195 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 2 xjuncts. [2018-12-09 00:02:44,240 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-12-09 00:02:45,394 INFO L267 ElimStorePlain]: Start of recursive call 1: 156 dim-0 vars, 78 dim-2 vars, End of recursive call: 1 dim-0 vars, and 1 xjuncts. [2018-12-09 00:02:45,394 INFO L202 ElimStorePlain]: Needed 10 recursive calls to eliminate 234 variables, input treesize:12356, output treesize:31 [2018-12-09 00:02:45,442 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-09 00:02:45,456 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-09 00:02:45,457 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [8, 7] imperfect sequences [8] total 13 [2018-12-09 00:02:45,457 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 00:02:45,457 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 00:02:45,457 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 00:02:45,457 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=33, Invalid=121, Unknown=2, NotChecked=0, Total=156 [2018-12-09 00:02:45,457 INFO L87 Difference]: Start difference. First operand 24 states and 25 transitions. Second operand 8 states. [2018-12-09 00:02:49,073 WARN L180 SmtUtils]: Spent 2.15 s on a formula simplification. DAG size of input: 46 DAG size of output: 43 [2018-12-09 00:02:51,288 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:02:51,288 INFO L93 Difference]: Finished difference Result 35 states and 37 transitions. [2018-12-09 00:02:51,289 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-09 00:02:51,289 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 20 [2018-12-09 00:02:51,289 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:02:51,289 INFO L225 Difference]: With dead ends: 35 [2018-12-09 00:02:51,289 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 00:02:51,290 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 51 GetRequests, 30 SyntacticMatches, 8 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=47, Invalid=161, Unknown=2, NotChecked=0, Total=210 [2018-12-09 00:02:51,290 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 00:02:51,292 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 30. [2018-12-09 00:02:51,292 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 00:02:51,293 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 31 transitions. [2018-12-09 00:02:51,293 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 31 transitions. Word has length 20 [2018-12-09 00:02:51,293 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:02:51,293 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 31 transitions. [2018-12-09 00:02:51,293 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 00:02:51,293 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 31 transitions. [2018-12-09 00:02:51,293 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-12-09 00:02:51,293 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 00:02:51,293 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 00:02:51,294 INFO L423 AbstractCegarLoop]: === Iteration 5 === [__VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-12-09 00:02:51,294 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:02:51,294 INFO L82 PathProgramCache]: Analyzing trace with hash -1516465715, now seen corresponding path program 1 times [2018-12-09 00:02:51,294 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 00:02:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:02:51,294 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:02:51,294 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 00:02:51,294 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 00:02:51,307 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:02:53,360 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:02:53,360 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:02:53,360 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 00:02:53,360 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-12-09 00:02:53,360 INFO L205 CegarAbsIntRunner]: [0], [1], [5], [12], [14], [16], [22], [31], [33], [42], [45], [47], [50], [52], [53], [54], [55], [57], [58], [59], [60] [2018-12-09 00:02:53,361 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 00:02:53,361 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 00:02:53,404 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 00:02:53,404 INFO L272 AbstractInterpreter]: Visited 21 different actions 37 times. Merged at 4 different actions 4 times. Never widened. Performed 162 root evaluator evaluations with a maximum evaluation depth of 7. Performed 162 inverse root evaluator evaluations with a maximum inverse evaluation depth of 7. Found 2 fixpoints after 2 different actions. Largest state had 25 variables. [2018-12-09 00:02:53,406 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 00:02:53,406 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 00:02:53,406 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 00:02:53,406 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/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-12-09 00:02:53,412 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 00:02:53,413 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 00:02:53,424 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 00:02:53,426 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 00:02:53,444 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:02:53,444 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 00:02:53,558 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 6 proven. 1 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2018-12-09 00:02:53,573 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 00:02:53,574 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 4, 4] total 9 [2018-12-09 00:02:53,574 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 00:02:53,574 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 00:02:53,574 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 00:02:53,574 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=48, Unknown=1, NotChecked=0, Total=72 [2018-12-09 00:02:53,574 INFO L87 Difference]: Start difference. First operand 30 states and 31 transitions. Second operand 7 states. [2018-12-09 00:02:58,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 00:02:58,296 INFO L93 Difference]: Finished difference Result 34 states and 36 transitions. [2018-12-09 00:02:58,297 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-09 00:02:58,297 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-12-09 00:02:58,297 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 00:02:58,297 INFO L225 Difference]: With dead ends: 34 [2018-12-09 00:02:58,297 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 00:02:58,298 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 50 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=32, Invalid=57, Unknown=1, NotChecked=0, Total=90 [2018-12-09 00:02:58,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 00:02:58,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 00:02:58,298 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 00:02:58,298 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 00:02:58,298 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-12-09 00:02:58,298 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 00:02:58,298 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 00:02:58,298 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 00:02:58,298 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 00:02:58,298 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 00:02:58,301 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 00:03:17,552 WARN L180 SmtUtils]: Spent 19.23 s on a formula simplification. DAG size of input: 55 DAG size of output: 48 [2018-12-09 00:03:33,997 WARN L180 SmtUtils]: Spent 16.44 s on a formula simplification. DAG size of input: 59 DAG size of output: 50 [2018-12-09 00:03:34,040 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:03:34,040 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:03:34,040 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:03:34,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 00:03:34,041 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 00:03:34,041 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 00:03:34,041 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 00:03:34,041 INFO L444 ceAbstractionStarter]: At program point L31-2(lines 31 37) the Hoare annotation is: (or (let ((.cse0 (+ main_~index2~0 1))) (and (<= main_~index2~0 (+ (* 4294967296 (div (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) (+ (- main_~index1~0) .cse0)) 4294967296)) 99998)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* 4 (mod .cse0 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296))))) (and (<= main_~index1~0 (+ (* 4294967296 (div main_~index1~0 4294967296)) 99999)) (<= main_~index2~0 (+ (* 4294967296 (div main_~index2~0 4294967296)) 99999)) (= main_~loop_entered~0 0))) [2018-12-09 00:03:34,041 INFO L448 ceAbstractionStarter]: For program point L31-3(lines 20 47) no Hoare annotation was computed. [2018-12-09 00:03:34,041 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 19 47) no Hoare annotation was computed. [2018-12-09 00:03:34,041 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 19 47) no Hoare annotation was computed. [2018-12-09 00:03:34,042 INFO L444 ceAbstractionStarter]: At program point L40-2(lines 40 44) the Hoare annotation is: (or (let ((.cse0 (+ main_~index2~0 1))) (and (<= main_~index2~0 (+ (* 4294967296 (div (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) (+ (- main_~index1~0) .cse0)) 4294967296)) 99998)) (let ((.cse1 (select |#memory_int| |main_~#array~0.base|))) (= (mod (select .cse1 (+ (* 4 (mod .cse0 4294967296)) |main_~#array~0.offset|)) 4294967296) (mod (select .cse1 (+ (* 4 (mod (+ main_~index1~0 4294967295) 4294967296)) |main_~#array~0.offset|)) 4294967296))))) (let ((.cse2 (* 4294967296 (div main_~index2~0 4294967296)))) (and (<= main_~index2~0 (+ .cse2 99999)) (<= (+ .cse2 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296))))))) [2018-12-09 00:03:34,042 INFO L444 ceAbstractionStarter]: At program point L32(line 32) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~index2~0 4294967296)))) (and (or (and (<= main_~index2~0 (+ .cse0 99999)) (= main_~loop_entered~0 0)) (<= main_~index2~0 (+ .cse0 99998))) (<= (+ .cse0 main_~index1~0 1) (+ main_~index2~0 (* 4294967296 (div main_~index1~0 4294967296)))))) [2018-12-09 00:03:34,042 INFO L448 ceAbstractionStarter]: For program point L32-1(line 32) no Hoare annotation was computed. [2018-12-09 00:03:34,042 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 19 47) the Hoare annotation is: true [2018-12-09 00:03:34,042 INFO L444 ceAbstractionStarter]: At program point L41(line 41) the Hoare annotation is: (let ((.cse1 (* 4294967296 (div |main_#t~mem7| 4294967296))) (.cse0 (+ (* 4294967296 (div |main_#t~mem8| 4294967296)) |main_#t~mem7|))) (and (< .cse0 (+ .cse1 |main_#t~mem8| 1)) (<= main_~index2~0 (+ (* 4294967296 (div (+ (* 4294967296 (div (+ main_~index1~0 (- 1)) 4294967296)) (+ (- main_~index1~0) (+ main_~index2~0 1))) 4294967296)) 99998)) (<= (+ .cse1 |main_#t~mem8|) .cse0))) [2018-12-09 00:03:34,042 INFO L448 ceAbstractionStarter]: For program point L41-1(line 41) no Hoare annotation was computed. [2018-12-09 00:03:34,043 INFO L448 ceAbstractionStarter]: For program point L39(lines 39 45) no Hoare annotation was computed. [2018-12-09 00:03:34,043 INFO L451 ceAbstractionStarter]: At program point __VERIFIER_assertENTRY(lines 9 15) the Hoare annotation is: true [2018-12-09 00:03:34,043 INFO L448 ceAbstractionStarter]: For program point L12(line 12) no Hoare annotation was computed. [2018-12-09 00:03:34,043 INFO L448 ceAbstractionStarter]: For program point L11(lines 11 13) no Hoare annotation was computed. [2018-12-09 00:03:34,043 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertErr0ASSERT_VIOLATIONERROR_FUNCTION(line 12) no Hoare annotation was computed. [2018-12-09 00:03:34,043 INFO L448 ceAbstractionStarter]: For program point __VERIFIER_assertEXIT(lines 9 15) no Hoare annotation was computed. [2018-12-09 00:03:34,043 INFO L448 ceAbstractionStarter]: For program point L11-2(lines 9 15) no Hoare annotation was computed. [2018-12-09 00:03:34,049 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,050 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,055 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,056 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,057 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,059 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 12:03:34 BoogieIcfgContainer [2018-12-09 00:03:34,059 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 00:03:34,060 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 00:03:34,060 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 00:03:34,060 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 00:03:34,060 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 08.12 11:59:56" (3/4) ... [2018-12-09 00:03:34,063 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 00:03:34,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 00:03:34,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 00:03:34,068 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure __VERIFIER_assert [2018-12-09 00:03:34,072 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 13 nodes and edges [2018-12-09 00:03:34,072 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-09 00:03:34,072 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 2 nodes and edges [2018-12-09 00:03:34,107 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_993f8206-bcc5-4352-a135-d60d2f7af230/bin-2019/utaipan/witness.graphml [2018-12-09 00:03:34,108 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 00:03:34,108 INFO L168 Benchmark]: Toolchain (without parser) took 218174.17 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 124.3 MB). Free memory was 953.4 MB in the beginning and 819.4 MB in the end (delta: 134.0 MB). Peak memory consumption was 258.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:34,109 INFO L168 Benchmark]: CDTParser took 0.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:03:34,109 INFO L168 Benchmark]: CACSL2BoogieTranslator took 129.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.4 MB in the beginning and 942.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:34,110 INFO L168 Benchmark]: Boogie Procedure Inliner took 13.07 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 00:03:34,110 INFO L168 Benchmark]: Boogie Preprocessor took 46.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:34,110 INFO L168 Benchmark]: RCFGBuilder took 134.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:34,110 INFO L168 Benchmark]: TraceAbstraction took 217799.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 13.6 MB). Free memory was 1.1 GB in the beginning and 825.5 MB in the end (delta: 266.2 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:34,111 INFO L168 Benchmark]: Witness Printer took 48.23 ms. Allocated memory is still 1.2 GB. Free memory was 825.5 MB in the beginning and 819.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. Max. memory is 11.5 GB. [2018-12-09 00:03:34,113 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.16 ms. Allocated memory is still 1.0 GB. Free memory is still 973.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 129.44 ms. Allocated memory is still 1.0 GB. Free memory was 953.4 MB in the beginning and 942.7 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 13.07 ms. Allocated memory is still 1.0 GB. Free memory is still 942.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 46.44 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.6 MB). Free memory was 942.7 MB in the beginning and 1.1 GB in the end (delta: -163.3 MB). Peak memory consumption was 12.9 MB. Max. memory is 11.5 GB. * RCFGBuilder took 134.63 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 14.3 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 217799.10 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 13.6 MB). Free memory was 1.1 GB in the beginning and 825.5 MB in the end (delta: 266.2 MB). Peak memory consumption was 279.8 MB. Max. memory is 11.5 GB. * Witness Printer took 48.23 ms. Allocated memory is still 1.2 GB. Free memory was 825.5 MB in the beginning and 819.4 MB in the end (delta: 6.1 MB). Peak memory consumption was 6.1 MB. 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 - 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: 12]: 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: 40]: Loop Invariant [2018-12-09 00:03:34,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,116 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,117 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (index2 <= 4294967296 * ((4294967296 * ((index1 + -1) / 4294967296) + (-index1 + (index2 + 1))) / 4294967296) + 99998 && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) || (index2 <= 4294967296 * (index2 / 4294967296) + 99999 && 4294967296 * (index2 / 4294967296) + index1 + 1 <= index2 + 4294967296 * (index1 / 4294967296)) - InvariantResult [Line: 31]: Loop Invariant [2018-12-09 00:03:34,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-12-09 00:03:34,118 WARN L1298 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (index2 <= 4294967296 * ((4294967296 * ((index1 + -1) / 4294967296) + (-index1 + (index2 + 1))) / 4294967296) + 99998 && unknown-#memory_int-unknown[array][4 * ((index2 + 1) % 4294967296) + array] % 4294967296 == unknown-#memory_int-unknown[array][4 * ((index1 + 4294967295) % 4294967296) + array] % 4294967296) || ((index1 <= 4294967296 * (index1 / 4294967296) + 99999 && index2 <= 4294967296 * (index2 / 4294967296) + 99999) && loop_entered == 0) - StatisticsResult: Ultimate Automizer benchmark data CFG has 4 procedures, 24 locations, 1 error locations. SAFE Result, 217.7s OverallTime, 5 OverallIterations, 3 TraceHistogramMax, 10.7s AutomataDifference, 0.0s DeadEndRemovalTime, 35.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 94 SDtfs, 39 SDslu, 253 SDs, 0 SdLazy, 175 SolverSat, 17 SolverUnsat, 3 SolverUnknown, 0 SolverNotchecked, 7.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 131 GetRequests, 86 SyntacticMatches, 12 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 9.8s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=30occurred in iteration=4, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 5 MinimizatonAttempts, 21 StatesRemovedByMinimization, 4 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 9 LocationsWithAnnotation, 15 PreInvPairs, 22 NumberOfFragments, 257 HoareAnnotationTreeSize, 15 FomulaSimplifications, 100 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 9 FomulaSimplificationsInter, 433 FormulaSimplificationTreeSizeReductionInter, 35.7s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.1s SatisfiabilityAnalysisTime, 170.7s InterpolantComputationTime, 136 NumberOfCodeBlocks, 136 NumberOfCodeBlocksAsserted, 7 NumberOfCheckSat, 174 ConstructedInterpolants, 0 QuantifiedInterpolants, 67798 SizeOfPredicates, 13 NumberOfNonLiveVariables, 164 ConjunctsInSsa, 31 ConjunctsInUnsatCore, 9 InterpolantComputations, 5 PerfectInterpolantSequences, 42/46 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...