./Ultimate.py --spec ../../sv-benchmarks/c/ReachSafety.prp --file ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c --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_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c -s /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/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 604294306b5c2c89672e57997bbce546f96c9935 .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... 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 13:30:31,533 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-10 13:30:31,534 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-10 13:30:31,540 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-10 13:30:31,540 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-10 13:30:31,541 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-10 13:30:31,542 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-10 13:30:31,543 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-10 13:30:31,544 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-10 13:30:31,544 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-10 13:30:31,545 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-10 13:30:31,545 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-10 13:30:31,546 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-10 13:30:31,546 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-10 13:30:31,547 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-10 13:30:31,547 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-10 13:30:31,548 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-10 13:30:31,549 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-10 13:30:31,550 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-10 13:30:31,551 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-10 13:30:31,552 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-10 13:30:31,553 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-10 13:30:31,554 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-10 13:30:31,555 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-10 13:30:31,555 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-10 13:30:31,555 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-10 13:30:31,556 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-10 13:30:31,556 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-10 13:30:31,557 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-10 13:30:31,557 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-10 13:30:31,557 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-10 13:30:31,558 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-10 13:30:31,558 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-10 13:30:31,558 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-10 13:30:31,559 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-10 13:30:31,559 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-10 13:30:31,560 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/config/svcomp-Reach-32bit-Taipan_Default.epf [2018-11-10 13:30:31,569 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-10 13:30:31,569 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-10 13:30:31,570 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-10 13:30:31,570 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-10 13:30:31,570 INFO L133 SettingsManager]: * calls to implemented procedures=false [2018-11-10 13:30:31,570 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-10 13:30:31,571 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-10 13:30:31,571 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-10 13:30:31,571 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-10 13:30:31,571 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-10 13:30:31,571 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-10 13:30:31,572 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * sizeof long=4 [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * sizeof POINTER=4 [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-10 13:30:31,572 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-10 13:30:31,573 INFO L133 SettingsManager]: * sizeof long double=12 [2018-11-10 13:30:31,573 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-10 13:30:31,573 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-10 13:30:31,573 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-10 13:30:31,573 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-10 13:30:31,573 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-10 13:30:31,573 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-10 13:30:31,574 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-10 13:30:31,574 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-10 13:30:31,575 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_9b063e1b-5453-4515-84ad-47d2893882b3/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 -> 604294306b5c2c89672e57997bbce546f96c9935 [2018-11-10 13:30:31,598 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-10 13:30:31,607 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-10 13:30:31,609 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-10 13:30:31,610 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-10 13:30:31,611 INFO L276 PluginConnector]: CDTParser initialized [2018-11-10 13:30:31,611 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/../../sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-10 13:30:31,654 INFO L218 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/data/0e1218836/479f973bc837467aa0a9e6538033aaf9/FLAG0ea3409c0 [2018-11-10 13:30:31,993 INFO L298 CDTParser]: Found 1 translation units. [2018-11-10 13:30:31,994 INFO L158 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/sv-benchmarks/c/loop-crafted/simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-10 13:30:31,998 INFO L346 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/data/0e1218836/479f973bc837467aa0a9e6538033aaf9/FLAG0ea3409c0 [2018-11-10 13:30:32,010 INFO L354 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/data/0e1218836/479f973bc837467aa0a9e6538033aaf9 [2018-11-10 13:30:32,012 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-10 13:30:32,013 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-10 13:30:32,014 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:32,014 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-10 13:30:32,017 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-10 13:30:32,018 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,019 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 01:30:32, skipping insertion in model container [2018-11-10 13:30:32,020 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,028 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-10 13:30:32,048 INFO L174 MainTranslator]: Built tables and reachable declarations [2018-11-10 13:30:32,176 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:32,179 INFO L189 MainTranslator]: Completed pre-run [2018-11-10 13:30:32,198 INFO L202 PostProcessor]: Analyzing one entry point: main [2018-11-10 13:30:32,210 INFO L193 MainTranslator]: Completed translation [2018-11-10 13:30:32,211 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32 WrapperNode [2018-11-10 13:30:32,211 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-10 13:30:32,211 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:32,211 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-10 13:30:32,211 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-10 13:30:32,216 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,221 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,236 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-10 13:30:32,237 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-10 13:30:32,237 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-10 13:30:32,237 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-10 13:30:32,243 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,243 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,245 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,245 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,250 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,252 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,253 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... [2018-11-10 13:30:32,255 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-10 13:30:32,256 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-10 13:30:32,256 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-10 13:30:32,256 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-10 13:30:32,257 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/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 13:30:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-10 13:30:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-10 13:30:32,332 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-10 13:30:32,332 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-10 13:30:32,333 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-10 13:30:32,333 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-10 13:30:32,505 INFO L341 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-10 13:30:32,505 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:32 BoogieIcfgContainer [2018-11-10 13:30:32,506 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-10 13:30:32,506 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-10 13:30:32,506 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-10 13:30:32,509 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-10 13:30:32,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 01:30:32" (1/3) ... [2018-11-10 13:30:32,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b78b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:30:32, skipping insertion in model container [2018-11-10 13:30:32,510 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 01:30:32" (2/3) ... [2018-11-10 13:30:32,510 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@38b78b35 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 01:30:32, skipping insertion in model container [2018-11-10 13:30:32,511 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:32" (3/3) ... [2018-11-10 13:30:32,512 INFO L112 eAbstractionObserver]: Analyzing ICFG simple_array_index_value_true-unreach-call4.i.v+nlh-reducer.c [2018-11-10 13:30:32,519 INFO L136 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-10 13:30:32,524 INFO L148 ceAbstractionStarter]: Appying trace abstraction to program that has 3 error locations. [2018-11-10 13:30:32,537 INFO L257 AbstractCegarLoop]: Starting to check reachability of 3 error locations. [2018-11-10 13:30:32,560 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-10 13:30:32,561 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-10 13:30:32,561 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-10 13:30:32,561 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-10 13:30:32,561 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-10 13:30:32,561 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-10 13:30:32,561 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-10 13:30:32,561 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-10 13:30:32,570 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-11-10 13:30:32,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-11-10 13:30:32,574 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:32,574 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:32,575 INFO L424 AbstractCegarLoop]: === Iteration 1 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:32,578 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:32,578 INFO L82 PathProgramCache]: Analyzing trace with hash -1395858257, now seen corresponding path program 1 times [2018-11-10 13:30:32,580 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,616 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:32,616 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,616 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:32,667 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:32,716 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 13:30:32,718 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:32,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:32,718 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:32,723 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:32,731 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:32,731 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:32,733 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-11-10 13:30:32,755 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:32,755 INFO L93 Difference]: Finished difference Result 51 states and 67 transitions. [2018-11-10 13:30:32,755 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:32,756 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-11-10 13:30:32,756 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:32,762 INFO L225 Difference]: With dead ends: 51 [2018-11-10 13:30:32,762 INFO L226 Difference]: Without dead ends: 33 [2018-11-10 13:30:32,763 INFO L605 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-11-10 13:30:32,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-11-10 13:30:32,782 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 31. [2018-11-10 13:30:32,783 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-10 13:30:32,784 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 36 transitions. [2018-11-10 13:30:32,785 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 36 transitions. Word has length 13 [2018-11-10 13:30:32,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:32,785 INFO L481 AbstractCegarLoop]: Abstraction has 31 states and 36 transitions. [2018-11-10 13:30:32,785 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:32,785 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 36 transitions. [2018-11-10 13:30:32,785 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:30:32,785 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:32,786 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:32,786 INFO L424 AbstractCegarLoop]: === Iteration 2 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:32,786 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:32,786 INFO L82 PathProgramCache]: Analyzing trace with hash 1868760050, now seen corresponding path program 1 times [2018-11-10 13:30:32,786 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:32,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,787 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:32,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,788 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:32,798 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:32,831 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 13:30:32,831 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:32,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2018-11-10 13:30:32,831 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:32,832 INFO L460 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-10 13:30:32,833 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-10 13:30:32,833 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-11-10 13:30:32,833 INFO L87 Difference]: Start difference. First operand 31 states and 36 transitions. Second operand 4 states. [2018-11-10 13:30:32,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:32,871 INFO L93 Difference]: Finished difference Result 51 states and 59 transitions. [2018-11-10 13:30:32,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-10 13:30:32,872 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-10 13:30:32,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:32,873 INFO L225 Difference]: With dead ends: 51 [2018-11-10 13:30:32,873 INFO L226 Difference]: Without dead ends: 49 [2018-11-10 13:30:32,874 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:30:32,874 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-11-10 13:30:32,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 33. [2018-11-10 13:30:32,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 13:30:32,878 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-11-10 13:30:32,878 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 14 [2018-11-10 13:30:32,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:32,878 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-11-10 13:30:32,878 INFO L482 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-10 13:30:32,878 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-11-10 13:30:32,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-10 13:30:32,878 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:32,879 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:32,879 INFO L424 AbstractCegarLoop]: === Iteration 3 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:32,879 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:32,879 INFO L82 PathProgramCache]: Analyzing trace with hash 1932482999, now seen corresponding path program 1 times [2018-11-10 13:30:32,879 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:32,879 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,880 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:32,880 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,880 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:32,888 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:32,918 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 13:30:32,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:32,918 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:32,918 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:32,919 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:32,919 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:32,919 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:32,919 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-11-10 13:30:32,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:32,960 INFO L93 Difference]: Finished difference Result 60 states and 68 transitions. [2018-11-10 13:30:32,960 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:32,960 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-11-10 13:30:32,960 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:32,961 INFO L225 Difference]: With dead ends: 60 [2018-11-10 13:30:32,961 INFO L226 Difference]: Without dead ends: 40 [2018-11-10 13:30:32,961 INFO L605 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-11-10 13:30:32,961 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-10 13:30:32,963 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 33. [2018-11-10 13:30:32,964 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-11-10 13:30:32,964 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 37 transitions. [2018-11-10 13:30:32,964 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 37 transitions. Word has length 14 [2018-11-10 13:30:32,964 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:32,965 INFO L481 AbstractCegarLoop]: Abstraction has 33 states and 37 transitions. [2018-11-10 13:30:32,965 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:32,965 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 37 transitions. [2018-11-10 13:30:32,965 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-11-10 13:30:32,965 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:32,965 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:32,965 INFO L424 AbstractCegarLoop]: === Iteration 4 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:32,966 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:32,966 INFO L82 PathProgramCache]: Analyzing trace with hash -2140784762, now seen corresponding path program 1 times [2018-11-10 13:30:32,966 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:32,966 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:32,967 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:32,967 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:32,972 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:32,994 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 13:30:32,994 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:32,994 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-11-10 13:30:32,994 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:32,994 INFO L460 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-10 13:30:32,994 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-10 13:30:32,994 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-10 13:30:32,995 INFO L87 Difference]: Start difference. First operand 33 states and 37 transitions. Second operand 3 states. [2018-11-10 13:30:33,017 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:30:33,018 INFO L93 Difference]: Finished difference Result 54 states and 61 transitions. [2018-11-10 13:30:33,018 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-10 13:30:33,018 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 15 [2018-11-10 13:30:33,018 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:30:33,019 INFO L225 Difference]: With dead ends: 54 [2018-11-10 13:30:33,019 INFO L226 Difference]: Without dead ends: 34 [2018-11-10 13:30:33,019 INFO L605 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-11-10 13:30:33,019 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-11-10 13:30:33,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 28. [2018-11-10 13:30:33,022 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 28 states. [2018-11-10 13:30:33,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2018-11-10 13:30:33,023 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 15 [2018-11-10 13:30:33,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:30:33,023 INFO L481 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2018-11-10 13:30:33,023 INFO L482 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-10 13:30:33,023 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2018-11-10 13:30:33,024 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-11-10 13:30:33,024 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:30:33,024 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:30:33,024 INFO L424 AbstractCegarLoop]: === Iteration 5 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:30:33,024 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:30:33,024 INFO L82 PathProgramCache]: Analyzing trace with hash 341027121, now seen corresponding path program 1 times [2018-11-10 13:30:33,024 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:30:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:33,025 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:30:33,025 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:30:33,025 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:30:33,066 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:30:42,551 WARN L179 SmtUtils]: Spent 6.92 s on a formula simplification. DAG size of input: 93 DAG size of output: 63 [2018-11-10 13:30:46,963 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 13:30:46,964 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:30:46,964 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2018-11-10 13:30:46,964 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:30:46,965 INFO L460 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-10 13:30:46,965 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-10 13:30:46,965 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=34, Invalid=73, Unknown=3, NotChecked=0, Total=110 [2018-11-10 13:30:46,965 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand 11 states. [2018-11-10 13:30:57,955 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse6 (div c_main_~main__index2~0 4294967296))) (let ((.cse9 (div (+ c_main_~main__index1~0 (- 1)) 4294967296)) (.cse8 (* 4294967296 .cse6))) (let ((.cse1 (+ c_main_~main__index1~0 .cse8)) (.cse2 (* 4294967296 (div c_main_~main__index1~0 4294967296))) (.cse7 (* 4 c_main_~main__index2~0)) (.cse5 (select |c_#memory_int| |c_main_~#main__array~0.base|)) (.cse0 (div (+ c_main_~main__index2~0 (+ (- c_main_~main__index1~0) (+ (* 8589934592 .cse9) 1))) 4294967296))) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (- c_main_~main__index2~0) (+ (* 4294967296 .cse0) 99998)) 4294967296)) 100000)) (<= .cse1 (+ .cse2 c_main_~main__index2~0 1)) (or (<= .cse1 (+ .cse2 c_main_~main__index2~0)) (let ((.cse3 (select .cse5 (+ |c_main_~#main__array~0.offset| (* 4 (+ (* (- 4294967296) .cse6) (+ c_main_~main__index2~0 1))))))) (<= .cse3 (let ((.cse4 (select .cse5 (+ |c_main_~#main__array~0.offset| (+ (* (- 17179869184) .cse6) .cse7))))) (+ .cse4 (* 4294967296 (div (+ .cse3 (- .cse4)) 4294967296))))))) (<= c_main_~main__index2~0 (+ .cse8 99998)) (or (<= (+ (* 4 c_main_~main__index1~0) (* 17179869184 .cse0)) (+ (* 34359738368 .cse9) .cse7 3)) (let ((.cse10 (select .cse5 (+ |c_main_~#main__array~0.offset| (* 4 (+ c_main_~main__index2~0 (+ (* 4294967296 .cse9) (+ (* (- 4294967296) .cse0) 1)))))))) (<= .cse10 (let ((.cse11 (select .cse5 (+ |c_main_~#main__array~0.offset| (+ .cse7 (+ (* 17179869184 .cse9) (* (- 17179869184) .cse0))))))) (+ (* 4294967296 (div (+ .cse10 (- .cse11)) 4294967296)) .cse11))))))))) is different from false [2018-11-10 13:31:07,491 WARN L179 SmtUtils]: Spent 6.62 s on a formula simplification. DAG size of input: 95 DAG size of output: 67 [2018-11-10 13:31:16,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:16,453 INFO L93 Difference]: Finished difference Result 54 states and 58 transitions. [2018-11-10 13:31:16,453 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-10 13:31:16,453 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 20 [2018-11-10 13:31:16,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:16,454 INFO L225 Difference]: With dead ends: 54 [2018-11-10 13:31:16,454 INFO L226 Difference]: Without dead ends: 52 [2018-11-10 13:31:16,455 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 26.6s TimeCoverageRelationStatistics Valid=61, Invalid=147, Unknown=6, NotChecked=26, Total=240 [2018-11-10 13:31:16,455 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-10 13:31:16,458 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 34. [2018-11-10 13:31:16,459 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 13:31:16,459 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 38 transitions. [2018-11-10 13:31:16,459 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 38 transitions. Word has length 20 [2018-11-10 13:31:16,460 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:16,460 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 38 transitions. [2018-11-10 13:31:16,460 INFO L482 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-10 13:31:16,460 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 38 transitions. [2018-11-10 13:31:16,460 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 13:31:16,461 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:16,461 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:16,461 INFO L424 AbstractCegarLoop]: === Iteration 6 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:16,461 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:16,461 INFO L82 PathProgramCache]: Analyzing trace with hash 1330084180, now seen corresponding path program 1 times [2018-11-10 13:31:16,462 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,462 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:16,462 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,463 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:16,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:16,522 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 13:31:16,522 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:16,522 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:31:16,523 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:16,523 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:31:16,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:31:16,523 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:31:16,524 INFO L87 Difference]: Start difference. First operand 34 states and 38 transitions. Second operand 6 states. [2018-11-10 13:31:16,574 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:16,574 INFO L93 Difference]: Finished difference Result 55 states and 62 transitions. [2018-11-10 13:31:16,575 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-10 13:31:16,575 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-10 13:31:16,575 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:16,575 INFO L225 Difference]: With dead ends: 55 [2018-11-10 13:31:16,575 INFO L226 Difference]: Without dead ends: 53 [2018-11-10 13:31:16,576 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:31:16,576 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-11-10 13:31:16,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 36. [2018-11-10 13:31:16,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-10 13:31:16,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 40 transitions. [2018-11-10 13:31:16,580 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 40 transitions. Word has length 21 [2018-11-10 13:31:16,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:16,580 INFO L481 AbstractCegarLoop]: Abstraction has 36 states and 40 transitions. [2018-11-10 13:31:16,580 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:31:16,581 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 40 transitions. [2018-11-10 13:31:16,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-11-10 13:31:16,581 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:16,581 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:16,581 INFO L424 AbstractCegarLoop]: === Iteration 7 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:16,582 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:16,582 INFO L82 PathProgramCache]: Analyzing trace with hash 1346141529, now seen corresponding path program 1 times [2018-11-10 13:31:16,582 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,583 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:16,583 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,583 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:16,591 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:16,656 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 13:31:16,656 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:16,656 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2018-11-10 13:31:16,656 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:16,656 INFO L460 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-10 13:31:16,656 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-10 13:31:16,656 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:31:16,657 INFO L87 Difference]: Start difference. First operand 36 states and 40 transitions. Second operand 6 states. [2018-11-10 13:31:16,801 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:16,802 INFO L93 Difference]: Finished difference Result 79 states and 88 transitions. [2018-11-10 13:31:16,803 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-10 13:31:16,803 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 21 [2018-11-10 13:31:16,803 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:16,805 INFO L225 Difference]: With dead ends: 79 [2018-11-10 13:31:16,805 INFO L226 Difference]: Without dead ends: 62 [2018-11-10 13:31:16,805 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 11 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=54, Unknown=0, NotChecked=0, Total=90 [2018-11-10 13:31:16,806 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-10 13:31:16,810 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 37. [2018-11-10 13:31:16,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 13:31:16,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 41 transitions. [2018-11-10 13:31:16,811 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 41 transitions. Word has length 21 [2018-11-10 13:31:16,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:16,811 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 41 transitions. [2018-11-10 13:31:16,812 INFO L482 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-10 13:31:16,812 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 41 transitions. [2018-11-10 13:31:16,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:31:16,812 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:16,812 INFO L375 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:16,812 INFO L424 AbstractCegarLoop]: === Iteration 8 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:16,812 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:16,813 INFO L82 PathProgramCache]: Analyzing trace with hash -1707533126, now seen corresponding path program 1 times [2018-11-10 13:31:16,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:16,813 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,813 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:16,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,814 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:16,821 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:16,870 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 13:31:16,871 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-10 13:31:16,871 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2018-11-10 13:31:16,871 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:31:16,871 INFO L460 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-10 13:31:16,871 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-10 13:31:16,871 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-11-10 13:31:16,872 INFO L87 Difference]: Start difference. First operand 37 states and 41 transitions. Second operand 5 states. [2018-11-10 13:31:16,960 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:31:16,960 INFO L93 Difference]: Finished difference Result 62 states and 69 transitions. [2018-11-10 13:31:16,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-10 13:31:16,961 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 22 [2018-11-10 13:31:16,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:31:16,961 INFO L225 Difference]: With dead ends: 62 [2018-11-10 13:31:16,961 INFO L226 Difference]: Without dead ends: 45 [2018-11-10 13:31:16,962 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 2 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=16, Unknown=0, NotChecked=0, Total=30 [2018-11-10 13:31:16,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-10 13:31:16,968 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 37. [2018-11-10 13:31:16,968 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-11-10 13:31:16,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 40 transitions. [2018-11-10 13:31:16,971 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 40 transitions. Word has length 22 [2018-11-10 13:31:16,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:31:16,971 INFO L481 AbstractCegarLoop]: Abstraction has 37 states and 40 transitions. [2018-11-10 13:31:16,971 INFO L482 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-10 13:31:16,971 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 40 transitions. [2018-11-10 13:31:16,972 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-10 13:31:16,972 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:31:16,972 INFO L375 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:31:16,972 INFO L424 AbstractCegarLoop]: === Iteration 9 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:31:16,972 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:16,972 INFO L82 PathProgramCache]: Analyzing trace with hash 1309636523, now seen corresponding path program 1 times [2018-11-10 13:31:16,972 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:31:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,973 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:16,973 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:31:16,973 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:31:16,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:19,268 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:19,268 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:19,268 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:31:19,269 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-11-10 13:31:19,270 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [58], [62], [66], [69], [70], [72], [91], [92], [93] [2018-11-10 13:31:19,300 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:31:19,300 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:31:19,438 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:31:20,886 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:31:20,887 INFO L272 AbstractInterpreter]: Visited 21 different actions 81 times. Merged at 4 different actions 60 times. Widened at 1 different actions 11 times. Found 1 fixpoints after 1 different actions. Largest state had 45 variables. [2018-11-10 13:31:20,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:31:20,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:31:20,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:31:20,894 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/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 13:31:20,900 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:31:20,900 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:31:20,919 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:31:20,925 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:31:23,010 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:23,010 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:31:27,121 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:31:27,153 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-10 13:31:27,153 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 4, 4] total 11 [2018-11-10 13:31:27,153 INFO L251 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-10 13:31:27,154 INFO L460 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-10 13:31:27,154 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-10 13:31:27,154 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=75, Unknown=4, NotChecked=0, Total=110 [2018-11-10 13:31:27,154 INFO L87 Difference]: Start difference. First operand 37 states and 40 transitions. Second operand 9 states. [2018-11-10 13:31:34,361 WARN L179 SmtUtils]: Spent 2.33 s on a formula simplification. DAG size of input: 26 DAG size of output: 20 [2018-11-10 13:31:41,704 WARN L179 SmtUtils]: Spent 4.34 s on a formula simplification. DAG size of input: 29 DAG size of output: 23 [2018-11-10 13:31:51,405 WARN L179 SmtUtils]: Spent 2.37 s on a formula simplification. DAG size of input: 34 DAG size of output: 27 [2018-11-10 13:32:16,270 WARN L179 SmtUtils]: Spent 22.03 s on a formula simplification. DAG size of input: 38 DAG size of output: 31 [2018-11-10 13:32:34,366 WARN L179 SmtUtils]: Spent 4.15 s on a formula simplification that was a NOOP. DAG size: 24 [2018-11-10 13:32:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:32:34,421 INFO L93 Difference]: Finished difference Result 64 states and 69 transitions. [2018-11-10 13:32:34,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-10 13:32:34,421 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 22 [2018-11-10 13:32:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:32:34,422 INFO L225 Difference]: With dead ends: 64 [2018-11-10 13:32:34,422 INFO L226 Difference]: Without dead ends: 55 [2018-11-10 13:32:34,423 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 43 ImplicationChecksByTransitivity, 62.7s TimeCoverageRelationStatistics Valid=101, Invalid=195, Unknown=10, NotChecked=0, Total=306 [2018-11-10 13:32:34,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-10 13:32:34,426 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 34. [2018-11-10 13:32:34,426 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-10 13:32:34,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 35 transitions. [2018-11-10 13:32:34,427 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 35 transitions. Word has length 22 [2018-11-10 13:32:34,427 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:32:34,427 INFO L481 AbstractCegarLoop]: Abstraction has 34 states and 35 transitions. [2018-11-10 13:32:34,427 INFO L482 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-10 13:32:34,427 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 35 transitions. [2018-11-10 13:32:34,427 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-10 13:32:34,427 INFO L367 BasicCegarLoop]: Found error trace [2018-11-10 13:32:34,428 INFO L375 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-10 13:32:34,428 INFO L424 AbstractCegarLoop]: === Iteration 10 === [mainErr1ASSERT_VIOLATIONERROR_FUNCTION, mainErr2ASSERT_VIOLATIONERROR_FUNCTION, mainErr0ASSERT_VIOLATIONERROR_FUNCTION]=== [2018-11-10 13:32:34,428 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:32:34,428 INFO L82 PathProgramCache]: Analyzing trace with hash 1722152317, now seen corresponding path program 1 times [2018-11-10 13:32:34,428 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-10 13:32:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:32:34,429 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:32:34,429 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-10 13:32:34,429 INFO L288 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-10 13:32:34,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:32:37,106 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse3 (+ c_main_~main__index1~0 (- 1))) (.cse5 (div (+ c_main_~main__index2~0 4294867297) 4294967296))) (let ((.cse0 (* 4294967296 .cse5)) (.cse1 (- c_main_~main__index2~0)) (.cse2 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* (- 4294967296) (div (+ (* (- 4294967296) .cse5) .cse3) 4294967296)) (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse3) 4294967296)) 1)))) (and (<= (+ (* 4294967296 (div (+ .cse0 (+ c_main_~main__index1~0 (+ .cse1 4294917295))) 4294967296)) 1) c_main_~main__index1~0) (or (and .cse2 (or (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ c_main_~main__index2~0 8589834590) 4294967296)) .cse3) 4294967296)) c_main_~main__index2~0 1)) (let ((.cse4 (div (+ c_main_~main__index2~0 4294867294) 4294967296))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) .cse4) .cse3) 4294967296)) 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* 4294967296 .cse4) (+ c_main_~main__index1~0 (+ .cse1 1))) 4294967296)) 100000)))))) (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967297)) 4294967296)) 1) c_main_~main__index1~0)) (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967294)) 4294967296)) 1) c_main_~main__index1~0) .cse2))) is different from false [2018-11-10 13:32:39,204 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse5 (+ c_main_~main__index1~0 (- 1)))) (let ((.cse7 (div (+ (* (- 4294967296) .cse8) .cse5) 4294967296)) (.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* 4294967296 .cse8)) (.cse0 (* 4294967296 .cse6)) (.cse1 (- c_main_~main__index1~0)) (.cse4 (* (- 4294967296) .cse7)) (.cse3 (- c_main_~main__index2~0))) (and (or (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse0 (+ .cse1 (+ (* 2 c_main_~main__index2~0) 100001))) 8589934592)) 99998)) (<= (+ .cse0 4294967297) c_main_~main__index1~0)) (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse4 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse5) 4294967296)) 1)) (or (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse0 (+ .cse1 (+ c_main_~main__index2~0 4294967294))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* 4294967296 (div c_main_~main__index2~0 4294967296)) (+ .cse4 (+ c_main_~main__index1~0 (+ .cse3 4294967296)))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (+ .cse6 (- .cse7))) .cse5) 4294967296)) c_main_~main__index2~0 1)))))))) is different from false [2018-11-10 13:32:41,394 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse8 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse5 (+ c_main_~main__index1~0 (- 1)))) (let ((.cse7 (div (+ (* (- 4294967296) .cse8) .cse5) 4294967296)) (.cse6 (div c_main_~main__index1~0 4294967296))) (let ((.cse2 (* 4294967296 .cse8)) (.cse0 (* 4294967296 .cse6)) (.cse1 (- c_main_~main__index1~0)) (.cse4 (* (- 4294967296) .cse7)) (.cse3 (- c_main_~main__index2~0))) (and (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse0 (+ .cse1 (+ (* 2 c_main_~main__index2~0) 100001))) 8589934592)) 99998)) (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ .cse0 99999)) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse4 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse5) 4294967296)) 1)) (or (<= (+ .cse2 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse3 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (and (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse0 (+ .cse1 (+ c_main_~main__index2~0 4294967294))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (div (+ (* 4294967296 (div c_main_~main__index2~0 4294967296)) (+ .cse4 (+ c_main_~main__index1~0 (+ .cse3 4294967296)))) 4294967296)) .cse5) 4294967296)) c_main_~main__index2~0 1)) (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ (* (- 4294967296) (+ .cse6 (- .cse7))) .cse5) 4294967296)) c_main_~main__index2~0 1)))))))) is different from false [2018-11-10 13:34:22,646 WARN L179 SmtUtils]: Spent 1.48 m on a formula simplification. DAG size of input: 93 DAG size of output: 91 [2018-11-10 13:34:24,766 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse20 (+ c_main_~main__index1~0 (- 1))) (.cse21 (div (+ c_main_~main__index2~0 4294867297) 4294967296)) (.cse10 (div c_main_~main__index2~0 4294967296)) (.cse15 (div c_main_~main__index1~0 4294967296))) (let ((.cse16 (* 4294967296 .cse15)) (.cse4 (* 4294967296 .cse10)) (.cse0 (* 4294967296 .cse21)) (.cse1 (- c_main_~main__index2~0)) (.cse3 (* (- 4294967296) (div (+ (* (- 4294967296) .cse21) .cse20) 4294967296)))) (and (or (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967297)) 4294967296)) 1) c_main_~main__index1~0) (let ((.cse18 (+ .cse16 2147483647)) (.cse19 (+ .cse4 2147483647))) (let ((.cse2 (* (- 1) c_main_~main__index2~0)) (.cse7 (select |c_#memory_int| |c_main_~#main__array~0.base|)) (.cse5 (< .cse19 c_main_~main__index2~0)) (.cse6 (<= c_main_~main__index2~0 .cse19)) (.cse12 (<= c_main_~main__index1~0 .cse18)) (.cse11 (< .cse18 c_main_~main__index1~0))) (and (or (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse2 .cse3 .cse4 8589934592) 4294967296)) (- 1)) 4294967296)) 1)) .cse5) (and .cse6 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse2 .cse3 .cse4 4294967296) 4294967296)) (- 1)) 4294967296)) 1)))) (let ((.cse8 (* 4 c_main_~main__index2~0)) (.cse9 (* (- 17179869184) .cse10))) (or (and .cse6 (= |c_main_#t~mem4| (select .cse7 (+ .cse8 |c_main_~#main__array~0.offset| .cse9)))) (and (= |c_main_#t~mem4| (select .cse7 (+ .cse8 |c_main_~#main__array~0.offset| .cse9 (- 17179869184)))) .cse5))) (or (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse3 .cse2 .cse4) 4294967296)) (- 1)) 4294967296)) 1)) .cse11) (and .cse12 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 .cse3 .cse2 .cse4 4294967296) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1)))) (let ((.cse13 (* (- 17179869184) .cse15)) (.cse14 (* 4 c_main_~main__index1~0))) (or (and (= (select .cse7 (+ .cse13 .cse14 |c_main_~#main__array~0.offset| (- 17179869184))) |c_main_#t~mem3|) .cse11) (and .cse12 (= (select .cse7 (+ .cse13 .cse14 |c_main_~#main__array~0.offset|)) |c_main_#t~mem3|)))) (let ((.cse17 (* (- 1) c_main_~main__index1~0))) (or (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse16 .cse17 c_main_~main__index2~0 (- 2)) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1)) .cse5) (and .cse6 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse16 .cse17 c_main_~main__index2~0 4294967294) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1))))) (or (and .cse12 (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse16 .cse3 4294967295) 4294967296)) c_main_~main__index1~0 (- 1)) 4294967296)) 1))) (and .cse11 (<= c_main_~main__index1~0 (+ (* 4294967296 (div (+ c_main_~main__index1~0 (* (- 4294967296) (div (+ .cse16 .cse3 8589934591) 4294967296)) (- 1)) 4294967296)) c_main_~main__index2~0 1)))))))) (<= c_main_~main__index2~0 (+ (* 4294967296 (div (+ .cse16 (+ .cse4 (+ (- c_main_~main__index1~0) (+ c_main_~main__index2~0 200000)))) 8589934592)) 99998)) (<= (+ .cse0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse1 4294967294)) 4294967296)) 1) c_main_~main__index1~0) (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ (* (- 4294967296) (div (+ .cse3 (+ c_main_~main__index1~0 4294867295)) 4294967296)) .cse20) 4294967296)) 1))))) is different from false [2018-11-10 13:34:26,780 WARN L832 $PredicateComparison]: unable to prove that (let ((.cse16 (div (+ c_main_~main__index2~0 4294867298) 4294967296))) (let ((.cse14 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) .cse16) (- 2))) 4294967296))) (let ((.cse0 (* (- 4294967296) .cse14)) (.cse2 (- c_main_~main__index2~0)) (.cse1 (* 4294967296 .cse16))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse0 4294867294)) 4294967296)) (- 2))) 4294967296)) 3)) (<= (+ .cse1 (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse2 4294967292)) 4294967296)) 2) c_main_~main__index1~0) (let ((.cse3 (* 8589934592 .cse16))) (or (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse0 (+ .cse2 17179669181)))) 8589934592)) (- 2))) 4294967296)) 3)) (let ((.cse4 (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse0 (+ .cse2 8589734589)))) 8589934592)) (.cse15 (div (+ c_main_~main__index1~0 (+ .cse3 (+ .cse2 4294767293))) 4294967296))) (let ((.cse5 (* 4294967296 .cse15)) (.cse6 (+ (* 8589934592 .cse4) (* 4294967296 .cse14)))) (and (<= c_main_~main__index1~0 (+ c_main_~main__index2~0 (* 4294967296 (div (+ c_main_~main__index1~0 (+ (* (- 4294967296) .cse4) (- 2))) 4294967296)) 3)) (or (<= (+ .cse5 1) .cse6) (let ((.cse7 (+ (* 17179869184 .cse15) (* 4 c_main_~main__index1~0))) (.cse8 (* 4 c_main_~main__index2~0)) (.cse9 (* 34359738368 .cse4)) (.cse10 (* 34359738368 .cse14))) (and (or (<= .cse7 (+ .cse8 .cse9 .cse10 3)) (let ((.cse13 (select |c_#memory_int| |c_main_~#main__array~0.base|))) (let ((.cse11 (select .cse13 (+ |c_main_~#main__array~0.offset| (* 4 (+ c_main_~main__index1~0 (+ (* 4294967296 .cse4) (* (- 4294967296) .cse15)))))))) (<= .cse11 (let ((.cse12 (select .cse13 (+ |c_main_~#main__array~0.offset| (+ (* 17179869184 .cse14) (+ (* 17179869184 .cse4) (+ (* (- 17179869184) .cse15) .cse8))))))) (+ (* 4294967296 (div (+ (- .cse12) .cse11) 4294967296)) .cse12)))))) (<= .cse7 (+ .cse8 .cse9 .cse10 4))))) (<= .cse5 .cse6)))) (<= (+ (* 4294967296 (div (+ c_main_~main__index1~0 (+ .cse2 4294967295)) 4294967296)) .cse1 2) c_main_~main__index1~0))))))) is different from false [2018-11-10 13:34:30,867 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 1 times theorem prover too weak. 0 trivial. 2 not checked. [2018-11-10 13:34:30,867 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:30,867 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-10 13:34:30,867 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 28 with the following transitions: [2018-11-10 13:34:30,868 INFO L202 CegarAbsIntRunner]: [0], [1], [5], [8], [11], [14], [17], [20], [22], [28], [30], [33], [36], [39], [42], [44], [50], [58], [62], [66], [69], [70], [91], [92], [93] [2018-11-10 13:34:30,870 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, OctagonDomain] [2018-11-10 13:34:30,870 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-10 13:34:30,887 WARN L79 EvaluatorLogger]: Possible loss of precision. Operator ARITHMOD has no precise implementation. [2018-11-10 13:34:31,187 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-10 13:34:31,188 INFO L272 AbstractInterpreter]: Visited 25 different actions 27 times. Merged at 2 different actions 2 times. Never widened. Found 1 fixpoints after 1 different actions. Largest state had 46 variables. [2018-11-10 13:34:31,189 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-10 13:34:31,189 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-10 13:34:31,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-10 13:34:31,189 INFO L194 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/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 13:34:31,194 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-10 13:34:31,194 INFO L288 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-10 13:34:31,642 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-10 13:34:31,644 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-10 13:35:04,118 WARN L179 SmtUtils]: Spent 2.46 s on a formula simplification. DAG size of input: 54 DAG size of output: 36 [2018-11-10 13:35:22,579 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:22,580 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-10 13:35:31,597 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 97 treesize of output 89 [2018-11-10 13:35:31,606 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,612 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,613 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,615 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,621 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,626 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,664 INFO L477 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 52 treesize of output 126 [2018-11-10 13:35:31,667 INFO L267 ElimStorePlain]: Start of recursive call 3: End of recursive call: and 2 xjuncts. [2018-11-10 13:35:31,699 INFO L267 ElimStorePlain]: Start of recursive call 2: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,701 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:35:31,701 INFO L267 ElimStorePlain]: Start of recursive call 4: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,703 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:35:31,703 INFO L267 ElimStorePlain]: Start of recursive call 5: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,704 WARN L307 Elim1Store]: Array PQE input equivalent to true [2018-11-10 13:35:31,704 INFO L267 ElimStorePlain]: Start of recursive call 6: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,828 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 82 treesize of output 74 [2018-11-10 13:35:31,842 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,843 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,848 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,849 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,858 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,864 INFO L477 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 56 treesize of output 138 [2018-11-10 13:35:31,866 INFO L267 ElimStorePlain]: Start of recursive call 8: End of recursive call: and 2 xjuncts. [2018-11-10 13:35:31,895 INFO L267 ElimStorePlain]: Start of recursive call 7: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,966 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 84 treesize of output 76 [2018-11-10 13:35:31,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,969 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,970 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,971 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,971 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,974 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:31,979 INFO L477 Elim1Store]: Elim1 did not use preprocessing eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 7 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 0 case distinctions, treesize of input 54 treesize of output 127 [2018-11-10 13:35:31,981 INFO L267 ElimStorePlain]: Start of recursive call 10: End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,994 INFO L267 ElimStorePlain]: Start of recursive call 9: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:31,997 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 91 treesize of output 83 [2018-11-10 13:35:32,000 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,000 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,001 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,003 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,007 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,018 INFO L477 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 55 treesize of output 135 [2018-11-10 13:35:32,020 INFO L267 ElimStorePlain]: Start of recursive call 12: End of recursive call: and 2 xjuncts. [2018-11-10 13:35:32,037 INFO L267 ElimStorePlain]: Start of recursive call 11: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:32,039 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 87 treesize of output 79 [2018-11-10 13:35:32,042 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,043 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,043 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,046 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,049 INFO L682 Elim1Store]: detected equality via solver [2018-11-10 13:35:32,058 INFO L477 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 53 treesize of output 129 [2018-11-10 13:35:32,060 INFO L267 ElimStorePlain]: Start of recursive call 14: End of recursive call: and 2 xjuncts. [2018-11-10 13:35:32,078 INFO L267 ElimStorePlain]: Start of recursive call 13: 1 dim-1 vars, End of recursive call: and 1 xjuncts. [2018-11-10 13:35:32,105 INFO L267 ElimStorePlain]: Start of recursive call 1: 3 dim-0 vars, 3 dim-2 vars, End of recursive call: and 3 xjuncts. [2018-11-10 13:35:32,105 INFO L202 ElimStorePlain]: Needed 14 recursive calls to eliminate 6 variables, input treesize:1149, output treesize:74 [2018-11-10 13:35:38,396 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 3 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-10 13:35:38,412 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-11-10 13:35:38,412 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13, 8] imperfect sequences [15] total 28 [2018-11-10 13:35:38,412 INFO L258 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-10 13:35:38,413 INFO L460 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-10 13:35:38,413 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-10 13:35:38,413 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=367, Unknown=30, NotChecked=230, Total=756 [2018-11-10 13:35:38,413 INFO L87 Difference]: Start difference. First operand 34 states and 35 transitions. Second operand 13 states. [2018-11-10 13:36:26,437 WARN L179 SmtUtils]: Spent 28.33 s on a formula simplification. DAG size of input: 55 DAG size of output: 51 [2018-11-10 13:36:30,543 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-10 13:36:30,543 INFO L93 Difference]: Finished difference Result 44 states and 47 transitions. [2018-11-10 13:36:30,547 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-10 13:36:30,547 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 27 [2018-11-10 13:36:30,547 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-10 13:36:30,547 INFO L225 Difference]: With dead ends: 44 [2018-11-10 13:36:30,547 INFO L226 Difference]: Without dead ends: 0 [2018-11-10 13:36:30,548 INFO L605 BasicCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 34 SyntacticMatches, 9 SemanticMatches, 28 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 220.5s TimeCoverageRelationStatistics Valid=155, Invalid=430, Unknown=35, NotChecked=250, Total=870 [2018-11-10 13:36:30,548 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-11-10 13:36:30,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-11-10 13:36:30,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-11-10 13:36:30,548 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-11-10 13:36:30,548 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 27 [2018-11-10 13:36:30,548 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-10 13:36:30,548 INFO L481 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-11-10 13:36:30,549 INFO L482 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-10 13:36:30,549 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-11-10 13:36:30,549 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-11-10 13:36:30,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-11-10 13:36:30,585 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:36:30,586 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-11-10 13:37:06,916 WARN L179 SmtUtils]: Spent 36.32 s on a formula simplification. DAG size of input: 103 DAG size of output: 55 [2018-11-10 13:37:18,652 WARN L179 SmtUtils]: Spent 11.73 s on a formula simplification. DAG size of input: 109 DAG size of output: 56 [2018-11-10 13:37:23,873 WARN L179 SmtUtils]: Spent 5.22 s on a formula simplification. DAG size of input: 68 DAG size of output: 31 [2018-11-10 13:37:24,968 WARN L179 SmtUtils]: Spent 1.08 s on a formula simplification. DAG size of input: 76 DAG size of output: 38 [2018-11-10 13:37:24,971 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:37:24,971 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.initENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:37:24,971 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:37:24,971 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-11-10 13:37:24,971 INFO L428 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-11-10 13:37:24,971 INFO L428 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-11-10 13:37:24,971 INFO L425 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-11-10 13:37:24,971 INFO L428 ceAbstractionStarter]: At program point L126(lines 93 127) the Hoare annotation is: true [2018-11-10 13:37:24,971 INFO L425 ceAbstractionStarter]: For program point mainEXIT(lines 9 163) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L421 ceAbstractionStarter]: At program point L151(lines 21 152) the Hoare annotation is: (or (= main_~main__loop_entered~0 0) (let ((.cse5 (div main_~main__index2~0 4294967296))) (let ((.cse6 (* 4294967296 .cse5))) (let ((.cse0 (+ main_~main__index1~0 .cse6)) (.cse1 (* 4294967296 (div main_~main__index1~0 4294967296)))) (and (= main_~__VERIFIER_assert__cond~0 1) (<= .cse0 (+ .cse1 main_~main__index2~0 1)) (or (<= .cse0 (+ .cse1 main_~main__index2~0)) (let ((.cse4 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse2 (select .cse4 (+ |main_~#main__array~0.offset| (* 4 (+ (* (- 4294967296) .cse5) (+ main_~main__index2~0 1))))))) (<= .cse2 (let ((.cse3 (select .cse4 (+ |main_~#main__array~0.offset| (+ (* (- 17179869184) .cse5) (* 4 main_~main__index2~0)))))) (+ .cse3 (* 4294967296 (div (+ .cse2 (- .cse3)) 4294967296)))))))) (<= main_~main__index2~0 (+ .cse6 99998)) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) 99999))))))) [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L52(lines 52 128) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L19(lines 19 157) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L421 ceAbstractionStarter]: At program point L114(lines 94 123) the Hoare annotation is: (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1))) (or (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) .cse0) (let ((.cse6 (div main_~main__index2~0 4294967296))) (let ((.cse7 (* 4294967296 .cse6))) (let ((.cse1 (+ main_~main__index1~0 .cse7)) (.cse2 (* 4294967296 (div main_~main__index1~0 4294967296)))) (and .cse0 (<= .cse1 (+ .cse2 main_~main__index2~0 1)) (or (<= .cse1 (+ .cse2 main_~main__index2~0)) (let ((.cse5 (select |#memory_int| |main_~#main__array~0.base|))) (let ((.cse3 (select .cse5 (+ |main_~#main__array~0.offset| (* 4 (+ (* (- 4294967296) .cse6) (+ main_~main__index2~0 1))))))) (<= .cse3 (let ((.cse4 (select .cse5 (+ |main_~#main__array~0.offset| (+ (* (- 17179869184) .cse6) (* 4 main_~main__index2~0)))))) (+ .cse4 (* 4294967296 (div (+ .cse3 (- .cse4)) 4294967296)))))))) (<= main_~main__index2~0 (+ .cse7 99998)) (<= main_~main__index1~0 (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) 99999)))))))) [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONERROR_FUNCTION(line 68) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L57(lines 57 83) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L24(lines 24 147) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L421 ceAbstractionStarter]: At program point L82(lines 57 83) the Hoare annotation is: (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (= main_~__VERIFIER_assert__cond~0 1) (not (= 0 main_~main____CPAchecker_TMP_0~1)) (<= (+ main_~main__index1~0 (* 4294967296 (div (+ main_~main__index2~0 1) 4294967296))) (+ (* 4294967296 (div (+ main_~main__index1~0 (- 1)) 4294967296)) main_~main__index2~0 1)) (<= main_~main__index2~0 (+ (* 4294967296 (div main_~main__index2~0 4294967296)) 99998))) [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L16(lines 16 162) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L45(lines 45 133) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L421 ceAbstractionStarter]: At program point L74(lines 41 134) the Hoare annotation is: (let ((.cse0 (= main_~__VERIFIER_assert__cond~0 1)) (.cse1 (* 4294967296 (div main_~main__index2~0 4294967296)))) (or (and (< (mod main_~main__index1~0 4294967296) (mod main_~main__index2~0 4294967296)) (and .cse0 (< (mod (+ main_~main__index1~0 4294967295) 4294967296) (mod (+ main_~main__index2~0 1) 4294967296)) (<= main_~main__index2~0 (+ .cse1 99998)) (not (= 0 main_~__VERIFIER_assert__cond~1)))) (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse1 99999)) .cse0 (<= (+ main_~main__index1~0 .cse1 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0))))) [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L103(lines 103 115) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L37(line 37) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L425 ceAbstractionStarter]: For program point L66(lines 66 75) no Hoare annotation was computed. [2018-11-10 13:37:24,972 INFO L421 ceAbstractionStarter]: At program point L87(lines 55 88) the Hoare annotation is: false [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point L21(lines 21 152) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L421 ceAbstractionStarter]: At program point L141(lines 26 142) the Hoare annotation is: (let ((.cse0 (* 4294967296 (div main_~main__index2~0 4294967296)))) (and (= main_~main____CPAchecker_TMP_0~0 1) (<= main_~main__index2~0 (+ .cse0 99999)) (= main_~main__loop_entered~0 0) (<= (+ main_~main__index1~0 .cse0 1) (+ (* 4294967296 (div main_~main__index1~0 4294967296)) main_~main__index2~0)))) [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point mainFINAL(lines 9 163) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONERROR_FUNCTION(line 37) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L428 ceAbstractionStarter]: At program point mainENTRY(lines 9 163) the Hoare annotation is: true [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point L26(lines 26 142) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point L55(lines 55 88) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L421 ceAbstractionStarter]: At program point L146(lines 24 147) the Hoare annotation is: false [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONERROR_FUNCTION(line 105) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point L105(line 105) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point L68(line 68) no Hoare annotation was computed. [2018-11-10 13:37:24,973 INFO L425 ceAbstractionStarter]: For program point L35(lines 35 134) no Hoare annotation was computed. [2018-11-10 13:37:24,978 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,979 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,979 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,979 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,983 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,985 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,985 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,985 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,985 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,986 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,986 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,986 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,987 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:24,991 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 10.11 01:37:24 BoogieIcfgContainer [2018-11-10 13:37:24,991 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-10 13:37:24,992 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-10 13:37:24,992 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-10 13:37:24,992 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-10 13:37:24,992 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 10.11 01:30:32" (3/4) ... [2018-11-10 13:37:24,995 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-11-10 13:37:24,999 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-11-10 13:37:24,999 INFO L333 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-11-10 13:37:25,003 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 34 nodes and edges [2018-11-10 13:37:25,004 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 23 nodes and edges [2018-11-10 13:37:25,004 INFO L846 BoogieBacktranslator]: Reduced CFG by removing 10 nodes and edges [2018-11-10 13:37:25,043 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_9b063e1b-5453-4515-84ad-47d2893882b3/bin-2019/utaipan/witness.graphml [2018-11-10 13:37:25,043 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-10 13:37:25,044 INFO L168 Benchmark]: Toolchain (without parser) took 413031.32 ms. Allocated memory was 1.0 GB in the beginning and 1.6 GB in the end (delta: 546.8 MB). Free memory was 963.0 MB in the beginning and 1.1 GB in the end (delta: -137.3 MB). Peak memory consumption was 409.5 MB. Max. memory is 11.5 GB. [2018-11-10 13:37:25,044 INFO L168 Benchmark]: CDTParser took 0.14 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 13:37:25,045 INFO L168 Benchmark]: CACSL2BoogieTranslator took 197.08 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 13:37:25,045 INFO L168 Benchmark]: Boogie Procedure Inliner took 25.19 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 13:37:25,045 INFO L168 Benchmark]: Boogie Preprocessor took 18.78 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 13:37:25,045 INFO L168 Benchmark]: RCFGBuilder took 250.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. [2018-11-10 13:37:25,045 INFO L168 Benchmark]: TraceAbstraction took 412485.28 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. [2018-11-10 13:37:25,046 INFO L168 Benchmark]: Witness Printer took 51.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-10 13:37:25,047 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.14 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 197.08 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 25.19 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 18.78 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 250.06 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 130.5 MB). Free memory was 946.9 MB in the beginning and 1.1 GB in the end (delta: -163.6 MB). Peak memory consumption was 15.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 412485.28 ms. Allocated memory was 1.2 GB in the beginning and 1.6 GB in the end (delta: 416.3 MB). Free memory was 1.1 GB in the beginning and 1.1 GB in the end (delta: 4.9 MB). Peak memory consumption was 421.2 MB. Max. memory is 11.5 GB. * Witness Printer took 51.61 ms. Allocated memory is still 1.6 GB. Free memory is still 1.1 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 - 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 - 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: 68]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 105]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - PositiveResult [Line: 37]: call of __VERIFIER_error() unreachable For all program executions holds that call of __VERIFIER_error() unreachable at this location - AllSpecificationsHoldResult: All specifications hold 3 specifications checked. All of them hold - InvariantResult [Line: 21]: Loop Invariant [2018-11-10 13:37:25,053 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,054 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,055 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: main__loop_entered == 0 || ((((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 + 1) && (main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 || unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + (main__index2 + 1))] <= unknown-#memory_int-unknown[main__array][main__array + (-17179869184 * (main__index2 / 4294967296) + 4 * main__index2)] + 4294967296 * ((unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + (main__index2 + 1))] + -unknown-#memory_int-unknown[main__array][main__array + (-17179869184 * (main__index2 / 4294967296) + 4 * main__index2)]) / 4294967296))) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 99999) - InvariantResult [Line: 55]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 24]: Loop Invariant Derived loop invariant: 0 - InvariantResult [Line: 94]: Loop Invariant [2018-11-10 13:37:25,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,056 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,057 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,060 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,061 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int [2018-11-10 13:37:25,061 WARN L1239 BoogieBacktranslator]: unknown boogie variable #memory_int Derived loop invariant: (main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1) || ((((__VERIFIER_assert__cond == 1 && main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 + 1) && (main__index1 + 4294967296 * (main__index2 / 4294967296) <= 4294967296 * (main__index1 / 4294967296) + main__index2 || unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + (main__index2 + 1))] <= unknown-#memory_int-unknown[main__array][main__array + (-17179869184 * (main__index2 / 4294967296) + 4 * main__index2)] + 4294967296 * ((unknown-#memory_int-unknown[main__array][main__array + 4 * (-4294967296 * (main__index2 / 4294967296) + (main__index2 + 1))] + -unknown-#memory_int-unknown[main__array][main__array + (-17179869184 * (main__index2 / 4294967296) + 4 * main__index2)]) / 4294967296))) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && main__index1 <= 4294967296 * ((main__index1 + -1) / 4294967296) + 99999) - InvariantResult [Line: 57]: Loop Invariant Derived loop invariant: (((main__index1 % 4294967296 < main__index2 % 4294967296 && __VERIFIER_assert__cond == 1) && !(0 == main____CPAchecker_TMP_0)) && main__index1 + 4294967296 * ((main__index2 + 1) / 4294967296) <= 4294967296 * ((main__index1 + -1) / 4294967296) + main__index2 + 1) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998 - InvariantResult [Line: 26]: Loop Invariant Derived loop invariant: ((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && main__loop_entered == 0) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2 - InvariantResult [Line: 93]: Loop Invariant Derived loop invariant: 1 - InvariantResult [Line: 41]: Loop Invariant Derived loop invariant: (main__index1 % 4294967296 < main__index2 % 4294967296 && ((__VERIFIER_assert__cond == 1 && (main__index1 + 4294967295) % 4294967296 < (main__index2 + 1) % 4294967296) && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99998) && !(0 == __VERIFIER_assert__cond)) || (((main____CPAchecker_TMP_0 == 1 && main__index2 <= 4294967296 * (main__index2 / 4294967296) + 99999) && __VERIFIER_assert__cond == 1) && main__index1 + 4294967296 * (main__index2 / 4294967296) + 1 <= 4294967296 * (main__index1 / 4294967296) + main__index2) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 3 error locations. SAFE Result, 412.4s OverallTime, 10 OverallIterations, 2 TraceHistogramMax, 149.3s AutomataDifference, 0.0s DeadEndRemovalTime, 54.4s HoareAnnotationTime, HoareTripleCheckerStatistics: 278 SDtfs, 392 SDslu, 453 SDs, 0 SdLazy, 364 SolverSat, 51 SolverUnsat, 17 SolverUnknown, 0 SolverNotchecked, 40.9s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 191 GetRequests, 94 SyntacticMatches, 13 SemanticMatches, 84 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 310.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=37occurred in iteration=7, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 1.9s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 10 MinimizatonAttempts, 120 StatesRemovedByMinimization, 9 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 12 LocationsWithAnnotation, 12 PreInvPairs, 25 NumberOfFragments, 426 HoareAnnotationTreeSize, 12 FomulaSimplifications, 1718 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 12 FomulaSimplificationsInter, 694 FormulaSimplificationTreeSizeReductionInter, 54.3s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.6s SatisfiabilityAnalysisTime, 205.8s InterpolantComputationTime, 238 NumberOfCodeBlocks, 238 NumberOfCodeBlocksAsserted, 12 NumberOfCheckSat, 273 ConstructedInterpolants, 0 QuantifiedInterpolants, 152375 SizeOfPredicates, 22 NumberOfNonLiveVariables, 312 ConjunctsInSsa, 61 ConjunctsInUnsatCore, 14 InterpolantComputations, 10 PerfectInterpolantSequences, 9/15 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...