./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version aa418289 Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan --witnessprinter.witness.filename witness.graphml --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! overflow) ) --witnessprinter.graph.data.producer Taipan --witnessprinter.graph.data.architecture 64bit --witnessprinter.graph.data.programhash 94b61e96441ca10668b436b4ef10dfd9464f0863 ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................ Execution finished normally Writing output log to file Ultimate.log Writing human readable error path to file UltimateCounterExample.errorpath Result: FALSE(OVERFLOW) --- Real Ultimate output --- This is Ultimate 0.1.23-aa41828 [2018-11-23 07:00:37,568 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-11-23 07:00:37,569 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-11-23 07:00:37,578 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-11-23 07:00:37,578 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-11-23 07:00:37,579 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-11-23 07:00:37,580 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-11-23 07:00:37,581 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-11-23 07:00:37,582 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-11-23 07:00:37,582 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-11-23 07:00:37,583 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-11-23 07:00:37,583 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-11-23 07:00:37,584 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-11-23 07:00:37,584 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-11-23 07:00:37,585 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-11-23 07:00:37,585 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-11-23 07:00:37,586 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-11-23 07:00:37,587 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-11-23 07:00:37,588 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-11-23 07:00:37,589 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-11-23 07:00:37,590 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-11-23 07:00:37,591 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-11-23 07:00:37,592 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-11-23 07:00:37,593 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-11-23 07:00:37,593 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-11-23 07:00:37,593 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-11-23 07:00:37,594 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-11-23 07:00:37,594 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-11-23 07:00:37,595 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-11-23 07:00:37,596 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-11-23 07:00:37,596 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-11-23 07:00:37,596 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-11-23 07:00:37,596 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-11-23 07:00:37,597 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-11-23 07:00:37,597 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-11-23 07:00:37,598 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-11-23 07:00:37,598 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-11-23 07:00:37,608 INFO L110 SettingsManager]: Loading preferences was successful [2018-11-23 07:00:37,608 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-11-23 07:00:37,609 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-11-23 07:00:37,609 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-11-23 07:00:37,609 INFO L133 SettingsManager]: * User list type=DISABLED [2018-11-23 07:00:37,609 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Explicit value domain=true [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Octagon Domain=false [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-11-23 07:00:37,610 INFO L133 SettingsManager]: * Interval Domain=false [2018-11-23 07:00:37,611 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-11-23 07:00:37,611 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-11-23 07:00:37,611 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-11-23 07:00:37,611 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-11-23 07:00:37,611 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-11-23 07:00:37,612 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-11-23 07:00:37,612 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-11-23 07:00:37,612 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-11-23 07:00:37,612 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-11-23 07:00:37,612 INFO L133 SettingsManager]: * Use constant arrays=true [2018-11-23 07:00:37,612 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-11-23 07:00:37,612 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-11-23 07:00:37,613 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-11-23 07:00:37,613 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-11-23 07:00:37,613 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-11-23 07:00:37,613 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-11-23 07:00:37,613 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-11-23 07:00:37,613 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-11-23 07:00:37,613 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-11-23 07:00:37,614 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-11-23 07:00:37,614 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-11-23 07:00:37,614 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-11-23 07:00:37,614 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-11-23 07:00:37,614 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_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/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 ! overflow) ) 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 -> 64bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 94b61e96441ca10668b436b4ef10dfd9464f0863 [2018-11-23 07:00:37,635 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-11-23 07:00:37,644 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-11-23 07:00:37,647 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-11-23 07:00:37,648 INFO L271 PluginConnector]: Initializing CDTParser... [2018-11-23 07:00:37,649 INFO L276 PluginConnector]: CDTParser initialized [2018-11-23 07:00:37,649 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c [2018-11-23 07:00:37,684 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/data/3db63ce16/5ca328dd62c0446a8ad39b5842b7b072/FLAG504923b25 [2018-11-23 07:00:38,074 INFO L307 CDTParser]: Found 1 translation units. [2018-11-23 07:00:38,075 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/sv-benchmarks/c/termination-crafted/NonTermination4_false-no-overflow.c [2018-11-23 07:00:38,078 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/data/3db63ce16/5ca328dd62c0446a8ad39b5842b7b072/FLAG504923b25 [2018-11-23 07:00:38,089 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/data/3db63ce16/5ca328dd62c0446a8ad39b5842b7b072 [2018-11-23 07:00:38,091 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-11-23 07:00:38,092 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-11-23 07:00:38,093 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-11-23 07:00:38,093 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-11-23 07:00:38,095 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-11-23 07:00:38,096 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,098 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@63eb5d6f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38, skipping insertion in model container [2018-11-23 07:00:38,098 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,104 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-11-23 07:00:38,115 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-11-23 07:00:38,239 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:00:38,242 INFO L191 MainTranslator]: Completed pre-run [2018-11-23 07:00:38,250 INFO L201 PostProcessor]: Analyzing one entry point: main [2018-11-23 07:00:38,258 INFO L195 MainTranslator]: Completed translation [2018-11-23 07:00:38,259 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38 WrapperNode [2018-11-23 07:00:38,259 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-11-23 07:00:38,259 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-11-23 07:00:38,259 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-11-23 07:00:38,259 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-11-23 07:00:38,264 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,267 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,271 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-11-23 07:00:38,272 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-11-23 07:00:38,272 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-11-23 07:00:38,272 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-11-23 07:00:38,277 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,277 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,278 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,278 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,280 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,283 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,284 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... [2018-11-23 07:00:38,285 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-11-23 07:00:38,285 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-11-23 07:00:38,285 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-11-23 07:00:38,286 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-11-23 07:00:38,286 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/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-23 07:00:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-11-23 07:00:38,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-11-23 07:00:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-11-23 07:00:38,355 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-11-23 07:00:38,355 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-11-23 07:00:38,356 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-11-23 07:00:38,440 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-11-23 07:00:38,440 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-11-23 07:00:38,441 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:00:38 BoogieIcfgContainer [2018-11-23 07:00:38,441 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-11-23 07:00:38,441 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-11-23 07:00:38,441 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-11-23 07:00:38,443 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-11-23 07:00:38,443 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 23.11 07:00:38" (1/3) ... [2018-11-23 07:00:38,443 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5e5195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:00:38, skipping insertion in model container [2018-11-23 07:00:38,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 23.11 07:00:38" (2/3) ... [2018-11-23 07:00:38,444 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@d5e5195 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 23.11 07:00:38, skipping insertion in model container [2018-11-23 07:00:38,444 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:00:38" (3/3) ... [2018-11-23 07:00:38,445 INFO L112 eAbstractionObserver]: Analyzing ICFG NonTermination4_false-no-overflow.c [2018-11-23 07:00:38,451 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-11-23 07:00:38,455 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-11-23 07:00:38,463 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-11-23 07:00:38,481 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-11-23 07:00:38,481 INFO L383 AbstractCegarLoop]: Hoare is true [2018-11-23 07:00:38,481 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-11-23 07:00:38,482 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-11-23 07:00:38,482 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-11-23 07:00:38,482 INFO L387 AbstractCegarLoop]: Difference is false [2018-11-23 07:00:38,482 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-11-23 07:00:38,482 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-11-23 07:00:38,491 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states. [2018-11-23 07:00:38,494 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-11-23 07:00:38,494 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:38,495 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:38,496 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:38,499 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:38,500 INFO L82 PathProgramCache]: Analyzing trace with hash -37667266, now seen corresponding path program 1 times [2018-11-23 07:00:38,501 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:38,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,533 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:38,533 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,533 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:38,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:38,576 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-23 07:00:38,578 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:38,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:00:38,578 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:00:38,582 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:38,593 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:38,593 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:38,595 INFO L87 Difference]: Start difference. First operand 19 states. Second operand 3 states. [2018-11-23 07:00:38,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:38,630 INFO L93 Difference]: Finished difference Result 28 states and 31 transitions. [2018-11-23 07:00:38,630 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:38,631 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-11-23 07:00:38,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:38,638 INFO L225 Difference]: With dead ends: 28 [2018-11-23 07:00:38,639 INFO L226 Difference]: Without dead ends: 17 [2018-11-23 07:00:38,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 07:00:38,654 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 17 states. [2018-11-23 07:00:38,666 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 17 to 16. [2018-11-23 07:00:38,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 07:00:38,669 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 07:00:38,670 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 7 [2018-11-23 07:00:38,670 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:38,670 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 07:00:38,670 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:38,670 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 07:00:38,671 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-11-23 07:00:38,671 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:38,671 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:38,671 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:38,672 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:38,672 INFO L82 PathProgramCache]: Analyzing trace with hash -1167685199, now seen corresponding path program 1 times [2018-11-23 07:00:38,672 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,673 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:38,673 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,674 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:38,676 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:38,696 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-23 07:00:38,696 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:38,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:00:38,697 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:00:38,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:38,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:38,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:38,698 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 3 states. [2018-11-23 07:00:38,711 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:38,711 INFO L93 Difference]: Finished difference Result 16 states and 16 transitions. [2018-11-23 07:00:38,712 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:38,712 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-11-23 07:00:38,712 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:38,712 INFO L225 Difference]: With dead ends: 16 [2018-11-23 07:00:38,712 INFO L226 Difference]: Without dead ends: 15 [2018-11-23 07:00:38,713 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 07:00:38,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15 states. [2018-11-23 07:00:38,714 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15 to 15. [2018-11-23 07:00:38,715 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15 states. [2018-11-23 07:00:38,715 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15 states to 15 states and 15 transitions. [2018-11-23 07:00:38,715 INFO L78 Accepts]: Start accepts. Automaton has 15 states and 15 transitions. Word has length 8 [2018-11-23 07:00:38,715 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:38,715 INFO L480 AbstractCegarLoop]: Abstraction has 15 states and 15 transitions. [2018-11-23 07:00:38,715 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:38,715 INFO L276 IsEmpty]: Start isEmpty. Operand 15 states and 15 transitions. [2018-11-23 07:00:38,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-11-23 07:00:38,716 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:38,716 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:38,716 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:38,716 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:38,716 INFO L82 PathProgramCache]: Analyzing trace with hash -1838502752, now seen corresponding path program 1 times [2018-11-23 07:00:38,716 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,719 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:38,719 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,719 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:38,724 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:38,751 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-23 07:00:38,752 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:38,752 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:00:38,752 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:00:38,752 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:38,752 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:38,752 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:38,753 INFO L87 Difference]: Start difference. First operand 15 states and 15 transitions. Second operand 3 states. [2018-11-23 07:00:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:38,768 INFO L93 Difference]: Finished difference Result 19 states and 20 transitions. [2018-11-23 07:00:38,768 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:38,769 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-11-23 07:00:38,769 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:38,769 INFO L225 Difference]: With dead ends: 19 [2018-11-23 07:00:38,769 INFO L226 Difference]: Without dead ends: 18 [2018-11-23 07:00:38,770 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 07:00:38,770 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2018-11-23 07:00:38,771 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 17. [2018-11-23 07:00:38,771 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 17 states. [2018-11-23 07:00:38,772 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 17 states to 17 states and 17 transitions. [2018-11-23 07:00:38,772 INFO L78 Accepts]: Start accepts. Automaton has 17 states and 17 transitions. Word has length 9 [2018-11-23 07:00:38,772 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:38,772 INFO L480 AbstractCegarLoop]: Abstraction has 17 states and 17 transitions. [2018-11-23 07:00:38,772 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:38,772 INFO L276 IsEmpty]: Start isEmpty. Operand 17 states and 17 transitions. [2018-11-23 07:00:38,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-11-23 07:00:38,772 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:38,772 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:38,773 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:38,773 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:38,773 INFO L82 PathProgramCache]: Analyzing trace with hash -1159010413, now seen corresponding path program 1 times [2018-11-23 07:00:38,773 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:38,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,774 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:38,774 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,774 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:38,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:38,787 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-23 07:00:38,787 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-11-23 07:00:38,787 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-11-23 07:00:38,787 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-11-23 07:00:38,787 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-11-23 07:00:38,787 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-11-23 07:00:38,787 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-11-23 07:00:38,788 INFO L87 Difference]: Start difference. First operand 17 states and 17 transitions. Second operand 3 states. [2018-11-23 07:00:38,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:38,798 INFO L93 Difference]: Finished difference Result 17 states and 17 transitions. [2018-11-23 07:00:38,799 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-11-23 07:00:38,799 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-11-23 07:00:38,799 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:38,799 INFO L225 Difference]: With dead ends: 17 [2018-11-23 07:00:38,799 INFO L226 Difference]: Without dead ends: 16 [2018-11-23 07:00:38,800 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-23 07:00:38,800 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 16 states. [2018-11-23 07:00:38,802 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 16 to 16. [2018-11-23 07:00:38,802 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2018-11-23 07:00:38,803 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 16 transitions. [2018-11-23 07:00:38,803 INFO L78 Accepts]: Start accepts. Automaton has 16 states and 16 transitions. Word has length 10 [2018-11-23 07:00:38,803 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:38,803 INFO L480 AbstractCegarLoop]: Abstraction has 16 states and 16 transitions. [2018-11-23 07:00:38,803 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-11-23 07:00:38,803 INFO L276 IsEmpty]: Start isEmpty. Operand 16 states and 16 transitions. [2018-11-23 07:00:38,804 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-11-23 07:00:38,804 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:38,804 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:38,804 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:38,804 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:38,804 INFO L82 PathProgramCache]: Analyzing trace with hash -1412475851, now seen corresponding path program 1 times [2018-11-23 07:00:38,804 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,805 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:38,805 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:38,806 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:38,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:38,835 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:38,835 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:38,835 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:38,836 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 13 with the following transitions: [2018-11-23 07:00:38,837 INFO L202 CegarAbsIntRunner]: [0], [4], [13], [14], [15], [17], [19], [21], [27], [28], [29] [2018-11-23 07:00:38,856 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:00:38,856 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:00:38,952 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:00:38,953 INFO L272 AbstractInterpreter]: Visited 11 different actions 23 times. Merged at 5 different actions 10 times. Never widened. Performed 67 root evaluator evaluations with a maximum evaluation depth of 3. Performed 67 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-23 07:00:38,959 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:38,959 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:00:38,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:38,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/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-23 07:00:38,966 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:38,966 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:00:38,974 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:38,978 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:39,011 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,011 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:39,035 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,049 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:39,049 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-11-23 07:00:39,049 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:39,050 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:00:39,050 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:00:39,050 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:00:39,050 INFO L87 Difference]: Start difference. First operand 16 states and 16 transitions. Second operand 4 states. [2018-11-23 07:00:39,089 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:39,089 INFO L93 Difference]: Finished difference Result 21 states and 21 transitions. [2018-11-23 07:00:39,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:00:39,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 12 [2018-11-23 07:00:39,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:39,090 INFO L225 Difference]: With dead ends: 21 [2018-11-23 07:00:39,090 INFO L226 Difference]: Without dead ends: 20 [2018-11-23 07:00:39,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 26 GetRequests, 21 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:00:39,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-11-23 07:00:39,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-11-23 07:00:39,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-11-23 07:00:39,093 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 19 transitions. [2018-11-23 07:00:39,093 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 19 transitions. Word has length 12 [2018-11-23 07:00:39,093 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:39,093 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 19 transitions. [2018-11-23 07:00:39,093 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:00:39,093 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 19 transitions. [2018-11-23 07:00:39,094 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-11-23 07:00:39,094 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:39,094 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:39,094 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:39,094 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,094 INFO L82 PathProgramCache]: Analyzing trace with hash -179625769, now seen corresponding path program 1 times [2018-11-23 07:00:39,094 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:39,095 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,096 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:39,096 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,096 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:39,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:39,119 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,119 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,119 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:39,119 INFO L200 CegarAbsIntRunner]: Running AI on error trace of length 15 with the following transitions: [2018-11-23 07:00:39,119 INFO L202 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [18], [19], [21], [27], [28], [29] [2018-11-23 07:00:39,120 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-11-23 07:00:39,121 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-11-23 07:00:39,143 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-11-23 07:00:39,143 INFO L272 AbstractInterpreter]: Visited 11 different actions 23 times. Merged at 5 different actions 10 times. Never widened. Performed 80 root evaluator evaluations with a maximum evaluation depth of 3. Performed 80 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 2 variables. [2018-11-23 07:00:39,146 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,147 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-11-23 07:00:39,147 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,147 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/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-23 07:00:39,153 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:39,153 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:00:39,166 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:39,168 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:39,200 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,200 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:39,244 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,268 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:39,268 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-11-23 07:00:39,268 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:39,268 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-11-23 07:00:39,268 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-11-23 07:00:39,269 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:00:39,269 INFO L87 Difference]: Start difference. First operand 19 states and 19 transitions. Second operand 4 states. [2018-11-23 07:00:39,279 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:39,279 INFO L93 Difference]: Finished difference Result 23 states and 23 transitions. [2018-11-23 07:00:39,280 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-11-23 07:00:39,280 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-11-23 07:00:39,280 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:39,280 INFO L225 Difference]: With dead ends: 23 [2018-11-23 07:00:39,280 INFO L226 Difference]: Without dead ends: 22 [2018-11-23 07:00:39,281 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 25 SyntacticMatches, 1 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-11-23 07:00:39,281 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22 states. [2018-11-23 07:00:39,283 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22 to 21. [2018-11-23 07:00:39,283 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-11-23 07:00:39,284 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 21 transitions. [2018-11-23 07:00:39,284 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 21 transitions. Word has length 14 [2018-11-23 07:00:39,284 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:39,284 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 21 transitions. [2018-11-23 07:00:39,284 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-11-23 07:00:39,284 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 21 transitions. [2018-11-23 07:00:39,284 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-11-23 07:00:39,284 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:39,285 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:39,285 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:39,285 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,285 INFO L82 PathProgramCache]: Analyzing trace with hash 298016926, now seen corresponding path program 2 times [2018-11-23 07:00:39,285 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,286 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:39,286 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,287 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:39,291 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:39,318 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:39,319 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:39,319 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:39,319 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,319 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 4 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:39,325 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:00:39,325 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:00:39,331 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 07:00:39,331 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:39,332 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:39,348 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,348 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:39,381 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,402 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:39,402 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 07:00:39,402 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:39,403 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:00:39,403 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:00:39,403 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:00:39,403 INFO L87 Difference]: Start difference. First operand 21 states and 21 transitions. Second operand 5 states. [2018-11-23 07:00:39,420 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:39,420 INFO L93 Difference]: Finished difference Result 26 states and 26 transitions. [2018-11-23 07:00:39,421 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:00:39,421 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 17 [2018-11-23 07:00:39,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:39,422 INFO L225 Difference]: With dead ends: 26 [2018-11-23 07:00:39,422 INFO L226 Difference]: Without dead ends: 25 [2018-11-23 07:00:39,422 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:00:39,422 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-11-23 07:00:39,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-11-23 07:00:39,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-11-23 07:00:39,425 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 24 transitions. [2018-11-23 07:00:39,426 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 24 transitions. Word has length 17 [2018-11-23 07:00:39,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:39,426 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 24 transitions. [2018-11-23 07:00:39,426 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:00:39,426 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 24 transitions. [2018-11-23 07:00:39,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2018-11-23 07:00:39,426 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:39,427 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:39,427 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:39,427 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,427 INFO L82 PathProgramCache]: Analyzing trace with hash -1368541440, now seen corresponding path program 2 times [2018-11-23 07:00:39,427 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,428 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:39,428 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,428 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:39,433 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:39,462 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:39,463 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:39,463 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:39,463 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,463 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 5 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:39,474 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:00:39,474 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:00:39,479 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-11-23 07:00:39,479 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:39,480 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:39,494 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,494 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:39,537 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,551 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:39,551 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-11-23 07:00:39,551 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:39,551 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-11-23 07:00:39,551 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-11-23 07:00:39,551 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:00:39,551 INFO L87 Difference]: Start difference. First operand 24 states and 24 transitions. Second operand 5 states. [2018-11-23 07:00:39,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:39,561 INFO L93 Difference]: Finished difference Result 28 states and 28 transitions. [2018-11-23 07:00:39,561 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-11-23 07:00:39,561 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 19 [2018-11-23 07:00:39,562 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:39,562 INFO L225 Difference]: With dead ends: 28 [2018-11-23 07:00:39,562 INFO L226 Difference]: Without dead ends: 27 [2018-11-23 07:00:39,562 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-11-23 07:00:39,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 27 states. [2018-11-23 07:00:39,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 27 to 26. [2018-11-23 07:00:39,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-11-23 07:00:39,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 26 transitions. [2018-11-23 07:00:39,564 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 26 transitions. Word has length 19 [2018-11-23 07:00:39,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:39,565 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 26 transitions. [2018-11-23 07:00:39,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-11-23 07:00:39,565 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 26 transitions. [2018-11-23 07:00:39,565 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-11-23 07:00:39,565 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:39,565 INFO L402 BasicCegarLoop]: trace histogram [4, 3, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:39,566 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:39,566 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,566 INFO L82 PathProgramCache]: Analyzing trace with hash 1906552277, now seen corresponding path program 3 times [2018-11-23 07:00:39,566 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,567 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:39,567 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,567 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:39,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:39,604 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:39,605 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:39,605 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:39,605 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,605 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 6 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:39,616 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:00:39,616 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:00:39,622 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:00:39,623 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:39,624 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:39,679 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,680 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:39,709 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,723 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:39,723 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 07:00:39,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:39,724 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:00:39,724 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:00:39,724 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:00:39,724 INFO L87 Difference]: Start difference. First operand 26 states and 26 transitions. Second operand 6 states. [2018-11-23 07:00:39,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:39,760 INFO L93 Difference]: Finished difference Result 31 states and 31 transitions. [2018-11-23 07:00:39,761 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:00:39,761 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 22 [2018-11-23 07:00:39,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:39,761 INFO L225 Difference]: With dead ends: 31 [2018-11-23 07:00:39,762 INFO L226 Difference]: Without dead ends: 30 [2018-11-23 07:00:39,762 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 37 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:00:39,762 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2018-11-23 07:00:39,764 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 29. [2018-11-23 07:00:39,764 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-11-23 07:00:39,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 29 transitions. [2018-11-23 07:00:39,765 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 29 transitions. Word has length 22 [2018-11-23 07:00:39,765 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:39,765 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 29 transitions. [2018-11-23 07:00:39,765 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:00:39,765 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 29 transitions. [2018-11-23 07:00:39,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-11-23 07:00:39,766 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:39,766 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:39,766 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:39,766 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,767 INFO L82 PathProgramCache]: Analyzing trace with hash -1754295689, now seen corresponding path program 3 times [2018-11-23 07:00:39,767 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,768 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:39,768 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,768 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:39,773 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:39,821 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,821 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,821 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:39,822 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:39,822 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:39,822 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:39,822 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 7 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:39,828 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:00:39,829 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:00:39,833 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:00:39,834 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:39,835 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:39,861 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,862 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:39,942 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 27 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:39,966 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:39,966 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-11-23 07:00:39,966 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:39,967 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-11-23 07:00:39,967 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-11-23 07:00:39,967 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:00:39,967 INFO L87 Difference]: Start difference. First operand 29 states and 29 transitions. Second operand 6 states. [2018-11-23 07:00:39,977 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:39,978 INFO L93 Difference]: Finished difference Result 33 states and 33 transitions. [2018-11-23 07:00:39,978 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-11-23 07:00:39,978 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 24 [2018-11-23 07:00:39,978 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:39,979 INFO L225 Difference]: With dead ends: 33 [2018-11-23 07:00:39,979 INFO L226 Difference]: Without dead ends: 32 [2018-11-23 07:00:39,979 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 41 SyntacticMatches, 3 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-11-23 07:00:39,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-11-23 07:00:39,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 31. [2018-11-23 07:00:39,982 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-11-23 07:00:39,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 31 transitions. [2018-11-23 07:00:39,982 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 31 transitions. Word has length 24 [2018-11-23 07:00:39,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:39,982 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 31 transitions. [2018-11-23 07:00:39,982 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-11-23 07:00:39,982 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 31 transitions. [2018-11-23 07:00:39,983 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2018-11-23 07:00:39,983 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:39,983 INFO L402 BasicCegarLoop]: trace histogram [5, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:39,983 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:39,983 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:39,983 INFO L82 PathProgramCache]: Analyzing trace with hash -1060762882, now seen corresponding path program 4 times [2018-11-23 07:00:39,983 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:39,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,984 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:39,984 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:39,984 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:39,989 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,030 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:40,031 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:40,031 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:40,031 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,031 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 8 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:40,038 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:40,038 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:00:40,046 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,047 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:40,080 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,080 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:40,122 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 0 proven. 38 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,137 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:40,137 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 07:00:40,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:40,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:00:40,138 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:00:40,138 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:00:40,138 INFO L87 Difference]: Start difference. First operand 31 states and 31 transitions. Second operand 7 states. [2018-11-23 07:00:40,159 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:40,159 INFO L93 Difference]: Finished difference Result 36 states and 36 transitions. [2018-11-23 07:00:40,159 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:00:40,160 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 27 [2018-11-23 07:00:40,160 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:40,161 INFO L225 Difference]: With dead ends: 36 [2018-11-23 07:00:40,161 INFO L226 Difference]: Without dead ends: 35 [2018-11-23 07:00:40,161 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 45 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:00:40,161 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-11-23 07:00:40,163 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 34. [2018-11-23 07:00:40,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-11-23 07:00:40,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 34 transitions. [2018-11-23 07:00:40,164 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 34 transitions. Word has length 27 [2018-11-23 07:00:40,164 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:40,164 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 34 transitions. [2018-11-23 07:00:40,164 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:00:40,164 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 34 transitions. [2018-11-23 07:00:40,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-11-23 07:00:40,165 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:40,165 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:40,165 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:40,165 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:40,166 INFO L82 PathProgramCache]: Analyzing trace with hash -1485878944, now seen corresponding path program 4 times [2018-11-23 07:00:40,166 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:40,166 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,167 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:40,167 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,167 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:40,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,193 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,193 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,193 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:40,194 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:40,194 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:40,194 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,194 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 9 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:40,201 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:40,202 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:00:40,206 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,207 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:40,246 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,247 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:40,336 INFO L134 CoverageAnalysis]: Checked inductivity of 46 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,350 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:40,350 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-11-23 07:00:40,350 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:40,351 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-11-23 07:00:40,351 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-11-23 07:00:40,351 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:00:40,351 INFO L87 Difference]: Start difference. First operand 34 states and 34 transitions. Second operand 7 states. [2018-11-23 07:00:40,364 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:40,364 INFO L93 Difference]: Finished difference Result 38 states and 38 transitions. [2018-11-23 07:00:40,364 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-11-23 07:00:40,364 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-11-23 07:00:40,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:40,365 INFO L225 Difference]: With dead ends: 38 [2018-11-23 07:00:40,365 INFO L226 Difference]: Without dead ends: 37 [2018-11-23 07:00:40,365 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 49 SyntacticMatches, 4 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-11-23 07:00:40,365 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-11-23 07:00:40,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 36. [2018-11-23 07:00:40,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-11-23 07:00:40,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 36 transitions. [2018-11-23 07:00:40,368 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 36 transitions. Word has length 29 [2018-11-23 07:00:40,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:40,368 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 36 transitions. [2018-11-23 07:00:40,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-11-23 07:00:40,368 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 36 transitions. [2018-11-23 07:00:40,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-11-23 07:00:40,369 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:40,369 INFO L402 BasicCegarLoop]: trace histogram [6, 5, 5, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:40,369 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:40,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:40,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1886617739, now seen corresponding path program 5 times [2018-11-23 07:00:40,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:40,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,371 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:40,371 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,371 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:40,374 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,416 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,416 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,416 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:40,416 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:40,416 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:40,417 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,417 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 10 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:40,423 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:00:40,423 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:00:40,430 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 07:00:40,430 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:40,431 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:40,466 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,466 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:40,519 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,544 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:40,544 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 07:00:40,544 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:40,545 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:00:40,545 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:00:40,545 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:00:40,545 INFO L87 Difference]: Start difference. First operand 36 states and 36 transitions. Second operand 8 states. [2018-11-23 07:00:40,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:40,596 INFO L93 Difference]: Finished difference Result 41 states and 41 transitions. [2018-11-23 07:00:40,596 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:00:40,596 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 32 [2018-11-23 07:00:40,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:40,597 INFO L225 Difference]: With dead ends: 41 [2018-11-23 07:00:40,597 INFO L226 Difference]: Without dead ends: 40 [2018-11-23 07:00:40,597 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 53 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:00:40,597 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 40 states. [2018-11-23 07:00:40,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 40 to 39. [2018-11-23 07:00:40,600 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 39 states. [2018-11-23 07:00:40,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 39 states to 39 states and 39 transitions. [2018-11-23 07:00:40,601 INFO L78 Accepts]: Start accepts. Automaton has 39 states and 39 transitions. Word has length 32 [2018-11-23 07:00:40,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:40,601 INFO L480 AbstractCegarLoop]: Abstraction has 39 states and 39 transitions. [2018-11-23 07:00:40,601 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:00:40,601 INFO L276 IsEmpty]: Start isEmpty. Operand 39 states and 39 transitions. [2018-11-23 07:00:40,601 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2018-11-23 07:00:40,601 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:40,601 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:40,602 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:40,602 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:40,602 INFO L82 PathProgramCache]: Analyzing trace with hash -563446761, now seen corresponding path program 5 times [2018-11-23 07:00:40,602 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,603 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:40,603 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,603 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:40,607 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,651 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:40,652 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:40,652 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:40,652 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,652 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 11 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:40,659 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:00:40,659 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:00:40,679 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-11-23 07:00:40,680 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:40,681 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:40,721 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,721 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:40,837 INFO L134 CoverageAnalysis]: Checked inductivity of 70 backedges. 0 proven. 70 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,855 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:40,855 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-11-23 07:00:40,855 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:40,856 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-11-23 07:00:40,856 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-11-23 07:00:40,856 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:00:40,856 INFO L87 Difference]: Start difference. First operand 39 states and 39 transitions. Second operand 8 states. [2018-11-23 07:00:40,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:40,871 INFO L93 Difference]: Finished difference Result 43 states and 43 transitions. [2018-11-23 07:00:40,872 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-11-23 07:00:40,872 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 34 [2018-11-23 07:00:40,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:40,872 INFO L225 Difference]: With dead ends: 43 [2018-11-23 07:00:40,873 INFO L226 Difference]: Without dead ends: 42 [2018-11-23 07:00:40,873 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 57 SyntacticMatches, 5 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-11-23 07:00:40,873 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 42 states. [2018-11-23 07:00:40,875 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 42 to 41. [2018-11-23 07:00:40,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 41 states. [2018-11-23 07:00:40,875 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 41 states to 41 states and 41 transitions. [2018-11-23 07:00:40,875 INFO L78 Accepts]: Start accepts. Automaton has 41 states and 41 transitions. Word has length 34 [2018-11-23 07:00:40,876 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:40,876 INFO L480 AbstractCegarLoop]: Abstraction has 41 states and 41 transitions. [2018-11-23 07:00:40,876 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-11-23 07:00:40,876 INFO L276 IsEmpty]: Start isEmpty. Operand 41 states and 41 transitions. [2018-11-23 07:00:40,876 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-11-23 07:00:40,876 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:40,876 INFO L402 BasicCegarLoop]: trace histogram [7, 6, 6, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:40,877 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:40,877 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:40,877 INFO L82 PathProgramCache]: Analyzing trace with hash -910213794, now seen corresponding path program 6 times [2018-11-23 07:00:40,877 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,878 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:40,878 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:40,878 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:40,882 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:40,936 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:40,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:40,936 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:40,936 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:40,936 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:40,936 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 12 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:40,952 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:00:40,952 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:00:40,959 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:00:40,959 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:40,960 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:41,007 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,008 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:41,058 INFO L134 CoverageAnalysis]: Checked inductivity of 87 backedges. 0 proven. 87 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,072 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:41,073 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-23 07:00:41,073 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:41,073 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 07:00:41,073 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:00:41,073 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:00:41,073 INFO L87 Difference]: Start difference. First operand 41 states and 41 transitions. Second operand 9 states. [2018-11-23 07:00:41,091 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:41,091 INFO L93 Difference]: Finished difference Result 46 states and 46 transitions. [2018-11-23 07:00:41,091 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:00:41,091 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-11-23 07:00:41,091 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:41,092 INFO L225 Difference]: With dead ends: 46 [2018-11-23 07:00:41,092 INFO L226 Difference]: Without dead ends: 45 [2018-11-23 07:00:41,092 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 61 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:00:41,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 45 states. [2018-11-23 07:00:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 45 to 44. [2018-11-23 07:00:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-11-23 07:00:41,095 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 44 transitions. [2018-11-23 07:00:41,095 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 44 transitions. Word has length 37 [2018-11-23 07:00:41,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:41,095 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 44 transitions. [2018-11-23 07:00:41,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 07:00:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 44 transitions. [2018-11-23 07:00:41,096 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-11-23 07:00:41,096 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:41,096 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:41,096 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:41,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash 1457873856, now seen corresponding path program 6 times [2018-11-23 07:00:41,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:41,097 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:41,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:41,101 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:41,141 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,141 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:41,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:41,142 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:41,142 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:41,142 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:41,142 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 13 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:41,152 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:00:41,152 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:00:41,158 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:00:41,158 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:41,159 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:41,196 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,196 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:41,346 INFO L134 CoverageAnalysis]: Checked inductivity of 99 backedges. 0 proven. 99 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,364 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:41,364 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-11-23 07:00:41,364 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:41,364 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-11-23 07:00:41,364 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-11-23 07:00:41,365 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:00:41,365 INFO L87 Difference]: Start difference. First operand 44 states and 44 transitions. Second operand 9 states. [2018-11-23 07:00:41,376 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:41,377 INFO L93 Difference]: Finished difference Result 48 states and 48 transitions. [2018-11-23 07:00:41,377 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-11-23 07:00:41,377 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 39 [2018-11-23 07:00:41,377 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:41,377 INFO L225 Difference]: With dead ends: 48 [2018-11-23 07:00:41,377 INFO L226 Difference]: Without dead ends: 47 [2018-11-23 07:00:41,378 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 65 SyntacticMatches, 6 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 15 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-11-23 07:00:41,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2018-11-23 07:00:41,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 46. [2018-11-23 07:00:41,380 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 46 states. [2018-11-23 07:00:41,380 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 46 transitions. [2018-11-23 07:00:41,380 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 46 transitions. Word has length 39 [2018-11-23 07:00:41,380 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:41,380 INFO L480 AbstractCegarLoop]: Abstraction has 46 states and 46 transitions. [2018-11-23 07:00:41,380 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-11-23 07:00:41,381 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 46 transitions. [2018-11-23 07:00:41,381 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-11-23 07:00:41,381 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:41,381 INFO L402 BasicCegarLoop]: trace histogram [8, 7, 7, 7, 7, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:41,381 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:41,381 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:41,381 INFO L82 PathProgramCache]: Analyzing trace with hash 810797333, now seen corresponding path program 7 times [2018-11-23 07:00:41,382 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:41,382 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:41,383 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:41,383 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:41,383 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:41,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:41,431 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,431 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:41,431 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:41,431 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:41,431 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:41,432 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:41,432 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 14 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:41,443 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:41,443 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:00:41,450 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:41,452 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:41,583 INFO L134 CoverageAnalysis]: Checked inductivity of 119 backedges. 0 proven. 119 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,607 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:41,607 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-23 07:00:41,607 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:41,608 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 07:00:41,608 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:00:41,608 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 07:00:41,608 INFO L87 Difference]: Start difference. First operand 46 states and 46 transitions. Second operand 10 states. [2018-11-23 07:00:41,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:41,627 INFO L93 Difference]: Finished difference Result 51 states and 51 transitions. [2018-11-23 07:00:41,628 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:00:41,628 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 42 [2018-11-23 07:00:41,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:41,628 INFO L225 Difference]: With dead ends: 51 [2018-11-23 07:00:41,628 INFO L226 Difference]: Without dead ends: 50 [2018-11-23 07:00:41,628 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 69 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 07:00:41,628 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 50 states. [2018-11-23 07:00:41,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 50 to 49. [2018-11-23 07:00:41,630 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-11-23 07:00:41,630 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 49 transitions. [2018-11-23 07:00:41,630 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 49 transitions. Word has length 42 [2018-11-23 07:00:41,630 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:41,631 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 49 transitions. [2018-11-23 07:00:41,631 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 07:00:41,631 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 49 transitions. [2018-11-23 07:00:41,631 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2018-11-23 07:00:41,631 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:41,631 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:41,631 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:41,631 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:41,631 INFO L82 PathProgramCache]: Analyzing trace with hash 1787157943, now seen corresponding path program 7 times [2018-11-23 07:00:41,632 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:41,632 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:41,632 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:41,632 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:41,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:41,694 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:41,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:41,694 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:41,694 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:41,694 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:41,694 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 15 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:41,701 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:41,701 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:00:41,707 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:41,708 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:41,774 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:41,774 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:42,045 INFO L134 CoverageAnalysis]: Checked inductivity of 133 backedges. 0 proven. 133 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:42,060 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:42,060 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-11-23 07:00:42,060 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:42,060 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-11-23 07:00:42,060 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-11-23 07:00:42,060 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 07:00:42,060 INFO L87 Difference]: Start difference. First operand 49 states and 49 transitions. Second operand 10 states. [2018-11-23 07:00:42,075 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:42,075 INFO L93 Difference]: Finished difference Result 53 states and 53 transitions. [2018-11-23 07:00:42,076 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-11-23 07:00:42,076 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 44 [2018-11-23 07:00:42,076 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:42,076 INFO L225 Difference]: With dead ends: 53 [2018-11-23 07:00:42,076 INFO L226 Difference]: Without dead ends: 52 [2018-11-23 07:00:42,077 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 73 SyntacticMatches, 7 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 21 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-11-23 07:00:42,077 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 52 states. [2018-11-23 07:00:42,079 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 52 to 51. [2018-11-23 07:00:42,079 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 51 states. [2018-11-23 07:00:42,079 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 51 states to 51 states and 51 transitions. [2018-11-23 07:00:42,079 INFO L78 Accepts]: Start accepts. Automaton has 51 states and 51 transitions. Word has length 44 [2018-11-23 07:00:42,080 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:42,080 INFO L480 AbstractCegarLoop]: Abstraction has 51 states and 51 transitions. [2018-11-23 07:00:42,080 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-11-23 07:00:42,080 INFO L276 IsEmpty]: Start isEmpty. Operand 51 states and 51 transitions. [2018-11-23 07:00:42,080 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 48 [2018-11-23 07:00:42,080 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:42,080 INFO L402 BasicCegarLoop]: trace histogram [9, 8, 8, 8, 8, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:42,081 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:42,081 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:42,081 INFO L82 PathProgramCache]: Analyzing trace with hash 807729086, now seen corresponding path program 8 times [2018-11-23 07:00:42,081 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:42,082 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:00:42,082 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:42,082 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:42,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:42,121 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:42,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:42,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:42,122 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:42,122 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:42,122 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:42,122 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 16 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:42,129 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:00:42,129 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:00:42,144 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 07:00:42,144 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:42,145 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:42,198 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:42,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:42,271 INFO L134 CoverageAnalysis]: Checked inductivity of 156 backedges. 0 proven. 156 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:42,286 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:42,286 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-23 07:00:42,286 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:42,286 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 07:00:42,286 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 07:00:42,286 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 07:00:42,287 INFO L87 Difference]: Start difference. First operand 51 states and 51 transitions. Second operand 11 states. [2018-11-23 07:00:42,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:42,312 INFO L93 Difference]: Finished difference Result 56 states and 56 transitions. [2018-11-23 07:00:42,312 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 07:00:42,312 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 47 [2018-11-23 07:00:42,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:42,313 INFO L225 Difference]: With dead ends: 56 [2018-11-23 07:00:42,313 INFO L226 Difference]: Without dead ends: 55 [2018-11-23 07:00:42,313 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 77 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-11-23 07:00:42,313 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 55 states. [2018-11-23 07:00:42,316 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 55 to 54. [2018-11-23 07:00:42,316 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-11-23 07:00:42,316 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 54 transitions. [2018-11-23 07:00:42,316 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 54 transitions. Word has length 47 [2018-11-23 07:00:42,317 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:42,317 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 54 transitions. [2018-11-23 07:00:42,317 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 07:00:42,317 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 54 transitions. [2018-11-23 07:00:42,317 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-11-23 07:00:42,317 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:42,318 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:42,318 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:42,318 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:42,318 INFO L82 PathProgramCache]: Analyzing trace with hash -1161427424, now seen corresponding path program 8 times [2018-11-23 07:00:42,318 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:42,319 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:42,319 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:42,319 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:42,323 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:42,375 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:42,375 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:42,375 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:42,376 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:42,376 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:42,376 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:42,376 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 17 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:42,383 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:00:42,383 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:00:42,392 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-11-23 07:00:42,392 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:42,393 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:42,445 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 172 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:42,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:46,777 INFO L134 CoverageAnalysis]: Checked inductivity of 172 backedges. 0 proven. 167 refuted. 5 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:46,791 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:46,791 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-11-23 07:00:46,791 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:46,792 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-11-23 07:00:46,792 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-11-23 07:00:46,792 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=189, Unknown=1, NotChecked=0, Total=380 [2018-11-23 07:00:46,792 INFO L87 Difference]: Start difference. First operand 54 states and 54 transitions. Second operand 11 states. [2018-11-23 07:00:46,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:46,807 INFO L93 Difference]: Finished difference Result 58 states and 58 transitions. [2018-11-23 07:00:46,807 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-11-23 07:00:46,807 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 49 [2018-11-23 07:00:46,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:46,808 INFO L225 Difference]: With dead ends: 58 [2018-11-23 07:00:46,808 INFO L226 Difference]: Without dead ends: 57 [2018-11-23 07:00:46,808 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 107 GetRequests, 81 SyntacticMatches, 8 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 28 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=190, Invalid=189, Unknown=1, NotChecked=0, Total=380 [2018-11-23 07:00:46,808 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-11-23 07:00:46,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 56. [2018-11-23 07:00:46,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 56 states. [2018-11-23 07:00:46,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 56 states to 56 states and 56 transitions. [2018-11-23 07:00:46,811 INFO L78 Accepts]: Start accepts. Automaton has 56 states and 56 transitions. Word has length 49 [2018-11-23 07:00:46,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:46,812 INFO L480 AbstractCegarLoop]: Abstraction has 56 states and 56 transitions. [2018-11-23 07:00:46,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-11-23 07:00:46,812 INFO L276 IsEmpty]: Start isEmpty. Operand 56 states and 56 transitions. [2018-11-23 07:00:46,812 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2018-11-23 07:00:46,812 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:46,812 INFO L402 BasicCegarLoop]: trace histogram [10, 9, 9, 9, 9, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:46,813 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:46,813 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:46,813 INFO L82 PathProgramCache]: Analyzing trace with hash 172198581, now seen corresponding path program 9 times [2018-11-23 07:00:46,813 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:46,814 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:46,814 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:46,814 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:46,819 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:46,893 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:46,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:46,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:46,893 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:46,893 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:46,893 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:46,893 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 18 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:46,906 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:00:46,906 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:00:46,916 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:00:46,916 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:46,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:46,982 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:46,982 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:00:47,077 INFO L134 CoverageAnalysis]: Checked inductivity of 198 backedges. 0 proven. 198 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:47,092 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:00:47,092 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-23 07:00:47,092 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:00:47,092 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 07:00:47,092 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 07:00:47,092 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 07:00:47,092 INFO L87 Difference]: Start difference. First operand 56 states and 56 transitions. Second operand 12 states. [2018-11-23 07:00:47,117 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:00:47,117 INFO L93 Difference]: Finished difference Result 61 states and 61 transitions. [2018-11-23 07:00:47,118 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 07:00:47,118 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 52 [2018-11-23 07:00:47,118 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:00:47,118 INFO L225 Difference]: With dead ends: 61 [2018-11-23 07:00:47,118 INFO L226 Difference]: Without dead ends: 60 [2018-11-23 07:00:47,119 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 85 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 36 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-11-23 07:00:47,119 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 60 states. [2018-11-23 07:00:47,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 60 to 59. [2018-11-23 07:00:47,121 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-11-23 07:00:47,121 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 59 transitions. [2018-11-23 07:00:47,121 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 59 transitions. Word has length 52 [2018-11-23 07:00:47,121 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:00:47,121 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 59 transitions. [2018-11-23 07:00:47,121 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 07:00:47,121 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 59 transitions. [2018-11-23 07:00:47,122 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2018-11-23 07:00:47,122 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:00:47,122 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-11-23 07:00:47,122 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:00:47,122 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:00:47,123 INFO L82 PathProgramCache]: Analyzing trace with hash -2020886697, now seen corresponding path program 9 times [2018-11-23 07:00:47,123 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:00:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:47,124 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:00:47,124 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:00:47,124 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:00:47,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:00:47,175 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:47,175 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:47,175 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:00:47,176 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:00:47,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:00:47,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:00:47,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 19 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:00:47,184 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:00:47,184 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:00:47,191 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:00:47,191 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:00:47,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:00:47,257 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:00:47,258 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:00,311 INFO L134 CoverageAnalysis]: Checked inductivity of 216 backedges. 0 proven. 216 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:00,333 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:00,333 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-11-23 07:01:00,333 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:00,333 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-11-23 07:01:00,334 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-11-23 07:01:00,334 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=231, Unknown=1, NotChecked=0, Total=462 [2018-11-23 07:01:00,334 INFO L87 Difference]: Start difference. First operand 59 states and 59 transitions. Second operand 12 states. [2018-11-23 07:01:00,351 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:00,351 INFO L93 Difference]: Finished difference Result 63 states and 63 transitions. [2018-11-23 07:01:00,351 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-11-23 07:01:00,351 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 54 [2018-11-23 07:01:00,351 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:00,352 INFO L225 Difference]: With dead ends: 63 [2018-11-23 07:01:00,352 INFO L226 Difference]: Without dead ends: 62 [2018-11-23 07:01:00,352 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 89 SyntacticMatches, 9 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 38 ImplicationChecksByTransitivity, 13.0s TimeCoverageRelationStatistics Valid=230, Invalid=231, Unknown=1, NotChecked=0, Total=462 [2018-11-23 07:01:00,352 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62 states. [2018-11-23 07:01:00,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62 to 61. [2018-11-23 07:01:00,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 61 states. [2018-11-23 07:01:00,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 61 states to 61 states and 61 transitions. [2018-11-23 07:01:00,355 INFO L78 Accepts]: Start accepts. Automaton has 61 states and 61 transitions. Word has length 54 [2018-11-23 07:01:00,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:00,355 INFO L480 AbstractCegarLoop]: Abstraction has 61 states and 61 transitions. [2018-11-23 07:01:00,355 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-11-23 07:01:00,355 INFO L276 IsEmpty]: Start isEmpty. Operand 61 states and 61 transitions. [2018-11-23 07:01:00,355 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2018-11-23 07:01:00,355 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:00,355 INFO L402 BasicCegarLoop]: trace histogram [11, 10, 10, 10, 10, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:00,355 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:00,356 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:00,356 INFO L82 PathProgramCache]: Analyzing trace with hash -1678951906, now seen corresponding path program 10 times [2018-11-23 07:01:00,356 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:00,356 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:00,356 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:00,356 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:00,359 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:00,413 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:00,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:00,413 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:00,413 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:00,413 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:00,413 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 20 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:00,422 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:00,422 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:00,429 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:00,430 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:00,501 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:00,501 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:00,595 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:00,610 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:00,610 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-23 07:01:00,610 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:00,610 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 07:01:00,610 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 07:01:00,610 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 07:01:00,611 INFO L87 Difference]: Start difference. First operand 61 states and 61 transitions. Second operand 13 states. [2018-11-23 07:01:00,640 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:00,640 INFO L93 Difference]: Finished difference Result 66 states and 66 transitions. [2018-11-23 07:01:00,641 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 07:01:00,641 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 57 [2018-11-23 07:01:00,641 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:00,641 INFO L225 Difference]: With dead ends: 66 [2018-11-23 07:01:00,641 INFO L226 Difference]: Without dead ends: 65 [2018-11-23 07:01:00,641 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 125 GetRequests, 93 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-11-23 07:01:00,641 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-11-23 07:01:00,643 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 64. [2018-11-23 07:01:00,643 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 64 states. [2018-11-23 07:01:00,644 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 64 transitions. [2018-11-23 07:01:00,644 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 64 transitions. Word has length 57 [2018-11-23 07:01:00,644 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:00,644 INFO L480 AbstractCegarLoop]: Abstraction has 64 states and 64 transitions. [2018-11-23 07:01:00,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 07:01:00,644 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 64 transitions. [2018-11-23 07:01:00,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2018-11-23 07:01:00,644 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:00,644 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:00,645 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:00,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:00,645 INFO L82 PathProgramCache]: Analyzing trace with hash 1434923136, now seen corresponding path program 10 times [2018-11-23 07:01:00,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:00,645 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:00,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:00,645 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:00,649 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:00,703 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:00,703 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:00,703 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:00,703 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:00,704 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:00,704 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 21 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:00,710 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:00,710 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:00,718 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:00,718 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:00,783 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:00,783 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:09,203 INFO L134 CoverageAnalysis]: Checked inductivity of 265 backedges. 0 proven. 265 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:09,217 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:09,218 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-11-23 07:01:09,218 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:09,218 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-11-23 07:01:09,218 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-11-23 07:01:09,218 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=275, Invalid=276, Unknown=1, NotChecked=0, Total=552 [2018-11-23 07:01:09,218 INFO L87 Difference]: Start difference. First operand 64 states and 64 transitions. Second operand 13 states. [2018-11-23 07:01:09,238 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:09,238 INFO L93 Difference]: Finished difference Result 68 states and 68 transitions. [2018-11-23 07:01:09,238 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-11-23 07:01:09,238 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 59 [2018-11-23 07:01:09,238 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:09,238 INFO L225 Difference]: With dead ends: 68 [2018-11-23 07:01:09,239 INFO L226 Difference]: Without dead ends: 67 [2018-11-23 07:01:09,239 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 97 SyntacticMatches, 10 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 86 ImplicationChecksByTransitivity, 8.4s TimeCoverageRelationStatistics Valid=275, Invalid=276, Unknown=1, NotChecked=0, Total=552 [2018-11-23 07:01:09,239 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2018-11-23 07:01:09,240 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 66. [2018-11-23 07:01:09,240 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 66 states. [2018-11-23 07:01:09,240 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 66 transitions. [2018-11-23 07:01:09,240 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 66 transitions. Word has length 59 [2018-11-23 07:01:09,241 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:09,241 INFO L480 AbstractCegarLoop]: Abstraction has 66 states and 66 transitions. [2018-11-23 07:01:09,241 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-11-23 07:01:09,241 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 66 transitions. [2018-11-23 07:01:09,241 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 63 [2018-11-23 07:01:09,241 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:09,241 INFO L402 BasicCegarLoop]: trace histogram [12, 11, 11, 11, 11, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:09,241 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:09,241 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:09,241 INFO L82 PathProgramCache]: Analyzing trace with hash -14302123, now seen corresponding path program 11 times [2018-11-23 07:01:09,241 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:09,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:09,242 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:09,242 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:09,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:09,328 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:09,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:09,328 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:09,328 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:09,328 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:09,328 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:09,329 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 22 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:09,340 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:01:09,340 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:01:09,351 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 07:01:09,351 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:09,353 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:09,445 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:09,445 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:09,563 INFO L134 CoverageAnalysis]: Checked inductivity of 297 backedges. 0 proven. 297 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:09,578 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:09,578 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-23 07:01:09,578 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:09,578 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:01:09,578 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:01:09,578 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 07:01:09,579 INFO L87 Difference]: Start difference. First operand 66 states and 66 transitions. Second operand 14 states. [2018-11-23 07:01:09,617 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:09,617 INFO L93 Difference]: Finished difference Result 71 states and 71 transitions. [2018-11-23 07:01:09,617 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 07:01:09,617 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 62 [2018-11-23 07:01:09,617 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:09,618 INFO L225 Difference]: With dead ends: 71 [2018-11-23 07:01:09,618 INFO L226 Difference]: Without dead ends: 70 [2018-11-23 07:01:09,618 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 101 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 55 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 07:01:09,618 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2018-11-23 07:01:09,619 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 69. [2018-11-23 07:01:09,620 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 69 states. [2018-11-23 07:01:09,620 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 69 transitions. [2018-11-23 07:01:09,620 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 69 transitions. Word has length 62 [2018-11-23 07:01:09,620 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:09,620 INFO L480 AbstractCegarLoop]: Abstraction has 69 states and 69 transitions. [2018-11-23 07:01:09,620 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:01:09,620 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 69 transitions. [2018-11-23 07:01:09,621 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2018-11-23 07:01:09,621 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:09,621 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:09,621 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:09,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:09,621 INFO L82 PathProgramCache]: Analyzing trace with hash -859436809, now seen corresponding path program 11 times [2018-11-23 07:01:09,622 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:09,622 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:09,622 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:09,623 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:09,627 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:09,728 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:09,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:09,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:09,729 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:09,729 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:09,729 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:09,729 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 23 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:09,739 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:01:09,739 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:01:09,755 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-11-23 07:01:09,755 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:09,756 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:09,893 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:09,893 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:10,730 INFO L134 CoverageAnalysis]: Checked inductivity of 319 backedges. 0 proven. 319 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:10,745 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:10,745 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-11-23 07:01:10,745 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:10,745 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-11-23 07:01:10,745 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-11-23 07:01:10,745 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 07:01:10,745 INFO L87 Difference]: Start difference. First operand 69 states and 69 transitions. Second operand 14 states. [2018-11-23 07:01:10,772 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:10,772 INFO L93 Difference]: Finished difference Result 73 states and 73 transitions. [2018-11-23 07:01:10,772 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-11-23 07:01:10,773 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 64 [2018-11-23 07:01:10,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:10,773 INFO L225 Difference]: With dead ends: 73 [2018-11-23 07:01:10,773 INFO L226 Difference]: Without dead ends: 72 [2018-11-23 07:01:10,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 140 GetRequests, 105 SyntacticMatches, 11 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 143 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-11-23 07:01:10,773 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2018-11-23 07:01:10,774 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 71. [2018-11-23 07:01:10,775 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 71 states. [2018-11-23 07:01:10,775 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 71 transitions. [2018-11-23 07:01:10,775 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 71 transitions. Word has length 64 [2018-11-23 07:01:10,775 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:10,775 INFO L480 AbstractCegarLoop]: Abstraction has 71 states and 71 transitions. [2018-11-23 07:01:10,775 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-11-23 07:01:10,775 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 71 transitions. [2018-11-23 07:01:10,776 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-11-23 07:01:10,776 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:10,776 INFO L402 BasicCegarLoop]: trace histogram [13, 12, 12, 12, 12, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:10,776 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:10,776 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:10,776 INFO L82 PathProgramCache]: Analyzing trace with hash -1181875074, now seen corresponding path program 12 times [2018-11-23 07:01:10,776 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:10,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:10,777 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:10,777 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:10,777 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:10,780 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:10,876 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:10,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:10,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:10,876 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:10,876 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:10,876 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:10,876 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 24 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:10,883 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:01:10,883 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:01:10,891 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:01:10,891 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:10,892 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:10,991 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:10,991 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:11,143 INFO L134 CoverageAnalysis]: Checked inductivity of 354 backedges. 0 proven. 354 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:11,167 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:11,167 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-23 07:01:11,168 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:11,168 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 07:01:11,168 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 07:01:11,168 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 07:01:11,168 INFO L87 Difference]: Start difference. First operand 71 states and 71 transitions. Second operand 15 states. [2018-11-23 07:01:11,204 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:11,204 INFO L93 Difference]: Finished difference Result 76 states and 76 transitions. [2018-11-23 07:01:11,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:01:11,204 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 67 [2018-11-23 07:01:11,205 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:11,205 INFO L225 Difference]: With dead ends: 76 [2018-11-23 07:01:11,205 INFO L226 Difference]: Without dead ends: 75 [2018-11-23 07:01:11,205 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 147 GetRequests, 109 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 66 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 07:01:11,206 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2018-11-23 07:01:11,207 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 74. [2018-11-23 07:01:11,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 74 states. [2018-11-23 07:01:11,208 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 74 transitions. [2018-11-23 07:01:11,208 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 74 transitions. Word has length 67 [2018-11-23 07:01:11,208 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:11,208 INFO L480 AbstractCegarLoop]: Abstraction has 74 states and 74 transitions. [2018-11-23 07:01:11,208 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 07:01:11,209 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 74 transitions. [2018-11-23 07:01:11,209 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-11-23 07:01:11,209 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:11,209 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:11,209 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:11,209 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:11,209 INFO L82 PathProgramCache]: Analyzing trace with hash -1910578464, now seen corresponding path program 12 times [2018-11-23 07:01:11,210 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:11,210 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:11,212 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:11,212 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:11,212 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:11,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:11,294 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:11,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:11,294 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:11,294 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:11,294 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:11,294 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:11,295 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 25 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:11,302 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:01:11,302 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:01:11,312 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:01:11,312 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:11,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:11,427 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:11,427 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:11,970 INFO L134 CoverageAnalysis]: Checked inductivity of 378 backedges. 0 proven. 378 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:11,985 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:11,985 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14, 14] total 27 [2018-11-23 07:01:11,985 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:11,985 INFO L459 AbstractCegarLoop]: Interpolant automaton has 15 states [2018-11-23 07:01:11,986 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 15 interpolants. [2018-11-23 07:01:11,986 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 07:01:11,986 INFO L87 Difference]: Start difference. First operand 74 states and 74 transitions. Second operand 15 states. [2018-11-23 07:01:12,012 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:12,012 INFO L93 Difference]: Finished difference Result 78 states and 78 transitions. [2018-11-23 07:01:12,012 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2018-11-23 07:01:12,012 INFO L78 Accepts]: Start accepts. Automaton has 15 states. Word has length 69 [2018-11-23 07:01:12,012 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:12,013 INFO L225 Difference]: With dead ends: 78 [2018-11-23 07:01:12,013 INFO L226 Difference]: Without dead ends: 77 [2018-11-23 07:01:12,013 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 113 SyntacticMatches, 12 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 210 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=378, Invalid=378, Unknown=0, NotChecked=0, Total=756 [2018-11-23 07:01:12,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2018-11-23 07:01:12,015 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 76. [2018-11-23 07:01:12,015 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76 states. [2018-11-23 07:01:12,016 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 76 transitions. [2018-11-23 07:01:12,016 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 76 transitions. Word has length 69 [2018-11-23 07:01:12,016 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:12,016 INFO L480 AbstractCegarLoop]: Abstraction has 76 states and 76 transitions. [2018-11-23 07:01:12,016 INFO L481 AbstractCegarLoop]: Interpolant automaton has 15 states. [2018-11-23 07:01:12,016 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 76 transitions. [2018-11-23 07:01:12,017 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2018-11-23 07:01:12,017 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:12,017 INFO L402 BasicCegarLoop]: trace histogram [14, 13, 13, 13, 13, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:12,017 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:12,017 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:12,017 INFO L82 PathProgramCache]: Analyzing trace with hash -1136364043, now seen corresponding path program 13 times [2018-11-23 07:01:12,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:12,018 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:12,018 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:12,018 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:12,023 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:12,111 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:12,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:12,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:12,111 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:12,111 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:12,111 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:12,111 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 26 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:12,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:12,118 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:12,127 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:12,128 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:12,230 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:12,230 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:12,389 INFO L134 CoverageAnalysis]: Checked inductivity of 416 backedges. 0 proven. 416 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:12,404 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:12,405 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-23 07:01:12,405 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:12,405 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 07:01:12,405 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 07:01:12,405 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 07:01:12,406 INFO L87 Difference]: Start difference. First operand 76 states and 76 transitions. Second operand 16 states. [2018-11-23 07:01:12,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:12,445 INFO L93 Difference]: Finished difference Result 81 states and 81 transitions. [2018-11-23 07:01:12,445 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 07:01:12,445 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 72 [2018-11-23 07:01:12,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:12,446 INFO L225 Difference]: With dead ends: 81 [2018-11-23 07:01:12,446 INFO L226 Difference]: Without dead ends: 80 [2018-11-23 07:01:12,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 117 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 78 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 07:01:12,447 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2018-11-23 07:01:12,448 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 79. [2018-11-23 07:01:12,449 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 79 states. [2018-11-23 07:01:12,449 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 79 transitions. [2018-11-23 07:01:12,449 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 79 transitions. Word has length 72 [2018-11-23 07:01:12,449 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:12,449 INFO L480 AbstractCegarLoop]: Abstraction has 79 states and 79 transitions. [2018-11-23 07:01:12,449 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 07:01:12,449 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 79 transitions. [2018-11-23 07:01:12,450 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-11-23 07:01:12,450 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:12,450 INFO L402 BasicCegarLoop]: trace histogram [14, 14, 14, 13, 13, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:12,450 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:12,450 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:12,450 INFO L82 PathProgramCache]: Analyzing trace with hash -1124150633, now seen corresponding path program 13 times [2018-11-23 07:01:12,454 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:12,454 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:12,455 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:12,455 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:12,455 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:12,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:12,538 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:12,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:12,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:12,538 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:12,538 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:12,538 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:12,538 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 27 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:12,547 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:12,547 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:12,557 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:12,558 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:12,683 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:12,683 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:13,078 INFO L134 CoverageAnalysis]: Checked inductivity of 442 backedges. 0 proven. 442 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:13,093 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:13,093 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 15, 15] total 29 [2018-11-23 07:01:13,093 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:13,093 INFO L459 AbstractCegarLoop]: Interpolant automaton has 16 states [2018-11-23 07:01:13,094 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2018-11-23 07:01:13,094 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 07:01:13,094 INFO L87 Difference]: Start difference. First operand 79 states and 79 transitions. Second operand 16 states. [2018-11-23 07:01:13,121 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:13,121 INFO L93 Difference]: Finished difference Result 83 states and 83 transitions. [2018-11-23 07:01:13,122 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2018-11-23 07:01:13,122 INFO L78 Accepts]: Start accepts. Automaton has 16 states. Word has length 74 [2018-11-23 07:01:13,123 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:13,123 INFO L225 Difference]: With dead ends: 83 [2018-11-23 07:01:13,123 INFO L226 Difference]: Without dead ends: 82 [2018-11-23 07:01:13,124 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 162 GetRequests, 121 SyntacticMatches, 13 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 286 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=435, Invalid=435, Unknown=0, NotChecked=0, Total=870 [2018-11-23 07:01:13,124 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2018-11-23 07:01:13,126 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 81. [2018-11-23 07:01:13,126 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 81 states. [2018-11-23 07:01:13,126 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 81 transitions. [2018-11-23 07:01:13,126 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 81 transitions. Word has length 74 [2018-11-23 07:01:13,126 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:13,126 INFO L480 AbstractCegarLoop]: Abstraction has 81 states and 81 transitions. [2018-11-23 07:01:13,126 INFO L481 AbstractCegarLoop]: Interpolant automaton has 16 states. [2018-11-23 07:01:13,127 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 81 transitions. [2018-11-23 07:01:13,127 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-11-23 07:01:13,127 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:13,127 INFO L402 BasicCegarLoop]: trace histogram [15, 14, 14, 14, 14, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:13,127 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:13,127 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:13,127 INFO L82 PathProgramCache]: Analyzing trace with hash -1711450402, now seen corresponding path program 14 times [2018-11-23 07:01:13,128 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:13,128 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:13,128 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:13,128 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:13,132 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:13,227 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:13,227 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:13,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:13,228 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:13,228 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:13,228 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:13,228 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 28 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:13,238 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:01:13,238 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:01:13,264 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 07:01:13,264 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:13,265 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:13,400 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:13,400 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:13,606 INFO L134 CoverageAnalysis]: Checked inductivity of 483 backedges. 0 proven. 483 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:13,622 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:13,622 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-23 07:01:13,622 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:13,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 07:01:13,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 07:01:13,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 07:01:13,623 INFO L87 Difference]: Start difference. First operand 81 states and 81 transitions. Second operand 17 states. [2018-11-23 07:01:13,663 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:13,663 INFO L93 Difference]: Finished difference Result 86 states and 86 transitions. [2018-11-23 07:01:13,664 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 07:01:13,664 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 77 [2018-11-23 07:01:13,664 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:13,664 INFO L225 Difference]: With dead ends: 86 [2018-11-23 07:01:13,664 INFO L226 Difference]: Without dead ends: 85 [2018-11-23 07:01:13,665 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 169 GetRequests, 125 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 91 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 07:01:13,665 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2018-11-23 07:01:13,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 84. [2018-11-23 07:01:13,667 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 84 states. [2018-11-23 07:01:13,667 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 84 transitions. [2018-11-23 07:01:13,667 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 84 transitions. Word has length 77 [2018-11-23 07:01:13,668 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:13,668 INFO L480 AbstractCegarLoop]: Abstraction has 84 states and 84 transitions. [2018-11-23 07:01:13,668 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 07:01:13,668 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 84 transitions. [2018-11-23 07:01:13,668 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2018-11-23 07:01:13,668 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:13,668 INFO L402 BasicCegarLoop]: trace histogram [15, 15, 15, 14, 14, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:13,669 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:13,669 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:13,669 INFO L82 PathProgramCache]: Analyzing trace with hash 268639552, now seen corresponding path program 14 times [2018-11-23 07:01:13,669 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:13,670 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:13,670 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:13,670 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:13,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:13,771 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:13,771 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:13,771 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:13,772 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:13,772 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:13,772 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:13,772 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 29 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:13,780 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:01:13,780 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:01:13,793 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 15 check-sat command(s) [2018-11-23 07:01:13,793 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:13,794 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:13,912 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:13,912 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:14,296 INFO L134 CoverageAnalysis]: Checked inductivity of 511 backedges. 0 proven. 511 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:14,311 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:14,311 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 16, 16] total 31 [2018-11-23 07:01:14,311 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:14,311 INFO L459 AbstractCegarLoop]: Interpolant automaton has 17 states [2018-11-23 07:01:14,311 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 17 interpolants. [2018-11-23 07:01:14,312 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 07:01:14,312 INFO L87 Difference]: Start difference. First operand 84 states and 84 transitions. Second operand 17 states. [2018-11-23 07:01:14,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:14,347 INFO L93 Difference]: Finished difference Result 88 states and 88 transitions. [2018-11-23 07:01:14,348 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-11-23 07:01:14,348 INFO L78 Accepts]: Start accepts. Automaton has 17 states. Word has length 79 [2018-11-23 07:01:14,348 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:14,348 INFO L225 Difference]: With dead ends: 88 [2018-11-23 07:01:14,348 INFO L226 Difference]: Without dead ends: 87 [2018-11-23 07:01:14,349 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 129 SyntacticMatches, 14 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 371 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=496, Invalid=496, Unknown=0, NotChecked=0, Total=992 [2018-11-23 07:01:14,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2018-11-23 07:01:14,350 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 86. [2018-11-23 07:01:14,350 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 86 states. [2018-11-23 07:01:14,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 86 states to 86 states and 86 transitions. [2018-11-23 07:01:14,351 INFO L78 Accepts]: Start accepts. Automaton has 86 states and 86 transitions. Word has length 79 [2018-11-23 07:01:14,351 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:14,351 INFO L480 AbstractCegarLoop]: Abstraction has 86 states and 86 transitions. [2018-11-23 07:01:14,351 INFO L481 AbstractCegarLoop]: Interpolant automaton has 17 states. [2018-11-23 07:01:14,351 INFO L276 IsEmpty]: Start isEmpty. Operand 86 states and 86 transitions. [2018-11-23 07:01:14,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 83 [2018-11-23 07:01:14,351 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:14,351 INFO L402 BasicCegarLoop]: trace histogram [16, 15, 15, 15, 15, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:14,352 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:14,352 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:14,352 INFO L82 PathProgramCache]: Analyzing trace with hash 1516871573, now seen corresponding path program 15 times [2018-11-23 07:01:14,352 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:14,352 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:14,352 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:14,352 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:14,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:14,474 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:14,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:14,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:14,475 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:14,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:14,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:14,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 30 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:14,484 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:01:14,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:01:14,494 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:01:14,494 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:14,495 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:14,626 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:14,626 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:14,825 INFO L134 CoverageAnalysis]: Checked inductivity of 555 backedges. 0 proven. 555 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:14,839 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:14,840 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-23 07:01:14,840 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:14,840 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 07:01:14,840 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 07:01:14,840 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 07:01:14,841 INFO L87 Difference]: Start difference. First operand 86 states and 86 transitions. Second operand 18 states. [2018-11-23 07:01:14,886 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:14,887 INFO L93 Difference]: Finished difference Result 91 states and 91 transitions. [2018-11-23 07:01:14,887 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 07:01:14,887 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 82 [2018-11-23 07:01:14,887 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:14,887 INFO L225 Difference]: With dead ends: 91 [2018-11-23 07:01:14,888 INFO L226 Difference]: Without dead ends: 90 [2018-11-23 07:01:14,888 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 133 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 07:01:14,888 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2018-11-23 07:01:14,890 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 89. [2018-11-23 07:01:14,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 89 states. [2018-11-23 07:01:14,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 89 transitions. [2018-11-23 07:01:14,891 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 89 transitions. Word has length 82 [2018-11-23 07:01:14,891 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:14,891 INFO L480 AbstractCegarLoop]: Abstraction has 89 states and 89 transitions. [2018-11-23 07:01:14,891 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 07:01:14,891 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 89 transitions. [2018-11-23 07:01:14,891 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 85 [2018-11-23 07:01:14,892 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:14,892 INFO L402 BasicCegarLoop]: trace histogram [16, 16, 16, 15, 15, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:14,892 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:14,892 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:14,892 INFO L82 PathProgramCache]: Analyzing trace with hash 1719669815, now seen corresponding path program 15 times [2018-11-23 07:01:14,892 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:14,893 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:14,893 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:14,893 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:14,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:15,002 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:15,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:15,002 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:15,003 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:15,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:15,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:15,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 31 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:15,020 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:01:15,020 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:01:15,031 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:01:15,031 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:15,032 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:15,201 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:15,201 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:15,568 INFO L134 CoverageAnalysis]: Checked inductivity of 585 backedges. 0 proven. 585 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:15,583 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:15,583 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 17, 17] total 33 [2018-11-23 07:01:15,583 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:15,583 INFO L459 AbstractCegarLoop]: Interpolant automaton has 18 states [2018-11-23 07:01:15,583 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2018-11-23 07:01:15,583 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 07:01:15,583 INFO L87 Difference]: Start difference. First operand 89 states and 89 transitions. Second operand 18 states. [2018-11-23 07:01:15,607 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:15,607 INFO L93 Difference]: Finished difference Result 93 states and 93 transitions. [2018-11-23 07:01:15,607 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-11-23 07:01:15,608 INFO L78 Accepts]: Start accepts. Automaton has 18 states. Word has length 84 [2018-11-23 07:01:15,608 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:15,608 INFO L225 Difference]: With dead ends: 93 [2018-11-23 07:01:15,608 INFO L226 Difference]: Without dead ends: 92 [2018-11-23 07:01:15,609 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 184 GetRequests, 137 SyntacticMatches, 15 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 465 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=561, Invalid=561, Unknown=0, NotChecked=0, Total=1122 [2018-11-23 07:01:15,609 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2018-11-23 07:01:15,611 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 91. [2018-11-23 07:01:15,611 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-11-23 07:01:15,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 91 transitions. [2018-11-23 07:01:15,612 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 91 transitions. Word has length 84 [2018-11-23 07:01:15,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:15,612 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 91 transitions. [2018-11-23 07:01:15,612 INFO L481 AbstractCegarLoop]: Interpolant automaton has 18 states. [2018-11-23 07:01:15,612 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 91 transitions. [2018-11-23 07:01:15,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 88 [2018-11-23 07:01:15,612 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:15,612 INFO L402 BasicCegarLoop]: trace histogram [17, 16, 16, 16, 16, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:15,613 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:15,613 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:15,613 INFO L82 PathProgramCache]: Analyzing trace with hash 313602366, now seen corresponding path program 16 times [2018-11-23 07:01:15,613 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:15,614 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:15,614 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:15,614 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:15,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:15,736 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:15,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:15,736 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:15,736 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:15,736 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:15,736 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:15,737 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 32 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:15,745 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:15,745 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:15,755 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:15,757 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:15,930 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:15,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:16,124 INFO L134 CoverageAnalysis]: Checked inductivity of 632 backedges. 0 proven. 632 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:16,138 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:16,138 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-23 07:01:16,138 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:16,138 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 07:01:16,139 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 07:01:16,139 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 07:01:16,139 INFO L87 Difference]: Start difference. First operand 91 states and 91 transitions. Second operand 19 states. [2018-11-23 07:01:16,177 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:16,177 INFO L93 Difference]: Finished difference Result 96 states and 96 transitions. [2018-11-23 07:01:16,177 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 07:01:16,177 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 87 [2018-11-23 07:01:16,178 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:16,178 INFO L225 Difference]: With dead ends: 96 [2018-11-23 07:01:16,178 INFO L226 Difference]: Without dead ends: 95 [2018-11-23 07:01:16,178 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 191 GetRequests, 141 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 216 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 07:01:16,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2018-11-23 07:01:16,180 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 94. [2018-11-23 07:01:16,180 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 94 states. [2018-11-23 07:01:16,181 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 94 transitions. [2018-11-23 07:01:16,181 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 94 transitions. Word has length 87 [2018-11-23 07:01:16,181 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:16,181 INFO L480 AbstractCegarLoop]: Abstraction has 94 states and 94 transitions. [2018-11-23 07:01:16,181 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 07:01:16,181 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 94 transitions. [2018-11-23 07:01:16,182 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 90 [2018-11-23 07:01:16,182 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:16,182 INFO L402 BasicCegarLoop]: trace histogram [17, 17, 17, 16, 16, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:16,182 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:16,182 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:16,183 INFO L82 PathProgramCache]: Analyzing trace with hash 724164512, now seen corresponding path program 16 times [2018-11-23 07:01:16,183 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:16,183 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:16,183 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:16,184 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:16,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:16,308 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:16,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:16,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:16,308 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:16,308 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:16,308 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:16,308 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 33 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:16,315 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:16,315 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:16,325 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:16,326 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:16,482 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:16,482 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:16,947 INFO L134 CoverageAnalysis]: Checked inductivity of 664 backedges. 0 proven. 664 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:16,962 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:16,962 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [18, 18, 18] total 35 [2018-11-23 07:01:16,963 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:16,963 INFO L459 AbstractCegarLoop]: Interpolant automaton has 19 states [2018-11-23 07:01:16,963 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2018-11-23 07:01:16,963 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 07:01:16,964 INFO L87 Difference]: Start difference. First operand 94 states and 94 transitions. Second operand 19 states. [2018-11-23 07:01:17,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:17,002 INFO L93 Difference]: Finished difference Result 98 states and 98 transitions. [2018-11-23 07:01:17,002 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2018-11-23 07:01:17,002 INFO L78 Accepts]: Start accepts. Automaton has 19 states. Word has length 89 [2018-11-23 07:01:17,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:17,003 INFO L225 Difference]: With dead ends: 98 [2018-11-23 07:01:17,003 INFO L226 Difference]: Without dead ends: 97 [2018-11-23 07:01:17,003 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 195 GetRequests, 145 SyntacticMatches, 16 SemanticMatches, 34 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 568 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=630, Invalid=630, Unknown=0, NotChecked=0, Total=1260 [2018-11-23 07:01:17,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2018-11-23 07:01:17,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 96. [2018-11-23 07:01:17,006 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 96 states. [2018-11-23 07:01:17,006 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 96 transitions. [2018-11-23 07:01:17,006 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 96 transitions. Word has length 89 [2018-11-23 07:01:17,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:17,007 INFO L480 AbstractCegarLoop]: Abstraction has 96 states and 96 transitions. [2018-11-23 07:01:17,007 INFO L481 AbstractCegarLoop]: Interpolant automaton has 19 states. [2018-11-23 07:01:17,007 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 96 transitions. [2018-11-23 07:01:17,007 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 93 [2018-11-23 07:01:17,007 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:17,007 INFO L402 BasicCegarLoop]: trace histogram [18, 17, 17, 17, 17, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:17,008 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:17,008 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:17,008 INFO L82 PathProgramCache]: Analyzing trace with hash -35700427, now seen corresponding path program 17 times [2018-11-23 07:01:17,008 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:17,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:17,009 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:17,009 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:17,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:17,143 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:17,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:17,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:17,144 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:17,144 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:17,144 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:17,144 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 34 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:17,159 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:01:17,159 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:01:17,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 07:01:17,194 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:17,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:17,403 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:17,403 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:17,639 INFO L134 CoverageAnalysis]: Checked inductivity of 714 backedges. 0 proven. 714 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:17,654 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:17,654 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-23 07:01:17,654 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:17,654 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 07:01:17,654 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 07:01:17,655 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 07:01:17,655 INFO L87 Difference]: Start difference. First operand 96 states and 96 transitions. Second operand 20 states. [2018-11-23 07:01:17,701 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:17,701 INFO L93 Difference]: Finished difference Result 101 states and 101 transitions. [2018-11-23 07:01:17,701 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 07:01:17,701 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 92 [2018-11-23 07:01:17,702 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:17,702 INFO L225 Difference]: With dead ends: 101 [2018-11-23 07:01:17,702 INFO L226 Difference]: Without dead ends: 100 [2018-11-23 07:01:17,703 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 202 GetRequests, 149 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 306 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 07:01:17,703 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2018-11-23 07:01:17,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2018-11-23 07:01:17,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 99 states. [2018-11-23 07:01:17,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 99 transitions. [2018-11-23 07:01:17,706 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 99 transitions. Word has length 92 [2018-11-23 07:01:17,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:17,706 INFO L480 AbstractCegarLoop]: Abstraction has 99 states and 99 transitions. [2018-11-23 07:01:17,706 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 07:01:17,706 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 99 transitions. [2018-11-23 07:01:17,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-11-23 07:01:17,707 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:17,707 INFO L402 BasicCegarLoop]: trace histogram [18, 18, 18, 17, 17, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:17,707 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:17,707 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:17,708 INFO L82 PathProgramCache]: Analyzing trace with hash 51629527, now seen corresponding path program 17 times [2018-11-23 07:01:17,708 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:17,708 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:17,708 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:17,709 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:17,709 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:17,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:17,849 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:17,849 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:17,849 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:17,849 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:17,849 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:17,850 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:17,850 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 35 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:17,858 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-11-23 07:01:17,858 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-11-23 07:01:17,892 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 18 check-sat command(s) [2018-11-23 07:01:17,892 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:17,894 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:18,058 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:18,058 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:18,491 INFO L134 CoverageAnalysis]: Checked inductivity of 748 backedges. 0 proven. 748 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:18,506 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:18,506 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 19, 19] total 37 [2018-11-23 07:01:18,506 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:18,507 INFO L459 AbstractCegarLoop]: Interpolant automaton has 20 states [2018-11-23 07:01:18,507 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2018-11-23 07:01:18,507 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 07:01:18,507 INFO L87 Difference]: Start difference. First operand 99 states and 99 transitions. Second operand 20 states. [2018-11-23 07:01:18,540 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:18,540 INFO L93 Difference]: Finished difference Result 103 states and 103 transitions. [2018-11-23 07:01:18,540 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2018-11-23 07:01:18,540 INFO L78 Accepts]: Start accepts. Automaton has 20 states. Word has length 94 [2018-11-23 07:01:18,540 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:18,541 INFO L225 Difference]: With dead ends: 103 [2018-11-23 07:01:18,541 INFO L226 Difference]: Without dead ends: 102 [2018-11-23 07:01:18,541 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 206 GetRequests, 153 SyntacticMatches, 17 SemanticMatches, 36 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 680 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=703, Invalid=703, Unknown=0, NotChecked=0, Total=1406 [2018-11-23 07:01:18,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2018-11-23 07:01:18,542 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 101. [2018-11-23 07:01:18,542 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 101 states. [2018-11-23 07:01:18,543 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 101 transitions. [2018-11-23 07:01:18,543 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 101 transitions. Word has length 94 [2018-11-23 07:01:18,543 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:18,543 INFO L480 AbstractCegarLoop]: Abstraction has 101 states and 101 transitions. [2018-11-23 07:01:18,543 INFO L481 AbstractCegarLoop]: Interpolant automaton has 20 states. [2018-11-23 07:01:18,543 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 101 transitions. [2018-11-23 07:01:18,543 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 98 [2018-11-23 07:01:18,543 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:18,543 INFO L402 BasicCegarLoop]: trace histogram [19, 18, 18, 18, 18, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:18,544 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:18,544 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:18,544 INFO L82 PathProgramCache]: Analyzing trace with hash 496997278, now seen corresponding path program 18 times [2018-11-23 07:01:18,544 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:18,544 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:18,544 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:18,545 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:18,547 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:18,682 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:18,682 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:18,682 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:18,682 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:18,683 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:18,683 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:18,683 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 36 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:18,691 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:01:18,691 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:01:18,703 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:01:18,703 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:18,704 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:18,882 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:18,883 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:19,127 INFO L134 CoverageAnalysis]: Checked inductivity of 801 backedges. 0 proven. 801 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:19,143 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:19,143 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 39 [2018-11-23 07:01:19,143 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:19,144 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 07:01:19,144 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 07:01:19,144 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 07:01:19,144 INFO L87 Difference]: Start difference. First operand 101 states and 101 transitions. Second operand 21 states. [2018-11-23 07:01:19,181 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:19,181 INFO L93 Difference]: Finished difference Result 106 states and 106 transitions. [2018-11-23 07:01:19,181 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 07:01:19,181 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 97 [2018-11-23 07:01:19,181 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:19,182 INFO L225 Difference]: With dead ends: 106 [2018-11-23 07:01:19,182 INFO L226 Difference]: Without dead ends: 105 [2018-11-23 07:01:19,182 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 213 GetRequests, 157 SyntacticMatches, 18 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 405 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=780, Invalid=780, Unknown=0, NotChecked=0, Total=1560 [2018-11-23 07:01:19,182 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2018-11-23 07:01:19,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 104. [2018-11-23 07:01:19,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 104 states. [2018-11-23 07:01:19,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 104 transitions. [2018-11-23 07:01:19,185 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 104 transitions. Word has length 97 [2018-11-23 07:01:19,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:19,186 INFO L480 AbstractCegarLoop]: Abstraction has 104 states and 104 transitions. [2018-11-23 07:01:19,186 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 07:01:19,186 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 104 transitions. [2018-11-23 07:01:19,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 100 [2018-11-23 07:01:19,186 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:19,186 INFO L402 BasicCegarLoop]: trace histogram [19, 19, 19, 18, 18, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:19,187 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:19,187 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:19,187 INFO L82 PathProgramCache]: Analyzing trace with hash 873015808, now seen corresponding path program 18 times [2018-11-23 07:01:19,187 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:19,188 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:19,188 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:19,188 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:19,192 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:19,303 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:19,303 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:19,303 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:19,304 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:19,304 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:19,304 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:19,304 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 37 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:19,312 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-11-23 07:01:19,312 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-11-23 07:01:19,323 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-11-23 07:01:19,323 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-11-23 07:01:19,325 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:19,524 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:19,525 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:19,998 INFO L134 CoverageAnalysis]: Checked inductivity of 837 backedges. 0 proven. 837 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:20,012 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:20,012 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 20, 20] total 38 [2018-11-23 07:01:20,013 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:20,013 INFO L459 AbstractCegarLoop]: Interpolant automaton has 21 states [2018-11-23 07:01:20,013 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2018-11-23 07:01:20,013 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 07:01:20,013 INFO L87 Difference]: Start difference. First operand 104 states and 104 transitions. Second operand 21 states. [2018-11-23 07:01:20,061 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:20,062 INFO L93 Difference]: Finished difference Result 108 states and 108 transitions. [2018-11-23 07:01:20,063 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2018-11-23 07:01:20,063 INFO L78 Accepts]: Start accepts. Automaton has 21 states. Word has length 99 [2018-11-23 07:01:20,063 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:20,064 INFO L225 Difference]: With dead ends: 108 [2018-11-23 07:01:20,064 INFO L226 Difference]: Without dead ends: 107 [2018-11-23 07:01:20,064 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 217 GetRequests, 161 SyntacticMatches, 19 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=741, Invalid=741, Unknown=0, NotChecked=0, Total=1482 [2018-11-23 07:01:20,064 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-11-23 07:01:20,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 106. [2018-11-23 07:01:20,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-11-23 07:01:20,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 106 transitions. [2018-11-23 07:01:20,067 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 106 transitions. Word has length 99 [2018-11-23 07:01:20,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:20,067 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 106 transitions. [2018-11-23 07:01:20,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 21 states. [2018-11-23 07:01:20,067 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 106 transitions. [2018-11-23 07:01:20,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 103 [2018-11-23 07:01:20,068 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:20,068 INFO L402 BasicCegarLoop]: trace histogram [20, 19, 19, 19, 19, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:20,068 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:20,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:20,068 INFO L82 PathProgramCache]: Analyzing trace with hash 1987009237, now seen corresponding path program 19 times [2018-11-23 07:01:20,068 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:20,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:20,069 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-11-23 07:01:20,069 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:20,069 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:20,081 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:20,205 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:20,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:20,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-11-23 07:01:20,206 INFO L184 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-11-23 07:01:20,206 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-11-23 07:01:20,206 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-11-23 07:01:20,206 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/z3 Starting monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 38 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-11-23 07:01:20,214 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:20,215 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-11-23 07:01:20,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-11-23 07:01:20,227 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-11-23 07:01:20,440 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:20,441 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-11-23 07:01:20,664 INFO L134 CoverageAnalysis]: Checked inductivity of 893 backedges. 0 proven. 893 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-11-23 07:01:20,678 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-11-23 07:01:20,678 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 21, 21] total 41 [2018-11-23 07:01:20,679 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-11-23 07:01:20,679 INFO L459 AbstractCegarLoop]: Interpolant automaton has 22 states [2018-11-23 07:01:20,679 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2018-11-23 07:01:20,679 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 07:01:20,679 INFO L87 Difference]: Start difference. First operand 106 states and 106 transitions. Second operand 22 states. [2018-11-23 07:01:20,721 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-11-23 07:01:20,721 INFO L93 Difference]: Finished difference Result 111 states and 111 transitions. [2018-11-23 07:01:20,721 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2018-11-23 07:01:20,721 INFO L78 Accepts]: Start accepts. Automaton has 22 states. Word has length 102 [2018-11-23 07:01:20,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-11-23 07:01:20,721 INFO L225 Difference]: With dead ends: 111 [2018-11-23 07:01:20,721 INFO L226 Difference]: Without dead ends: 110 [2018-11-23 07:01:20,722 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 224 GetRequests, 165 SyntacticMatches, 19 SemanticMatches, 40 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 513 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=861, Invalid=861, Unknown=0, NotChecked=0, Total=1722 [2018-11-23 07:01:20,722 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2018-11-23 07:01:20,723 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 109. [2018-11-23 07:01:20,723 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 109 states. [2018-11-23 07:01:20,723 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 109 transitions. [2018-11-23 07:01:20,724 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 109 transitions. Word has length 102 [2018-11-23 07:01:20,724 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-11-23 07:01:20,724 INFO L480 AbstractCegarLoop]: Abstraction has 109 states and 109 transitions. [2018-11-23 07:01:20,724 INFO L481 AbstractCegarLoop]: Interpolant automaton has 22 states. [2018-11-23 07:01:20,724 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 109 transitions. [2018-11-23 07:01:20,724 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 105 [2018-11-23 07:01:20,724 INFO L394 BasicCegarLoop]: Found error trace [2018-11-23 07:01:20,724 INFO L402 BasicCegarLoop]: trace histogram [20, 20, 20, 19, 19, 1, 1, 1, 1, 1, 1] [2018-11-23 07:01:20,724 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-11-23 07:01:20,724 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-11-23 07:01:20,725 INFO L82 PathProgramCache]: Analyzing trace with hash -1744568457, now seen corresponding path program 19 times [2018-11-23 07:01:20,725 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-11-23 07:01:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:20,725 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-11-23 07:01:20,725 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-11-23 07:01:20,725 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-11-23 07:01:20,730 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:20,737 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is sat [2018-11-23 07:01:20,752 INFO L469 BasicCegarLoop]: Counterexample might be feasible ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #28#return; [?] CALL call #t~ret0 := main(); [?] havoc ~x~0;havoc ~y~0;~x~0 := 1;~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=1, main_~y~0=1] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=2, main_~y~0=1] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=2, main_~y~0=3] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=4, main_~y~0=3] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=4, main_~y~0=9] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=4, main_~y~0=9] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=8, main_~y~0=9] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=8, main_~y~0=27] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=8, main_~y~0=27] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=16, main_~y~0=27] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=16, main_~y~0=81] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=16, main_~y~0=81] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=32, main_~y~0=81] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=32, main_~y~0=243] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=32, main_~y~0=243] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=64, main_~y~0=243] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=64, main_~y~0=729] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=64, main_~y~0=729] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=128, main_~y~0=729] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=128, main_~y~0=2187] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=128, main_~y~0=2187] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=256, main_~y~0=2187] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=256, main_~y~0=6561] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=256, main_~y~0=6561] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=512, main_~y~0=6561] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=512, main_~y~0=19683] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=512, main_~y~0=19683] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=1024, main_~y~0=59049] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=2048, main_~y~0=177147] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=4096, main_~y~0=531441] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=8192, main_~y~0=1594323] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=16384, main_~y~0=4782969] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=32768, main_~y~0=14348907] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=65536, main_~y~0=43046721] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=131072, main_~y~0=129140163] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=262144, main_~y~0=387420489] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=524288, main_~y~0=1162261467] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [?] assume !(3 * ~y~0 <= 2147483647); VAL [main_~x~0=1048576, main_~y~0=1162261467] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] [L15] int x, y; [L16] x = 1 [L17] y = 1 VAL [x=1, y=1] [L18] COND TRUE x >= 0 VAL [x=1, y=1] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2, y=1] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2, y=3] [L18] COND TRUE x >= 0 VAL [x=2, y=3] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4, y=3] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4, y=9] [L18] COND TRUE x >= 0 VAL [x=4, y=9] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8, y=9] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8, y=27] [L18] COND TRUE x >= 0 VAL [x=8, y=27] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16, y=27] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16, y=81] [L18] COND TRUE x >= 0 VAL [x=16, y=81] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32, y=81] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32, y=243] [L18] COND TRUE x >= 0 VAL [x=32, y=243] [L19] EXPR 2*x [L19] x = 2*x VAL [x=64, y=243] [L20] EXPR 3*y [L20] y = 3*y VAL [x=64, y=729] [L18] COND TRUE x >= 0 VAL [x=64, y=729] [L19] EXPR 2*x [L19] x = 2*x VAL [x=128, y=729] [L20] EXPR 3*y [L20] y = 3*y VAL [x=128, y=2187] [L18] COND TRUE x >= 0 VAL [x=128, y=2187] [L19] EXPR 2*x [L19] x = 2*x VAL [x=256, y=2187] [L20] EXPR 3*y [L20] y = 3*y VAL [x=256, y=6561] [L18] COND TRUE x >= 0 VAL [x=256, y=6561] [L19] EXPR 2*x [L19] x = 2*x VAL [x=512, y=6561] [L20] EXPR 3*y [L20] y = 3*y VAL [x=512, y=19683] [L18] COND TRUE x >= 0 VAL [x=512, y=19683] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1024, y=19683] [L20] EXPR 3*y [L20] y = 3*y VAL [x=1024, y=59049] [L18] COND TRUE x >= 0 VAL [x=1024, y=59049] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2048, y=59049] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2048, y=177147] [L18] COND TRUE x >= 0 VAL [x=2048, y=177147] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4096, y=177147] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4096, y=531441] [L18] COND TRUE x >= 0 VAL [x=4096, y=531441] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8192, y=531441] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8192, y=1594323] [L18] COND TRUE x >= 0 VAL [x=8192, y=1594323] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16384, y=1594323] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16384, y=4782969] [L18] COND TRUE x >= 0 VAL [x=16384, y=4782969] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32768, y=4782969] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32768, y=14348907] [L18] COND TRUE x >= 0 VAL [x=32768, y=14348907] [L19] EXPR 2*x [L19] x = 2*x VAL [x=65536, y=14348907] [L20] EXPR 3*y [L20] y = 3*y VAL [x=65536, y=43046721] [L18] COND TRUE x >= 0 VAL [x=65536, y=43046721] [L19] EXPR 2*x [L19] x = 2*x VAL [x=131072, y=43046721] [L20] EXPR 3*y [L20] y = 3*y VAL [x=131072, y=129140163] [L18] COND TRUE x >= 0 VAL [x=131072, y=129140163] [L19] EXPR 2*x [L19] x = 2*x VAL [x=262144, y=129140163] [L20] EXPR 3*y [L20] y = 3*y VAL [x=262144, y=387420489] [L18] COND TRUE x >= 0 VAL [x=262144, y=387420489] [L19] EXPR 2*x [L19] x = 2*x VAL [x=524288, y=387420489] [L20] EXPR 3*y [L20] y = 3*y VAL [x=524288, y=1162261467] [L18] COND TRUE x >= 0 VAL [x=524288, y=1162261467] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1048576, y=1162261467] [L20] 3*y VAL [x=1048576, y=1162261467] ----- [2018-11-23 07:01:20,996 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 23.11 07:01:20 BoogieIcfgContainer [2018-11-23 07:01:20,996 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-11-23 07:01:20,997 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-11-23 07:01:20,997 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-11-23 07:01:20,997 INFO L276 PluginConnector]: Witness Printer initialized [2018-11-23 07:01:20,997 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 23.11 07:00:38" (3/4) ... [2018-11-23 07:01:20,999 INFO L138 WitnessPrinter]: Generating witness for reachability counterexample ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder.RCFGBacktranslator [?] CALL call ULTIMATE.init(); [?] assume true; [?] RET #28#return; [?] CALL call #t~ret0 := main(); [?] havoc ~x~0;havoc ~y~0;~x~0 := 1;~y~0 := 1; VAL [main_~x~0=1, main_~y~0=1] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=1, main_~y~0=1] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=1, main_~y~0=1] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=2, main_~y~0=1] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=1] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=2, main_~y~0=3] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=2, main_~y~0=3] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=2, main_~y~0=3] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=4, main_~y~0=3] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=3] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=4, main_~y~0=9] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=4, main_~y~0=9] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=4, main_~y~0=9] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=8, main_~y~0=9] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=9] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=8, main_~y~0=27] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=8, main_~y~0=27] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=8, main_~y~0=27] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=16, main_~y~0=27] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=27] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=16, main_~y~0=81] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=16, main_~y~0=81] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=16, main_~y~0=81] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=32, main_~y~0=81] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=81] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=32, main_~y~0=243] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=32, main_~y~0=243] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=32, main_~y~0=243] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=64, main_~y~0=243] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=243] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=64, main_~y~0=729] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=64, main_~y~0=729] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=64, main_~y~0=729] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=128, main_~y~0=729] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=729] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=128, main_~y~0=2187] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=128, main_~y~0=2187] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=128, main_~y~0=2187] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=256, main_~y~0=2187] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=2187] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=256, main_~y~0=6561] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=256, main_~y~0=6561] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=256, main_~y~0=6561] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=512, main_~y~0=6561] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=6561] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=512, main_~y~0=19683] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=512, main_~y~0=19683] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=512, main_~y~0=19683] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=1024, main_~y~0=19683] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=19683] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=1024, main_~y~0=59049] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=1024, main_~y~0=59049] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=1024, main_~y~0=59049] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=2048, main_~y~0=59049] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=59049] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=2048, main_~y~0=177147] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=2048, main_~y~0=177147] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=2048, main_~y~0=177147] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=4096, main_~y~0=177147] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=177147] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=4096, main_~y~0=531441] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=4096, main_~y~0=531441] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=4096, main_~y~0=531441] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=8192, main_~y~0=531441] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=531441] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=8192, main_~y~0=1594323] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=8192, main_~y~0=1594323] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=8192, main_~y~0=1594323] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=16384, main_~y~0=1594323] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=1594323] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=16384, main_~y~0=4782969] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=16384, main_~y~0=4782969] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=16384, main_~y~0=4782969] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=32768, main_~y~0=4782969] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=4782969] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=32768, main_~y~0=14348907] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=32768, main_~y~0=14348907] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=32768, main_~y~0=14348907] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=65536, main_~y~0=14348907] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=14348907] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=65536, main_~y~0=43046721] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=65536, main_~y~0=43046721] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=65536, main_~y~0=43046721] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=131072, main_~y~0=43046721] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=43046721] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=131072, main_~y~0=129140163] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=131072, main_~y~0=129140163] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=131072, main_~y~0=129140163] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=262144, main_~y~0=129140163] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=129140163] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=262144, main_~y~0=387420489] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=262144, main_~y~0=387420489] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=262144, main_~y~0=387420489] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=524288, main_~y~0=387420489] [?] assume 3 * ~y~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=387420489] [?] assume 3 * ~y~0 >= -2147483648;~y~0 := 3 * ~y~0; VAL [main_~x~0=524288, main_~y~0=1162261467] [?] assume !!(~x~0 >= 0); VAL [main_~x~0=524288, main_~y~0=1162261467] [?] assume 2 * ~x~0 <= 2147483647; VAL [main_~x~0=524288, main_~y~0=1162261467] [?] assume 2 * ~x~0 >= -2147483648;~x~0 := 2 * ~x~0; VAL [main_~x~0=1048576, main_~y~0=1162261467] [?] assume !(3 * ~y~0 <= 2147483647); VAL [main_~x~0=1048576, main_~y~0=1162261467] [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.preprocessor.BoogiePreprocessorBacktranslator [?] CALL call ULTIMATE.init(); [?] ensures true; [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] assume !!(~x~0 >= 0); VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.boogie.procedureinliner.backtranslation.InlinerBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] ----- ----- class de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieBacktranslator [?] CALL call ULTIMATE.init(); [?] RET call ULTIMATE.init(); [?] CALL call #t~ret0 := main(); [L15] havoc ~x~0; [L15] havoc ~y~0; [L16] ~x~0 := 1; [L17] ~y~0 := 1; VAL [~x~0=1, ~y~0=1] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1, ~y~0=1] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2, ~y~0=1] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2, ~y~0=3] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2, ~y~0=3] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4, ~y~0=3] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4, ~y~0=9] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4, ~y~0=9] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8, ~y~0=9] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8, ~y~0=27] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8, ~y~0=27] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16, ~y~0=27] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16, ~y~0=81] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16, ~y~0=81] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32, ~y~0=81] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32, ~y~0=243] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32, ~y~0=243] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=64, ~y~0=243] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=64, ~y~0=729] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=64, ~y~0=729] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=128, ~y~0=729] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=128, ~y~0=2187] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=128, ~y~0=2187] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=256, ~y~0=2187] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=256, ~y~0=6561] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=256, ~y~0=6561] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=512, ~y~0=6561] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=512, ~y~0=19683] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=512, ~y~0=19683] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1024, ~y~0=19683] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=1024, ~y~0=59049] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=1024, ~y~0=59049] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=2048, ~y~0=59049] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=2048, ~y~0=177147] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=2048, ~y~0=177147] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=4096, ~y~0=177147] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=4096, ~y~0=531441] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=4096, ~y~0=531441] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=8192, ~y~0=531441] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=8192, ~y~0=1594323] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=8192, ~y~0=1594323] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=16384, ~y~0=1594323] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=16384, ~y~0=4782969] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=16384, ~y~0=4782969] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=32768, ~y~0=4782969] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=32768, ~y~0=14348907] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=32768, ~y~0=14348907] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=65536, ~y~0=14348907] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=65536, ~y~0=43046721] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=65536, ~y~0=43046721] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=131072, ~y~0=43046721] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=131072, ~y~0=129140163] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=131072, ~y~0=129140163] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=262144, ~y~0=129140163] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=262144, ~y~0=387420489] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=262144, ~y~0=387420489] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=524288, ~y~0=387420489] [L20] assert 3 * ~y~0 >= -2147483648; [L20] ~y~0 := 3 * ~y~0; VAL [~x~0=524288, ~y~0=1162261467] [L18-L21] COND FALSE !(!(~x~0 >= 0)) VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 <= 2147483647; VAL [~x~0=524288, ~y~0=1162261467] [L19] assert 2 * ~x~0 >= -2147483648; [L19] ~x~0 := 2 * ~x~0; VAL [~x~0=1048576, ~y~0=1162261467] [L20] assert 3 * ~y~0 <= 2147483647; VAL [~x~0=1048576, ~y~0=1162261467] [L15] int x, y; [L16] x = 1 [L17] y = 1 VAL [x=1, y=1] [L18] COND TRUE x >= 0 VAL [x=1, y=1] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2, y=1] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2, y=3] [L18] COND TRUE x >= 0 VAL [x=2, y=3] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4, y=3] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4, y=9] [L18] COND TRUE x >= 0 VAL [x=4, y=9] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8, y=9] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8, y=27] [L18] COND TRUE x >= 0 VAL [x=8, y=27] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16, y=27] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16, y=81] [L18] COND TRUE x >= 0 VAL [x=16, y=81] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32, y=81] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32, y=243] [L18] COND TRUE x >= 0 VAL [x=32, y=243] [L19] EXPR 2*x [L19] x = 2*x VAL [x=64, y=243] [L20] EXPR 3*y [L20] y = 3*y VAL [x=64, y=729] [L18] COND TRUE x >= 0 VAL [x=64, y=729] [L19] EXPR 2*x [L19] x = 2*x VAL [x=128, y=729] [L20] EXPR 3*y [L20] y = 3*y VAL [x=128, y=2187] [L18] COND TRUE x >= 0 VAL [x=128, y=2187] [L19] EXPR 2*x [L19] x = 2*x VAL [x=256, y=2187] [L20] EXPR 3*y [L20] y = 3*y VAL [x=256, y=6561] [L18] COND TRUE x >= 0 VAL [x=256, y=6561] [L19] EXPR 2*x [L19] x = 2*x VAL [x=512, y=6561] [L20] EXPR 3*y [L20] y = 3*y VAL [x=512, y=19683] [L18] COND TRUE x >= 0 VAL [x=512, y=19683] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1024, y=19683] [L20] EXPR 3*y [L20] y = 3*y VAL [x=1024, y=59049] [L18] COND TRUE x >= 0 VAL [x=1024, y=59049] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2048, y=59049] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2048, y=177147] [L18] COND TRUE x >= 0 VAL [x=2048, y=177147] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4096, y=177147] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4096, y=531441] [L18] COND TRUE x >= 0 VAL [x=4096, y=531441] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8192, y=531441] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8192, y=1594323] [L18] COND TRUE x >= 0 VAL [x=8192, y=1594323] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16384, y=1594323] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16384, y=4782969] [L18] COND TRUE x >= 0 VAL [x=16384, y=4782969] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32768, y=4782969] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32768, y=14348907] [L18] COND TRUE x >= 0 VAL [x=32768, y=14348907] [L19] EXPR 2*x [L19] x = 2*x VAL [x=65536, y=14348907] [L20] EXPR 3*y [L20] y = 3*y VAL [x=65536, y=43046721] [L18] COND TRUE x >= 0 VAL [x=65536, y=43046721] [L19] EXPR 2*x [L19] x = 2*x VAL [x=131072, y=43046721] [L20] EXPR 3*y [L20] y = 3*y VAL [x=131072, y=129140163] [L18] COND TRUE x >= 0 VAL [x=131072, y=129140163] [L19] EXPR 2*x [L19] x = 2*x VAL [x=262144, y=129140163] [L20] EXPR 3*y [L20] y = 3*y VAL [x=262144, y=387420489] [L18] COND TRUE x >= 0 VAL [x=262144, y=387420489] [L19] EXPR 2*x [L19] x = 2*x VAL [x=524288, y=387420489] [L20] EXPR 3*y [L20] y = 3*y VAL [x=524288, y=1162261467] [L18] COND TRUE x >= 0 VAL [x=524288, y=1162261467] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1048576, y=1162261467] [L20] 3*y VAL [x=1048576, y=1162261467] ----- [2018-11-23 07:01:21,762 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_295e9d6a-7cb9-4bc9-8563-32184f3bd8c8/bin-2019/utaipan/witness.graphml [2018-11-23 07:01:21,762 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-11-23 07:01:21,762 INFO L168 Benchmark]: Toolchain (without parser) took 43670.78 ms. Allocated memory was 1.0 GB in the beginning and 1.5 GB in the end (delta: 475.0 MB). Free memory was 958.5 MB in the beginning and 1.4 GB in the end (delta: -396.4 MB). Peak memory consumption was 78.6 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:21,763 INFO L168 Benchmark]: CDTParser took 0.14 ms. Allocated memory is still 1.0 GB. Free memory is still 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:21,764 INFO L168 Benchmark]: CACSL2BoogieTranslator took 166.08 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:21,764 INFO L168 Benchmark]: Boogie Procedure Inliner took 12.24 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-11-23 07:01:21,764 INFO L168 Benchmark]: Boogie Preprocessor took 13.44 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:21,764 INFO L168 Benchmark]: RCFGBuilder took 155.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -242.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:21,764 INFO L168 Benchmark]: TraceAbstraction took 42555.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 273.2 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -178.6 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:21,765 INFO L168 Benchmark]: Witness Printer took 765.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. [2018-11-23 07:01:21,766 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 985.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 166.08 ms. Allocated memory is still 1.0 GB. Free memory was 958.5 MB in the beginning and 947.7 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. * Boogie Procedure Inliner took 12.24 ms. Allocated memory is still 1.0 GB. Free memory is still 947.7 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 13.44 ms. Allocated memory is still 1.0 GB. Free memory was 947.7 MB in the beginning and 945.0 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 155.37 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 201.9 MB). Free memory was 945.0 MB in the beginning and 1.2 GB in the end (delta: -242.2 MB). Peak memory consumption was 14.3 MB. Max. memory is 11.5 GB. * TraceAbstraction took 42555.16 ms. Allocated memory was 1.2 GB in the beginning and 1.5 GB in the end (delta: 273.2 MB). Free memory was 1.2 GB in the beginning and 1.4 GB in the end (delta: -178.6 MB). Peak memory consumption was 94.5 MB. Max. memory is 11.5 GB. * Witness Printer took 765.26 ms. Allocated memory is still 1.5 GB. Free memory was 1.4 GB in the beginning and 1.4 GB in the end (delta: 11.0 MB). Peak memory consumption was 11.0 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - CounterExampleResult [Line: 20]: integer overflow possible integer overflow possible We found a FailurePath: [L15] int x, y; [L16] x = 1 [L17] y = 1 VAL [x=1, y=1] [L18] COND TRUE x >= 0 VAL [x=1, y=1] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2, y=1] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2, y=3] [L18] COND TRUE x >= 0 VAL [x=2, y=3] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4, y=3] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4, y=9] [L18] COND TRUE x >= 0 VAL [x=4, y=9] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8, y=9] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8, y=27] [L18] COND TRUE x >= 0 VAL [x=8, y=27] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16, y=27] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16, y=81] [L18] COND TRUE x >= 0 VAL [x=16, y=81] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32, y=81] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32, y=243] [L18] COND TRUE x >= 0 VAL [x=32, y=243] [L19] EXPR 2*x [L19] x = 2*x VAL [x=64, y=243] [L20] EXPR 3*y [L20] y = 3*y VAL [x=64, y=729] [L18] COND TRUE x >= 0 VAL [x=64, y=729] [L19] EXPR 2*x [L19] x = 2*x VAL [x=128, y=729] [L20] EXPR 3*y [L20] y = 3*y VAL [x=128, y=2187] [L18] COND TRUE x >= 0 VAL [x=128, y=2187] [L19] EXPR 2*x [L19] x = 2*x VAL [x=256, y=2187] [L20] EXPR 3*y [L20] y = 3*y VAL [x=256, y=6561] [L18] COND TRUE x >= 0 VAL [x=256, y=6561] [L19] EXPR 2*x [L19] x = 2*x VAL [x=512, y=6561] [L20] EXPR 3*y [L20] y = 3*y VAL [x=512, y=19683] [L18] COND TRUE x >= 0 VAL [x=512, y=19683] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1024, y=19683] [L20] EXPR 3*y [L20] y = 3*y VAL [x=1024, y=59049] [L18] COND TRUE x >= 0 VAL [x=1024, y=59049] [L19] EXPR 2*x [L19] x = 2*x VAL [x=2048, y=59049] [L20] EXPR 3*y [L20] y = 3*y VAL [x=2048, y=177147] [L18] COND TRUE x >= 0 VAL [x=2048, y=177147] [L19] EXPR 2*x [L19] x = 2*x VAL [x=4096, y=177147] [L20] EXPR 3*y [L20] y = 3*y VAL [x=4096, y=531441] [L18] COND TRUE x >= 0 VAL [x=4096, y=531441] [L19] EXPR 2*x [L19] x = 2*x VAL [x=8192, y=531441] [L20] EXPR 3*y [L20] y = 3*y VAL [x=8192, y=1594323] [L18] COND TRUE x >= 0 VAL [x=8192, y=1594323] [L19] EXPR 2*x [L19] x = 2*x VAL [x=16384, y=1594323] [L20] EXPR 3*y [L20] y = 3*y VAL [x=16384, y=4782969] [L18] COND TRUE x >= 0 VAL [x=16384, y=4782969] [L19] EXPR 2*x [L19] x = 2*x VAL [x=32768, y=4782969] [L20] EXPR 3*y [L20] y = 3*y VAL [x=32768, y=14348907] [L18] COND TRUE x >= 0 VAL [x=32768, y=14348907] [L19] EXPR 2*x [L19] x = 2*x VAL [x=65536, y=14348907] [L20] EXPR 3*y [L20] y = 3*y VAL [x=65536, y=43046721] [L18] COND TRUE x >= 0 VAL [x=65536, y=43046721] [L19] EXPR 2*x [L19] x = 2*x VAL [x=131072, y=43046721] [L20] EXPR 3*y [L20] y = 3*y VAL [x=131072, y=129140163] [L18] COND TRUE x >= 0 VAL [x=131072, y=129140163] [L19] EXPR 2*x [L19] x = 2*x VAL [x=262144, y=129140163] [L20] EXPR 3*y [L20] y = 3*y VAL [x=262144, y=387420489] [L18] COND TRUE x >= 0 VAL [x=262144, y=387420489] [L19] EXPR 2*x [L19] x = 2*x VAL [x=524288, y=387420489] [L20] EXPR 3*y [L20] y = 3*y VAL [x=524288, y=1162261467] [L18] COND TRUE x >= 0 VAL [x=524288, y=1162261467] [L19] EXPR 2*x [L19] x = 2*x VAL [x=1048576, y=1162261467] [L20] 3*y VAL [x=1048576, y=1162261467] - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 19 locations, 4 error locations. UNSAFE Result, 42.5s OverallTime, 42 OverallIterations, 20 TraceHistogramMax, 1.1s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 393 SDtfs, 412 SDslu, 2581 SDs, 0 SdLazy, 1434 SolverSat, 55 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.7s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4606 GetRequests, 3445 SyntacticMatches, 362 SemanticMatches, 799 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5728 ImplicationChecksByTransitivity, 36.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=109occurred in iteration=41, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.1s AutomataMinimizationTime, 41 MinimizatonAttempts, 39 StatesRemovedByMinimization, 39 NontrivialMinimizations, HoareAnnotationStatistics: No data available, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.5s SatisfiabilityAnalysisTime, 38.9s InterpolantComputationTime, 4338 NumberOfCodeBlocks, 4338 NumberOfCodeBlocksAsserted, 205 NumberOfCheckSat, 6219 ConstructedInterpolants, 850 QuantifiedInterpolants, 3750180 SizeOfPredicates, 0 NumberOfNonLiveVariables, 3913 ConjunctsInSsa, 435 ConjunctsInUnsatCore, 115 InterpolantComputations, 4 PerfectInterpolantSequences, 0/34827 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be incorrect! Received shutdown request...