./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c --full-output --architecture 64bit -------------------------------------------------------------------------------- Checking for overflows Using default analysis Version 635dfa2a Calling Ultimate with: java -Dosgi.configuration.area=/tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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 932d0be5444dce6d8d9a378b61966d0cdf64a5cb ............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-02 14:09:24,871 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-02 14:09:24,872 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-02 14:09:24,879 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-02 14:09:24,879 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-02 14:09:24,879 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-02 14:09:24,880 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-02 14:09:24,881 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-02 14:09:24,882 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-02 14:09:24,882 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-02 14:09:24,883 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-02 14:09:24,883 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-02 14:09:24,883 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-02 14:09:24,884 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-02 14:09:24,884 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-02 14:09:24,885 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-02 14:09:24,885 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-02 14:09:24,886 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-02 14:09:24,887 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-02 14:09:24,888 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-02 14:09:24,888 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-02 14:09:24,889 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-02 14:09:24,890 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-02 14:09:24,890 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-02 14:09:24,890 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-02 14:09:24,891 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-02 14:09:24,891 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-02 14:09:24,892 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-02 14:09:24,892 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-02 14:09:24,893 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-02 14:09:24,893 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-02 14:09:24,893 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-02 14:09:24,893 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-02 14:09:24,894 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-02 14:09:24,894 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-02 14:09:24,894 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-02 14:09:24,895 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-02 14:09:24,902 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-02 14:09:24,902 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-02 14:09:24,903 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-02 14:09:24,903 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-02 14:09:24,903 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-02 14:09:24,904 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-02 14:09:24,904 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-02 14:09:24,905 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:09:24,905 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-02 14:09:24,905 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-02 14:09:24,906 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-02 14:09:24,906 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-02 14:09:24,906 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-02 14:09:24,906 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_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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 -> 932d0be5444dce6d8d9a378b61966d0cdf64a5cb [2018-12-02 14:09:24,922 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-02 14:09:24,929 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-02 14:09:24,931 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-02 14:09:24,932 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-02 14:09:24,933 INFO L276 PluginConnector]: CDTParser initialized [2018-12-02 14:09:24,933 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2018-12-02 14:09:24,967 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/data/f630cd934/67f196fed2ac47f1badf9b52cb8aca65/FLAGaab1fe9b9 [2018-12-02 14:09:25,354 INFO L307 CDTParser]: Found 1 translation units. [2018-12-02 14:09:25,354 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2018-12-02 14:09:25,358 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/data/f630cd934/67f196fed2ac47f1badf9b52cb8aca65/FLAGaab1fe9b9 [2018-12-02 14:09:25,365 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/data/f630cd934/67f196fed2ac47f1badf9b52cb8aca65 [2018-12-02 14:09:25,367 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-02 14:09:25,368 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-02 14:09:25,369 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-02 14:09:25,369 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-02 14:09:25,371 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-02 14:09:25,371 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,373 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@432dabb8 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25, skipping insertion in model container [2018-12-02 14:09:25,373 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,378 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-02 14:09:25,390 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-02 14:09:25,474 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:09:25,476 INFO L191 MainTranslator]: Completed pre-run [2018-12-02 14:09:25,485 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-02 14:09:25,493 INFO L195 MainTranslator]: Completed translation [2018-12-02 14:09:25,493 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25 WrapperNode [2018-12-02 14:09:25,493 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-02 14:09:25,494 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-02 14:09:25,494 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-02 14:09:25,494 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-02 14:09:25,500 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,504 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,510 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-02 14:09:25,510 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-02 14:09:25,510 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-02 14:09:25,510 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-02 14:09:25,518 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,518 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,518 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,519 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,521 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,524 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,524 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... [2018-12-02 14:09:25,525 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-02 14:09:25,525 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-02 14:09:25,525 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-02 14:09:25,525 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-02 14:09:25,526 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 1 with z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-02 14:09:25,585 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-02 14:09:25,585 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-02 14:09:25,586 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-02 14:09:25,586 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-02 14:09:25,586 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-02 14:09:25,586 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-02 14:09:25,686 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-02 14:09:25,686 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-02 14:09:25,686 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:25 BoogieIcfgContainer [2018-12-02 14:09:25,687 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-02 14:09:25,687 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-02 14:09:25,687 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-02 14:09:25,689 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-02 14:09:25,689 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 02.12 02:09:25" (1/3) ... [2018-12-02 14:09:25,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccdb402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:09:25, skipping insertion in model container [2018-12-02 14:09:25,690 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 02.12 02:09:25" (2/3) ... [2018-12-02 14:09:25,690 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7ccdb402 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 02.12 02:09:25, skipping insertion in model container [2018-12-02 14:09:25,691 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:25" (3/3) ... [2018-12-02 14:09:25,692 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-random2d_true-termination_true-no-overflow.c [2018-12-02 14:09:25,697 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-02 14:09:25,702 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 10 error locations. [2018-12-02 14:09:25,712 INFO L257 AbstractCegarLoop]: Starting to check reachability of 10 error locations. [2018-12-02 14:09:25,731 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-02 14:09:25,731 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-02 14:09:25,731 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-02 14:09:25,731 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-02 14:09:25,731 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-02 14:09:25,732 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-02 14:09:25,732 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-02 14:09:25,732 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-02 14:09:25,742 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states. [2018-12-02 14:09:25,745 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2018-12-02 14:09:25,745 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:25,746 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:25,747 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:25,751 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:25,751 INFO L82 PathProgramCache]: Analyzing trace with hash 252417093, now seen corresponding path program 1 times [2018-12-02 14:09:25,752 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:25,785 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,785 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:25,786 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,786 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:25,802 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:25,829 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:25,830 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:25,831 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:09:25,831 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:25,833 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:25,841 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:25,841 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:09:25,843 INFO L87 Difference]: Start difference. First operand 36 states. Second operand 3 states. [2018-12-02 14:09:25,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:25,875 INFO L93 Difference]: Finished difference Result 48 states and 56 transitions. [2018-12-02 14:09:25,875 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:25,876 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 7 [2018-12-02 14:09:25,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:25,882 INFO L225 Difference]: With dead ends: 48 [2018-12-02 14:09:25,882 INFO L226 Difference]: Without dead ends: 34 [2018-12-02 14:09:25,884 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-12-02 14:09:25,894 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-02 14:09:25,903 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 33. [2018-12-02 14:09:25,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-02 14:09:25,905 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 38 transitions. [2018-12-02 14:09:25,906 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 38 transitions. Word has length 7 [2018-12-02 14:09:25,906 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:25,906 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 38 transitions. [2018-12-02 14:09:25,906 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:25,906 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 38 transitions. [2018-12-02 14:09:25,906 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2018-12-02 14:09:25,906 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:25,907 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:25,907 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:25,907 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:25,907 INFO L82 PathProgramCache]: Analyzing trace with hash -765004662, now seen corresponding path program 1 times [2018-12-02 14:09:25,907 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:25,908 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,908 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:25,909 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,909 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:25,911 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:25,918 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:25,918 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:25,919 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:09:25,919 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:25,920 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:25,920 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:25,920 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:09:25,920 INFO L87 Difference]: Start difference. First operand 33 states and 38 transitions. Second operand 3 states. [2018-12-02 14:09:25,927 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:25,928 INFO L93 Difference]: Finished difference Result 33 states and 38 transitions. [2018-12-02 14:09:25,928 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:25,928 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 8 [2018-12-02 14:09:25,928 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:25,929 INFO L225 Difference]: With dead ends: 33 [2018-12-02 14:09:25,929 INFO L226 Difference]: Without dead ends: 32 [2018-12-02 14:09:25,930 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-12-02 14:09:25,930 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-02 14:09:25,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-02 14:09:25,932 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-02 14:09:25,932 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 37 transitions. [2018-12-02 14:09:25,933 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 37 transitions. Word has length 8 [2018-12-02 14:09:25,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:25,933 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 37 transitions. [2018-12-02 14:09:25,933 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:25,933 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 37 transitions. [2018-12-02 14:09:25,933 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:09:25,933 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:25,933 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:25,934 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:25,934 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:25,934 INFO L82 PathProgramCache]: Analyzing trace with hash -1157363318, now seen corresponding path program 1 times [2018-12-02 14:09:25,934 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,935 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:25,935 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,935 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:25,940 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:25,952 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:25,952 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:25,952 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:09:25,952 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:25,953 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:25,953 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:25,953 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:09:25,953 INFO L87 Difference]: Start difference. First operand 32 states and 37 transitions. Second operand 3 states. [2018-12-02 14:09:25,971 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:25,971 INFO L93 Difference]: Finished difference Result 55 states and 67 transitions. [2018-12-02 14:09:25,971 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:25,972 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-02 14:09:25,972 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:25,972 INFO L225 Difference]: With dead ends: 55 [2018-12-02 14:09:25,972 INFO L226 Difference]: Without dead ends: 53 [2018-12-02 14:09:25,973 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-12-02 14:09:25,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 53 states. [2018-12-02 14:09:25,976 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 53 to 47. [2018-12-02 14:09:25,976 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 47 states. [2018-12-02 14:09:25,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 47 states to 47 states and 63 transitions. [2018-12-02 14:09:25,977 INFO L78 Accepts]: Start accepts. Automaton has 47 states and 63 transitions. Word has length 11 [2018-12-02 14:09:25,977 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:25,977 INFO L480 AbstractCegarLoop]: Abstraction has 47 states and 63 transitions. [2018-12-02 14:09:25,977 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:25,977 INFO L276 IsEmpty]: Start isEmpty. Operand 47 states and 63 transitions. [2018-12-02 14:09:25,977 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-02 14:09:25,977 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:25,977 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:25,978 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:25,978 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:25,978 INFO L82 PathProgramCache]: Analyzing trace with hash -1157326159, now seen corresponding path program 1 times [2018-12-02 14:09:25,978 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:25,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,979 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:25,979 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:25,979 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:25,983 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:25,996 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-02 14:09:25,996 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:25,996 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:25,997 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 12 with the following transitions: [2018-12-02 14:09:25,998 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [14], [15], [17], [59], [66], [67], [68] [2018-12-02 14:09:26,017 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:26,017 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:26,099 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:26,099 INFO L272 AbstractInterpreter]: Visited 10 different actions 20 times. Merged at 4 different actions 8 times. Never widened. Performed 87 root evaluator evaluations with a maximum evaluation depth of 3. Performed 87 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 6 variables. [2018-12-02 14:09:26,104 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,105 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:26,105 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,105 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 2 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:09:26,112 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,112 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:26,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:26,143 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,143 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:26,158 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,173 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:26,173 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 7 [2018-12-02 14:09:26,173 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:26,173 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:09:26,173 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:09:26,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:26,174 INFO L87 Difference]: Start difference. First operand 47 states and 63 transitions. Second operand 6 states. [2018-12-02 14:09:26,220 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,220 INFO L93 Difference]: Finished difference Result 108 states and 146 transitions. [2018-12-02 14:09:26,220 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:09:26,220 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 11 [2018-12-02 14:09:26,220 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,221 INFO L225 Difference]: With dead ends: 108 [2018-12-02 14:09:26,221 INFO L226 Difference]: Without dead ends: 107 [2018-12-02 14:09:26,221 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 18 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=47, Invalid=63, Unknown=0, NotChecked=0, Total=110 [2018-12-02 14:09:26,222 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2018-12-02 14:09:26,225 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 44. [2018-12-02 14:09:26,225 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 44 states. [2018-12-02 14:09:26,226 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 44 states to 44 states and 59 transitions. [2018-12-02 14:09:26,226 INFO L78 Accepts]: Start accepts. Automaton has 44 states and 59 transitions. Word has length 11 [2018-12-02 14:09:26,226 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,226 INFO L480 AbstractCegarLoop]: Abstraction has 44 states and 59 transitions. [2018-12-02 14:09:26,226 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:09:26,226 INFO L276 IsEmpty]: Start isEmpty. Operand 44 states and 59 transitions. [2018-12-02 14:09:26,226 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-02 14:09:26,226 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,227 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,227 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,227 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,227 INFO L82 PathProgramCache]: Analyzing trace with hash -1518524433, now seen corresponding path program 1 times [2018-12-02 14:09:26,227 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,228 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,228 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,228 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,231 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,244 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,245 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:26,245 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:09:26,245 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:26,245 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:26,245 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:26,245 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:09:26,245 INFO L87 Difference]: Start difference. First operand 44 states and 59 transitions. Second operand 3 states. [2018-12-02 14:09:26,261 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,261 INFO L93 Difference]: Finished difference Result 81 states and 113 transitions. [2018-12-02 14:09:26,262 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:26,262 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-02 14:09:26,262 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,263 INFO L225 Difference]: With dead ends: 81 [2018-12-02 14:09:26,263 INFO L226 Difference]: Without dead ends: 79 [2018-12-02 14:09:26,263 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-12-02 14:09:26,263 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2018-12-02 14:09:26,269 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 75. [2018-12-02 14:09:26,269 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 75 states. [2018-12-02 14:09:26,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 110 transitions. [2018-12-02 14:09:26,271 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 110 transitions. Word has length 12 [2018-12-02 14:09:26,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,271 INFO L480 AbstractCegarLoop]: Abstraction has 75 states and 110 transitions. [2018-12-02 14:09:26,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:26,271 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 110 transitions. [2018-12-02 14:09:26,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-02 14:09:26,272 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,272 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,272 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,272 INFO L82 PathProgramCache]: Analyzing trace with hash 170574579, now seen corresponding path program 1 times [2018-12-02 14:09:26,273 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,274 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,274 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,274 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,278 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,296 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,296 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:26,296 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:09:26,296 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:26,296 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:26,296 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:26,297 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:09:26,297 INFO L87 Difference]: Start difference. First operand 75 states and 110 transitions. Second operand 3 states. [2018-12-02 14:09:26,316 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,316 INFO L93 Difference]: Finished difference Result 143 states and 215 transitions. [2018-12-02 14:09:26,316 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:26,316 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-02 14:09:26,317 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,317 INFO L225 Difference]: With dead ends: 143 [2018-12-02 14:09:26,317 INFO L226 Difference]: Without dead ends: 141 [2018-12-02 14:09:26,317 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-12-02 14:09:26,318 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 141 states. [2018-12-02 14:09:26,325 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 141 to 133. [2018-12-02 14:09:26,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 133 states. [2018-12-02 14:09:26,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 199 transitions. [2018-12-02 14:09:26,327 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 199 transitions. Word has length 13 [2018-12-02 14:09:26,327 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,327 INFO L480 AbstractCegarLoop]: Abstraction has 133 states and 199 transitions. [2018-12-02 14:09:26,327 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:26,327 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 199 transitions. [2018-12-02 14:09:26,327 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-02 14:09:26,327 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,327 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,328 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,328 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,328 INFO L82 PathProgramCache]: Analyzing trace with hash 992844728, now seen corresponding path program 1 times [2018-12-02 14:09:26,328 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,328 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,329 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,329 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,329 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,331 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,339 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,340 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:26,340 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-02 14:09:26,340 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:26,340 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:26,340 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:26,340 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-02 14:09:26,340 INFO L87 Difference]: Start difference. First operand 133 states and 199 transitions. Second operand 3 states. [2018-12-02 14:09:26,356 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,356 INFO L93 Difference]: Finished difference Result 259 states and 393 transitions. [2018-12-02 14:09:26,357 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:26,357 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-02 14:09:26,357 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,358 INFO L225 Difference]: With dead ends: 259 [2018-12-02 14:09:26,358 INFO L226 Difference]: Without dead ends: 257 [2018-12-02 14:09:26,358 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-12-02 14:09:26,358 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 257 states. [2018-12-02 14:09:26,366 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 257 to 253. [2018-12-02 14:09:26,366 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 253 states. [2018-12-02 14:09:26,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 253 states to 253 states and 381 transitions. [2018-12-02 14:09:26,368 INFO L78 Accepts]: Start accepts. Automaton has 253 states and 381 transitions. Word has length 14 [2018-12-02 14:09:26,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,368 INFO L480 AbstractCegarLoop]: Abstraction has 253 states and 381 transitions. [2018-12-02 14:09:26,368 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:26,368 INFO L276 IsEmpty]: Start isEmpty. Operand 253 states and 381 transitions. [2018-12-02 14:09:26,368 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 19 [2018-12-02 14:09:26,368 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,368 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,369 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,369 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,369 INFO L82 PathProgramCache]: Analyzing trace with hash -1784292138, now seen corresponding path program 1 times [2018-12-02 14:09:26,369 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,370 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,370 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,370 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,385 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,385 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,386 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:26,386 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 19 with the following transitions: [2018-12-02 14:09:26,386 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [23], [24], [25], [27], [66], [67], [68] [2018-12-02 14:09:26,386 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:26,387 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:26,420 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:26,421 INFO L272 AbstractInterpreter]: Visited 13 different actions 37 times. Merged at 7 different actions 21 times. Never widened. Performed 186 root evaluator evaluations with a maximum evaluation depth of 3. Performed 186 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 14:09:26,423 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,423 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:26,423 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,423 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:09:26,430 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,430 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:26,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,436 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:26,438 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,438 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:26,448 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,462 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:26,462 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 14:09:26,462 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:26,463 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:09:26,463 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:09:26,463 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,463 INFO L87 Difference]: Start difference. First operand 253 states and 381 transitions. Second operand 4 states. [2018-12-02 14:09:26,489 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,489 INFO L93 Difference]: Finished difference Result 453 states and 692 transitions. [2018-12-02 14:09:26,489 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:09:26,490 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 18 [2018-12-02 14:09:26,490 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,491 INFO L225 Difference]: With dead ends: 453 [2018-12-02 14:09:26,491 INFO L226 Difference]: Without dead ends: 451 [2018-12-02 14:09:26,491 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 34 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,492 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 451 states. [2018-12-02 14:09:26,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 451 to 361. [2018-12-02 14:09:26,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 361 states. [2018-12-02 14:09:26,503 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 361 states to 361 states and 547 transitions. [2018-12-02 14:09:26,503 INFO L78 Accepts]: Start accepts. Automaton has 361 states and 547 transitions. Word has length 18 [2018-12-02 14:09:26,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,503 INFO L480 AbstractCegarLoop]: Abstraction has 361 states and 547 transitions. [2018-12-02 14:09:26,503 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:09:26,504 INFO L276 IsEmpty]: Start isEmpty. Operand 361 states and 547 transitions. [2018-12-02 14:09:26,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-02 14:09:26,504 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,504 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,505 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,505 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,505 INFO L82 PathProgramCache]: Analyzing trace with hash -457667387, now seen corresponding path program 1 times [2018-12-02 14:09:26,505 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,506 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,506 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,506 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,522 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,522 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,522 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:26,523 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-02 14:09:26,523 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [23], [25], [26], [29], [32], [34], [36], [66], [67], [68] [2018-12-02 14:09:26,524 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:26,524 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:26,569 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:26,569 INFO L272 AbstractInterpreter]: Visited 16 different actions 60 times. Merged at 11 different actions 41 times. Never widened. Performed 290 root evaluator evaluations with a maximum evaluation depth of 3. Performed 290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 14:09:26,571 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,572 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:26,572 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,572 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:26,578 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,578 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:26,583 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,584 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:26,592 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,593 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:26,600 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,618 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:09:26,618 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 5 [2018-12-02 14:09:26,618 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:26,618 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:26,618 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:26,618 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,619 INFO L87 Difference]: Start difference. First operand 361 states and 547 transitions. Second operand 3 states. [2018-12-02 14:09:26,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,631 INFO L93 Difference]: Finished difference Result 361 states and 547 transitions. [2018-12-02 14:09:26,632 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:26,632 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 20 [2018-12-02 14:09:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,633 INFO L225 Difference]: With dead ends: 361 [2018-12-02 14:09:26,633 INFO L226 Difference]: Without dead ends: 360 [2018-12-02 14:09:26,633 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 38 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,633 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 360 states. [2018-12-02 14:09:26,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 360 to 360. [2018-12-02 14:09:26,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 360 states. [2018-12-02 14:09:26,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 360 states to 360 states and 539 transitions. [2018-12-02 14:09:26,643 INFO L78 Accepts]: Start accepts. Automaton has 360 states and 539 transitions. Word has length 20 [2018-12-02 14:09:26,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,644 INFO L480 AbstractCegarLoop]: Abstraction has 360 states and 539 transitions. [2018-12-02 14:09:26,644 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 360 states and 539 transitions. [2018-12-02 14:09:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-02 14:09:26,644 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,644 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,644 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,645 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,645 INFO L82 PathProgramCache]: Analyzing trace with hash -1302601353, now seen corresponding path program 1 times [2018-12-02 14:09:26,645 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,645 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,646 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,646 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,646 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,662 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,662 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,662 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:26,662 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-02 14:09:26,662 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [32], [34], [35], [36], [66], [67], [68] [2018-12-02 14:09:26,663 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:26,663 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:26,688 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:26,688 INFO L272 AbstractInterpreter]: Visited 14 different actions 41 times. Merged at 8 different actions 24 times. Never widened. Performed 198 root evaluator evaluations with a maximum evaluation depth of 3. Performed 198 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 14:09:26,696 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,696 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:26,696 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,696 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:26,705 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,705 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:26,711 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,712 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:26,714 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,714 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:26,729 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,743 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:26,743 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 14:09:26,743 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:26,744 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:09:26,744 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:09:26,744 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,744 INFO L87 Difference]: Start difference. First operand 360 states and 539 transitions. Second operand 4 states. [2018-12-02 14:09:26,770 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,771 INFO L93 Difference]: Finished difference Result 613 states and 923 transitions. [2018-12-02 14:09:26,771 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:09:26,771 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 21 [2018-12-02 14:09:26,771 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,772 INFO L225 Difference]: With dead ends: 613 [2018-12-02 14:09:26,773 INFO L226 Difference]: Without dead ends: 612 [2018-12-02 14:09:26,773 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 612 states. [2018-12-02 14:09:26,784 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 612 to 468. [2018-12-02 14:09:26,784 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 468 states. [2018-12-02 14:09:26,785 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 468 states to 468 states and 705 transitions. [2018-12-02 14:09:26,785 INFO L78 Accepts]: Start accepts. Automaton has 468 states and 705 transitions. Word has length 21 [2018-12-02 14:09:26,785 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,786 INFO L480 AbstractCegarLoop]: Abstraction has 468 states and 705 transitions. [2018-12-02 14:09:26,786 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:09:26,786 INFO L276 IsEmpty]: Start isEmpty. Operand 468 states and 705 transitions. [2018-12-02 14:09:26,786 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2018-12-02 14:09:26,786 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,786 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,786 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,787 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,787 INFO L82 PathProgramCache]: Analyzing trace with hash -789737976, now seen corresponding path program 1 times [2018-12-02 14:09:26,787 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,787 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,788 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,788 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,788 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,791 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,802 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:26,802 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 23 with the following transitions: [2018-12-02 14:09:26,802 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [38], [41], [42], [43], [45], [66], [67], [68] [2018-12-02 14:09:26,803 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:26,803 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:26,829 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:26,829 INFO L272 AbstractInterpreter]: Visited 15 different actions 45 times. Merged at 9 different actions 27 times. Never widened. Performed 210 root evaluator evaluations with a maximum evaluation depth of 3. Performed 210 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 14:09:26,831 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,831 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:26,831 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,831 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:26,837 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,838 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:26,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,845 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:26,847 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,848 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:26,867 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,882 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:26,882 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 14:09:26,882 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:26,882 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:09:26,882 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:09:26,882 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,882 INFO L87 Difference]: Start difference. First operand 468 states and 705 transitions. Second operand 4 states. [2018-12-02 14:09:26,914 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:26,914 INFO L93 Difference]: Finished difference Result 838 states and 1288 transitions. [2018-12-02 14:09:26,915 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:09:26,915 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 22 [2018-12-02 14:09:26,915 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:26,918 INFO L225 Difference]: With dead ends: 838 [2018-12-02 14:09:26,918 INFO L226 Difference]: Without dead ends: 836 [2018-12-02 14:09:26,919 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 42 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:26,919 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 836 states. [2018-12-02 14:09:26,943 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 836 to 672. [2018-12-02 14:09:26,943 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 672 states. [2018-12-02 14:09:26,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 672 states to 672 states and 1011 transitions. [2018-12-02 14:09:26,946 INFO L78 Accepts]: Start accepts. Automaton has 672 states and 1011 transitions. Word has length 22 [2018-12-02 14:09:26,946 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:26,946 INFO L480 AbstractCegarLoop]: Abstraction has 672 states and 1011 transitions. [2018-12-02 14:09:26,946 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:09:26,946 INFO L276 IsEmpty]: Start isEmpty. Operand 672 states and 1011 transitions. [2018-12-02 14:09:26,947 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2018-12-02 14:09:26,947 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:26,947 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:26,948 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:26,948 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:26,948 INFO L82 PathProgramCache]: Analyzing trace with hash -1545985083, now seen corresponding path program 1 times [2018-12-02 14:09:26,948 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:26,949 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,949 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:26,950 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:26,950 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:26,954 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:26,975 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:26,975 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:26,975 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:26,975 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 25 with the following transitions: [2018-12-02 14:09:26,975 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [38], [41], [43], [44], [47], [50], [52], [54], [66], [67], [68] [2018-12-02 14:09:26,976 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:26,976 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:27,002 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:27,002 INFO L272 AbstractInterpreter]: Visited 18 different actions 57 times. Merged at 12 different actions 36 times. Never widened. Performed 246 root evaluator evaluations with a maximum evaluation depth of 3. Performed 246 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 14:09:27,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,003 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:27,003 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:27,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:27,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:27,015 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,016 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:27,021 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,021 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:27,027 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 7 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,041 INFO L312 seRefinementStrategy]: Constructing automaton from 2 perfect and 1 imperfect interpolant sequences. [2018-12-02 14:09:27,041 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2, 2] imperfect sequences [3] total 5 [2018-12-02 14:09:27,041 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:27,042 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-02 14:09:27,042 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-02 14:09:27,042 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:27,042 INFO L87 Difference]: Start difference. First operand 672 states and 1011 transitions. Second operand 3 states. [2018-12-02 14:09:27,057 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:27,057 INFO L93 Difference]: Finished difference Result 672 states and 1011 transitions. [2018-12-02 14:09:27,057 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-02 14:09:27,057 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 24 [2018-12-02 14:09:27,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:27,059 INFO L225 Difference]: With dead ends: 672 [2018-12-02 14:09:27,059 INFO L226 Difference]: Without dead ends: 671 [2018-12-02 14:09:27,059 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 50 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:27,060 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 671 states. [2018-12-02 14:09:27,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 671 to 671. [2018-12-02 14:09:27,072 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 671 states. [2018-12-02 14:09:27,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 671 states to 671 states and 995 transitions. [2018-12-02 14:09:27,074 INFO L78 Accepts]: Start accepts. Automaton has 671 states and 995 transitions. Word has length 24 [2018-12-02 14:09:27,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:27,074 INFO L480 AbstractCegarLoop]: Abstraction has 671 states and 995 transitions. [2018-12-02 14:09:27,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-02 14:09:27,074 INFO L276 IsEmpty]: Start isEmpty. Operand 671 states and 995 transitions. [2018-12-02 14:09:27,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:09:27,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:27,075 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:27,076 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:27,076 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,076 INFO L82 PathProgramCache]: Analyzing trace with hash 582614026, now seen corresponding path program 2 times [2018-12-02 14:09:27,076 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:27,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,077 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:27,077 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,077 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:27,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,093 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,093 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,093 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:27,093 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:27,094 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:27,094 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,094 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:27,100 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:27,100 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:27,108 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:09:27,108 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:27,109 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:27,111 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,112 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:27,133 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 0 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,148 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:27,148 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 14:09:27,148 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:27,148 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:09:27,148 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:09:27,149 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:27,149 INFO L87 Difference]: Start difference. First operand 671 states and 995 transitions. Second operand 5 states. [2018-12-02 14:09:27,191 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:27,191 INFO L93 Difference]: Finished difference Result 1156 states and 1733 transitions. [2018-12-02 14:09:27,191 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:09:27,191 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 25 [2018-12-02 14:09:27,192 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:27,194 INFO L225 Difference]: With dead ends: 1156 [2018-12-02 14:09:27,195 INFO L226 Difference]: Without dead ends: 1154 [2018-12-02 14:09:27,195 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:27,196 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1154 states. [2018-12-02 14:09:27,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1154 to 917. [2018-12-02 14:09:27,226 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 917 states. [2018-12-02 14:09:27,229 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 917 states to 917 states and 1355 transitions. [2018-12-02 14:09:27,229 INFO L78 Accepts]: Start accepts. Automaton has 917 states and 1355 transitions. Word has length 25 [2018-12-02 14:09:27,229 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:27,229 INFO L480 AbstractCegarLoop]: Abstraction has 917 states and 1355 transitions. [2018-12-02 14:09:27,230 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:09:27,230 INFO L276 IsEmpty]: Start isEmpty. Operand 917 states and 1355 transitions. [2018-12-02 14:09:27,230 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2018-12-02 14:09:27,230 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:27,231 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:27,231 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:27,231 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,231 INFO L82 PathProgramCache]: Analyzing trace with hash -680711543, now seen corresponding path program 1 times [2018-12-02 14:09:27,231 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,232 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:27,232 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,233 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:27,236 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,252 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,252 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,252 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:27,252 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 26 with the following transitions: [2018-12-02 14:09:27,252 INFO L205 CegarAbsIntRunner]: [0], [4], [13], [15], [17], [20], [29], [38], [47], [50], [52], [53], [54], [66], [67], [68] [2018-12-02 14:09:27,253 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-02 14:09:27,253 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-02 14:09:27,296 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-02 14:09:27,296 INFO L272 AbstractInterpreter]: Visited 16 different actions 60 times. Merged at 11 different actions 41 times. Never widened. Performed 290 root evaluator evaluations with a maximum evaluation depth of 3. Performed 290 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-02 14:09:27,298 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-02 14:09:27,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:27,307 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:27,307 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:27,312 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,314 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:27,316 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,316 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:27,331 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,354 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:27,354 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-02 14:09:27,354 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:27,354 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-02 14:09:27,355 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-02 14:09:27,355 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:27,355 INFO L87 Difference]: Start difference. First operand 917 states and 1355 transitions. Second operand 4 states. [2018-12-02 14:09:27,390 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:27,390 INFO L93 Difference]: Finished difference Result 1561 states and 2332 transitions. [2018-12-02 14:09:27,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-02 14:09:27,390 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 25 [2018-12-02 14:09:27,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:27,393 INFO L225 Difference]: With dead ends: 1561 [2018-12-02 14:09:27,393 INFO L226 Difference]: Without dead ends: 1560 [2018-12-02 14:09:27,394 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-02 14:09:27,395 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1560 states. [2018-12-02 14:09:27,413 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1560 to 1197. [2018-12-02 14:09:27,413 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1197 states. [2018-12-02 14:09:27,415 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1197 states to 1197 states and 1772 transitions. [2018-12-02 14:09:27,416 INFO L78 Accepts]: Start accepts. Automaton has 1197 states and 1772 transitions. Word has length 25 [2018-12-02 14:09:27,416 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:27,416 INFO L480 AbstractCegarLoop]: Abstraction has 1197 states and 1772 transitions. [2018-12-02 14:09:27,416 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-02 14:09:27,416 INFO L276 IsEmpty]: Start isEmpty. Operand 1197 states and 1772 transitions. [2018-12-02 14:09:27,416 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-02 14:09:27,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:27,417 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:27,417 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:27,417 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,417 INFO L82 PathProgramCache]: Analyzing trace with hash 1259703649, now seen corresponding path program 2 times [2018-12-02 14:09:27,417 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,418 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:27,418 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,418 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:27,422 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,445 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:27,446 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:27,446 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:27,446 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,446 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:27,452 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:27,452 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:27,459 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:09:27,459 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:27,460 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:27,462 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,462 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:27,494 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,509 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:27,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 14:09:27,509 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:27,509 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:09:27,510 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:09:27,510 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:27,510 INFO L87 Difference]: Start difference. First operand 1197 states and 1772 transitions. Second operand 5 states. [2018-12-02 14:09:27,570 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:27,570 INFO L93 Difference]: Finished difference Result 1955 states and 2906 transitions. [2018-12-02 14:09:27,571 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:09:27,571 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 29 [2018-12-02 14:09:27,571 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:27,576 INFO L225 Difference]: With dead ends: 1955 [2018-12-02 14:09:27,576 INFO L226 Difference]: Without dead ends: 1954 [2018-12-02 14:09:27,577 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:27,579 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 1954 states. [2018-12-02 14:09:27,615 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 1954 to 1433. [2018-12-02 14:09:27,615 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1433 states. [2018-12-02 14:09:27,618 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1433 states to 1433 states and 2118 transitions. [2018-12-02 14:09:27,618 INFO L78 Accepts]: Start accepts. Automaton has 1433 states and 2118 transitions. Word has length 29 [2018-12-02 14:09:27,618 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:27,618 INFO L480 AbstractCegarLoop]: Abstraction has 1433 states and 2118 transitions. [2018-12-02 14:09:27,618 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:09:27,618 INFO L276 IsEmpty]: Start isEmpty. Operand 1433 states and 2118 transitions. [2018-12-02 14:09:27,619 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2018-12-02 14:09:27,619 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:27,619 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:27,619 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:27,619 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,619 INFO L82 PathProgramCache]: Analyzing trace with hash -886740333, now seen corresponding path program 2 times [2018-12-02 14:09:27,619 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:27,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,620 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:27,620 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,620 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:27,623 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,650 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:27,650 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:27,650 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:27,650 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,650 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:27,658 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:27,658 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:27,665 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:09:27,665 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:27,667 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:27,669 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,669 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:27,690 INFO L134 CoverageAnalysis]: Checked inductivity of 25 backedges. 0 proven. 25 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,715 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:27,715 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 14:09:27,715 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:27,715 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:09:27,715 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:09:27,716 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:27,716 INFO L87 Difference]: Start difference. First operand 1433 states and 2118 transitions. Second operand 5 states. [2018-12-02 14:09:27,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:27,766 INFO L93 Difference]: Finished difference Result 2466 states and 3697 transitions. [2018-12-02 14:09:27,766 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:09:27,766 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 31 [2018-12-02 14:09:27,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:27,770 INFO L225 Difference]: With dead ends: 2466 [2018-12-02 14:09:27,770 INFO L226 Difference]: Without dead ends: 2464 [2018-12-02 14:09:27,771 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:27,772 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 2464 states. [2018-12-02 14:09:27,805 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 2464 to 1963. [2018-12-02 14:09:27,805 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 1963 states. [2018-12-02 14:09:27,808 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 1963 states to 1963 states and 2886 transitions. [2018-12-02 14:09:27,809 INFO L78 Accepts]: Start accepts. Automaton has 1963 states and 2886 transitions. Word has length 31 [2018-12-02 14:09:27,809 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:27,809 INFO L480 AbstractCegarLoop]: Abstraction has 1963 states and 2886 transitions. [2018-12-02 14:09:27,809 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:09:27,809 INFO L276 IsEmpty]: Start isEmpty. Operand 1963 states and 2886 transitions. [2018-12-02 14:09:27,810 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2018-12-02 14:09:27,810 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:27,810 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:27,810 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:27,810 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:27,810 INFO L82 PathProgramCache]: Analyzing trace with hash -716039594, now seen corresponding path program 3 times [2018-12-02 14:09:27,810 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:27,811 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,811 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:27,812 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:27,812 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:27,816 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:27,846 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,846 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:27,846 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:27,846 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:27,846 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:27,847 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:27,856 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:27,856 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:27,864 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:27,864 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:27,865 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:27,868 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,869 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:27,903 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 0 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:27,927 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:27,927 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 14:09:27,927 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:27,928 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:09:27,928 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:09:27,928 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:27,928 INFO L87 Difference]: Start difference. First operand 1963 states and 2886 transitions. Second operand 6 states. [2018-12-02 14:09:28,003 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:28,003 INFO L93 Difference]: Finished difference Result 3177 states and 4736 transitions. [2018-12-02 14:09:28,003 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:09:28,003 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 32 [2018-12-02 14:09:28,004 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:28,011 INFO L225 Difference]: With dead ends: 3177 [2018-12-02 14:09:28,012 INFO L226 Difference]: Without dead ends: 3175 [2018-12-02 14:09:28,014 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:28,016 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 3175 states. [2018-12-02 14:09:28,070 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 3175 to 2567. [2018-12-02 14:09:28,070 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 2567 states. [2018-12-02 14:09:28,073 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 2567 states to 2567 states and 3753 transitions. [2018-12-02 14:09:28,074 INFO L78 Accepts]: Start accepts. Automaton has 2567 states and 3753 transitions. Word has length 32 [2018-12-02 14:09:28,074 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:28,074 INFO L480 AbstractCegarLoop]: Abstraction has 2567 states and 3753 transitions. [2018-12-02 14:09:28,074 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:09:28,074 INFO L276 IsEmpty]: Start isEmpty. Operand 2567 states and 3753 transitions. [2018-12-02 14:09:28,075 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2018-12-02 14:09:28,075 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:28,075 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:28,075 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:28,075 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:28,075 INFO L82 PathProgramCache]: Analyzing trace with hash 1327564892, now seen corresponding path program 2 times [2018-12-02 14:09:28,075 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:28,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,076 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:28,076 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,076 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:28,080 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:28,106 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:28,106 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:28,106 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:28,106 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,106 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:28,114 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:28,114 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:28,121 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2018-12-02 14:09:28,121 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:28,122 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:28,126 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:28,173 INFO L134 CoverageAnalysis]: Checked inductivity of 30 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,188 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:28,188 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2018-12-02 14:09:28,188 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:28,189 INFO L459 AbstractCegarLoop]: Interpolant automaton has 5 states [2018-12-02 14:09:28,189 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2018-12-02 14:09:28,189 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:28,189 INFO L87 Difference]: Start difference. First operand 2567 states and 3753 transitions. Second operand 5 states. [2018-12-02 14:09:28,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:28,266 INFO L93 Difference]: Finished difference Result 4186 states and 6159 transitions. [2018-12-02 14:09:28,266 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-02 14:09:28,266 INFO L78 Accepts]: Start accepts. Automaton has 5 states. Word has length 35 [2018-12-02 14:09:28,266 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:28,272 INFO L225 Difference]: With dead ends: 4186 [2018-12-02 14:09:28,272 INFO L226 Difference]: Without dead ends: 4185 [2018-12-02 14:09:28,274 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 67 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=28, Invalid=28, Unknown=0, NotChecked=0, Total=56 [2018-12-02 14:09:28,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4185 states. [2018-12-02 14:09:28,323 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4185 to 3075. [2018-12-02 14:09:28,323 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3075 states. [2018-12-02 14:09:28,328 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3075 states to 3075 states and 4487 transitions. [2018-12-02 14:09:28,328 INFO L78 Accepts]: Start accepts. Automaton has 3075 states and 4487 transitions. Word has length 35 [2018-12-02 14:09:28,328 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:28,328 INFO L480 AbstractCegarLoop]: Abstraction has 3075 states and 4487 transitions. [2018-12-02 14:09:28,328 INFO L481 AbstractCegarLoop]: Interpolant automaton has 5 states. [2018-12-02 14:09:28,328 INFO L276 IsEmpty]: Start isEmpty. Operand 3075 states and 4487 transitions. [2018-12-02 14:09:28,329 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-02 14:09:28,329 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:28,329 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:28,329 INFO L423 AbstractCegarLoop]: === Iteration 19 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:28,329 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:28,329 INFO L82 PathProgramCache]: Analyzing trace with hash 1468116811, now seen corresponding path program 3 times [2018-12-02 14:09:28,329 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,330 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:28,330 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,330 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:28,333 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:28,370 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,370 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:28,370 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:28,370 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:28,370 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,371 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:28,378 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:28,379 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:28,388 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:28,388 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:28,389 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:28,394 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,395 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:28,425 INFO L134 CoverageAnalysis]: Checked inductivity of 48 backedges. 0 proven. 48 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,440 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:28,440 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 14:09:28,440 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:28,441 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:09:28,441 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:09:28,441 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:28,441 INFO L87 Difference]: Start difference. First operand 3075 states and 4487 transitions. Second operand 6 states. [2018-12-02 14:09:28,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:28,529 INFO L93 Difference]: Finished difference Result 4731 states and 6951 transitions. [2018-12-02 14:09:28,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:09:28,529 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 37 [2018-12-02 14:09:28,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:28,536 INFO L225 Difference]: With dead ends: 4731 [2018-12-02 14:09:28,536 INFO L226 Difference]: Without dead ends: 4730 [2018-12-02 14:09:28,538 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 70 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:28,541 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 4730 states. [2018-12-02 14:09:28,596 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 4730 to 3463. [2018-12-02 14:09:28,596 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3463 states. [2018-12-02 14:09:28,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3463 states to 3463 states and 5051 transitions. [2018-12-02 14:09:28,599 INFO L78 Accepts]: Start accepts. Automaton has 3463 states and 5051 transitions. Word has length 37 [2018-12-02 14:09:28,599 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:28,599 INFO L480 AbstractCegarLoop]: Abstraction has 3463 states and 5051 transitions. [2018-12-02 14:09:28,599 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:09:28,599 INFO L276 IsEmpty]: Start isEmpty. Operand 3463 states and 5051 transitions. [2018-12-02 14:09:28,600 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2018-12-02 14:09:28,600 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:28,600 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:28,600 INFO L423 AbstractCegarLoop]: === Iteration 20 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:28,600 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:28,600 INFO L82 PathProgramCache]: Analyzing trace with hash -1042968950, now seen corresponding path program 4 times [2018-12-02 14:09:28,600 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,601 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:28,601 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,601 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:28,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:28,644 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,644 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,644 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:28,644 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:28,645 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:28,645 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,645 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:28,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:28,653 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:28,659 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:28,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:28,663 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,663 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:28,725 INFO L134 CoverageAnalysis]: Checked inductivity of 66 backedges. 0 proven. 66 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,739 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:28,739 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 14:09:28,739 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:28,740 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:09:28,740 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:09:28,740 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:28,740 INFO L87 Difference]: Start difference. First operand 3463 states and 5051 transitions. Second operand 7 states. [2018-12-02 14:09:28,799 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:28,799 INFO L93 Difference]: Finished difference Result 5330 states and 7888 transitions. [2018-12-02 14:09:28,800 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:09:28,800 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 39 [2018-12-02 14:09:28,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:28,808 INFO L225 Difference]: With dead ends: 5330 [2018-12-02 14:09:28,808 INFO L226 Difference]: Without dead ends: 5328 [2018-12-02 14:09:28,810 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 73 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:28,813 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 5328 states. [2018-12-02 14:09:28,863 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 5328 to 4381. [2018-12-02 14:09:28,863 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4381 states. [2018-12-02 14:09:28,867 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4381 states to 4381 states and 6357 transitions. [2018-12-02 14:09:28,867 INFO L78 Accepts]: Start accepts. Automaton has 4381 states and 6357 transitions. Word has length 39 [2018-12-02 14:09:28,867 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:28,867 INFO L480 AbstractCegarLoop]: Abstraction has 4381 states and 6357 transitions. [2018-12-02 14:09:28,867 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:09:28,868 INFO L276 IsEmpty]: Start isEmpty. Operand 4381 states and 6357 transitions. [2018-12-02 14:09:28,868 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 41 [2018-12-02 14:09:28,868 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:28,868 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:28,868 INFO L423 AbstractCegarLoop]: === Iteration 21 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:28,869 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:28,869 INFO L82 PathProgramCache]: Analyzing trace with hash 535132776, now seen corresponding path program 3 times [2018-12-02 14:09:28,869 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,869 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:28,869 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:28,869 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:28,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:28,896 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,896 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:28,897 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:28,897 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:28,897 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:28,897 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:28,905 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:28,905 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:28,912 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:28,912 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:28,913 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:28,915 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,915 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:28,968 INFO L134 CoverageAnalysis]: Checked inductivity of 51 backedges. 0 proven. 51 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:28,983 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:28,983 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 14:09:28,983 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:28,983 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:09:28,984 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:09:28,984 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:28,984 INFO L87 Difference]: Start difference. First operand 4381 states and 6357 transitions. Second operand 6 states. [2018-12-02 14:09:29,051 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:29,051 INFO L93 Difference]: Finished difference Result 7073 states and 10429 transitions. [2018-12-02 14:09:29,052 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:09:29,052 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 40 [2018-12-02 14:09:29,052 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:29,061 INFO L225 Difference]: With dead ends: 7073 [2018-12-02 14:09:29,061 INFO L226 Difference]: Without dead ends: 7071 [2018-12-02 14:09:29,065 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 76 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:29,070 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 7071 states. [2018-12-02 14:09:29,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 7071 to 5733. [2018-12-02 14:09:29,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5733 states. [2018-12-02 14:09:29,154 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5733 states to 5733 states and 8269 transitions. [2018-12-02 14:09:29,154 INFO L78 Accepts]: Start accepts. Automaton has 5733 states and 8269 transitions. Word has length 40 [2018-12-02 14:09:29,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:29,154 INFO L480 AbstractCegarLoop]: Abstraction has 5733 states and 8269 transitions. [2018-12-02 14:09:29,154 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:09:29,154 INFO L276 IsEmpty]: Start isEmpty. Operand 5733 states and 8269 transitions. [2018-12-02 14:09:29,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 14:09:29,155 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:29,155 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:29,155 INFO L423 AbstractCegarLoop]: === Iteration 22 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:29,155 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:29,156 INFO L82 PathProgramCache]: Analyzing trace with hash -1865791691, now seen corresponding path program 4 times [2018-12-02 14:09:29,156 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:29,156 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:29,156 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:29,156 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:29,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:29,209 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,209 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:29,209 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:29,210 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:29,210 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:29,210 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:29,210 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:29,215 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:29,216 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:29,222 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:29,223 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:29,225 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,225 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:29,275 INFO L134 CoverageAnalysis]: Checked inductivity of 80 backedges. 0 proven. 80 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,289 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:29,289 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 14:09:29,289 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:29,290 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:09:29,290 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:09:29,290 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:29,290 INFO L87 Difference]: Start difference. First operand 5733 states and 8269 transitions. Second operand 7 states. [2018-12-02 14:09:29,373 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:29,373 INFO L93 Difference]: Finished difference Result 8442 states and 12279 transitions. [2018-12-02 14:09:29,374 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:09:29,374 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 45 [2018-12-02 14:09:29,374 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:29,382 INFO L225 Difference]: With dead ends: 8442 [2018-12-02 14:09:29,382 INFO L226 Difference]: Without dead ends: 8441 [2018-12-02 14:09:29,386 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 95 GetRequests, 85 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:29,393 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 8441 states. [2018-12-02 14:09:29,489 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 8441 to 6241. [2018-12-02 14:09:29,489 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6241 states. [2018-12-02 14:09:29,495 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6241 states to 6241 states and 9003 transitions. [2018-12-02 14:09:29,496 INFO L78 Accepts]: Start accepts. Automaton has 6241 states and 9003 transitions. Word has length 45 [2018-12-02 14:09:29,496 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:29,496 INFO L480 AbstractCegarLoop]: Abstraction has 6241 states and 9003 transitions. [2018-12-02 14:09:29,496 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:09:29,496 INFO L276 IsEmpty]: Start isEmpty. Operand 6241 states and 9003 transitions. [2018-12-02 14:09:29,497 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2018-12-02 14:09:29,497 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:29,497 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:29,497 INFO L423 AbstractCegarLoop]: === Iteration 23 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:29,497 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:29,497 INFO L82 PathProgramCache]: Analyzing trace with hash 702806639, now seen corresponding path program 3 times [2018-12-02 14:09:29,497 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:29,498 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:29,498 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:29,498 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:29,501 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:29,546 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:29,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:29,546 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:29,546 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:29,546 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:29,546 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:29,554 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:29,555 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:29,562 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:29,562 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:29,563 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:29,566 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,566 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:29,599 INFO L134 CoverageAnalysis]: Checked inductivity of 60 backedges. 0 proven. 60 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,623 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:29,623 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 9 [2018-12-02 14:09:29,623 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:29,623 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-02 14:09:29,623 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-02 14:09:29,623 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:29,623 INFO L87 Difference]: Start difference. First operand 6241 states and 9003 transitions. Second operand 6 states. [2018-12-02 14:09:29,740 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:29,740 INFO L93 Difference]: Finished difference Result 9588 states and 13947 transitions. [2018-12-02 14:09:29,740 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-02 14:09:29,740 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 45 [2018-12-02 14:09:29,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:29,752 INFO L225 Difference]: With dead ends: 9588 [2018-12-02 14:09:29,753 INFO L226 Difference]: Without dead ends: 9587 [2018-12-02 14:09:29,758 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=45, Unknown=0, NotChecked=0, Total=90 [2018-12-02 14:09:29,765 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 9587 states. [2018-12-02 14:09:29,866 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 9587 to 7029. [2018-12-02 14:09:29,866 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7029 states. [2018-12-02 14:09:29,872 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7029 states to 7029 states and 10135 transitions. [2018-12-02 14:09:29,872 INFO L78 Accepts]: Start accepts. Automaton has 7029 states and 10135 transitions. Word has length 45 [2018-12-02 14:09:29,872 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:29,872 INFO L480 AbstractCegarLoop]: Abstraction has 7029 states and 10135 transitions. [2018-12-02 14:09:29,872 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-02 14:09:29,872 INFO L276 IsEmpty]: Start isEmpty. Operand 7029 states and 10135 transitions. [2018-12-02 14:09:29,873 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2018-12-02 14:09:29,873 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:29,873 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:29,873 INFO L423 AbstractCegarLoop]: === Iteration 24 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:29,873 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:29,873 INFO L82 PathProgramCache]: Analyzing trace with hash 1845802966, now seen corresponding path program 5 times [2018-12-02 14:09:29,874 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:29,874 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:29,874 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:29,874 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:29,878 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:29,911 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,911 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:29,911 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:29,911 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:29,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:29,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:29,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:29,918 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:29,918 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:29,926 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 14:09:29,926 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:29,927 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:29,930 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,930 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:29,967 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:29,982 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:29,982 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 14:09:29,982 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:29,982 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:09:29,982 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:09:29,982 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:29,983 INFO L87 Difference]: Start difference. First operand 7029 states and 10135 transitions. Second operand 8 states. [2018-12-02 14:09:30,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:30,078 INFO L93 Difference]: Finished difference Result 10385 states and 15210 transitions. [2018-12-02 14:09:30,078 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:09:30,078 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 46 [2018-12-02 14:09:30,078 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:30,086 INFO L225 Difference]: With dead ends: 10385 [2018-12-02 14:09:30,086 INFO L226 Difference]: Without dead ends: 10383 [2018-12-02 14:09:30,090 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:30,095 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 10383 states. [2018-12-02 14:09:30,191 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 10383 to 8669. [2018-12-02 14:09:30,191 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8669 states. [2018-12-02 14:09:30,197 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8669 states to 8669 states and 12442 transitions. [2018-12-02 14:09:30,197 INFO L78 Accepts]: Start accepts. Automaton has 8669 states and 12442 transitions. Word has length 46 [2018-12-02 14:09:30,197 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:30,197 INFO L480 AbstractCegarLoop]: Abstraction has 8669 states and 12442 transitions. [2018-12-02 14:09:30,198 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:09:30,198 INFO L276 IsEmpty]: Start isEmpty. Operand 8669 states and 12442 transitions. [2018-12-02 14:09:30,198 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2018-12-02 14:09:30,199 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:30,199 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 4, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:30,199 INFO L423 AbstractCegarLoop]: === Iteration 25 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:30,199 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:30,199 INFO L82 PathProgramCache]: Analyzing trace with hash -1310627277, now seen corresponding path program 4 times [2018-12-02 14:09:30,199 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:30,200 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:30,200 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:30,200 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:30,202 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:30,234 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:30,234 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:30,234 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:30,235 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:30,235 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:30,235 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:30,235 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:30,242 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:30,242 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:30,249 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:30,250 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:30,253 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:30,253 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:30,288 INFO L134 CoverageAnalysis]: Checked inductivity of 86 backedges. 0 proven. 86 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:30,302 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:30,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 14:09:30,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:30,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:09:30,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:09:30,303 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:30,303 INFO L87 Difference]: Start difference. First operand 8669 states and 12442 transitions. Second operand 7 states. [2018-12-02 14:09:30,423 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:30,423 INFO L93 Difference]: Finished difference Result 13316 states and 19433 transitions. [2018-12-02 14:09:30,423 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:09:30,423 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 49 [2018-12-02 14:09:30,423 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:30,431 INFO L225 Difference]: With dead ends: 13316 [2018-12-02 14:09:30,431 INFO L226 Difference]: Without dead ends: 13314 [2018-12-02 14:09:30,434 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 103 GetRequests, 93 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:30,440 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 13314 states. [2018-12-02 14:09:30,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 13314 to 10971. [2018-12-02 14:09:30,556 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10971 states. [2018-12-02 14:09:30,564 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10971 states to 10971 states and 15661 transitions. [2018-12-02 14:09:30,565 INFO L78 Accepts]: Start accepts. Automaton has 10971 states and 15661 transitions. Word has length 49 [2018-12-02 14:09:30,565 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:30,565 INFO L480 AbstractCegarLoop]: Abstraction has 10971 states and 15661 transitions. [2018-12-02 14:09:30,565 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:09:30,565 INFO L276 IsEmpty]: Start isEmpty. Operand 10971 states and 15661 transitions. [2018-12-02 14:09:30,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:09:30,566 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:30,567 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:30,567 INFO L423 AbstractCegarLoop]: === Iteration 26 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:30,567 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:30,567 INFO L82 PathProgramCache]: Analyzing trace with hash 1711194378, now seen corresponding path program 6 times [2018-12-02 14:09:30,567 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:30,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:30,568 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:30,568 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:30,568 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:30,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:30,611 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:30,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:30,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:30,612 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:30,612 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:30,612 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:30,612 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:30,619 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:30,619 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:30,628 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:30,628 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:30,629 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:30,632 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:30,632 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:30,696 INFO L134 CoverageAnalysis]: Checked inductivity of 141 backedges. 0 proven. 141 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:30,710 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:30,710 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 14:09:30,710 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:30,711 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:09:30,711 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:09:30,711 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:30,711 INFO L87 Difference]: Start difference. First operand 10971 states and 15661 transitions. Second operand 9 states. [2018-12-02 14:09:30,838 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:30,839 INFO L93 Difference]: Finished difference Result 15626 states and 22669 transitions. [2018-12-02 14:09:30,839 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:09:30,839 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 53 [2018-12-02 14:09:30,839 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:30,849 INFO L225 Difference]: With dead ends: 15626 [2018-12-02 14:09:30,849 INFO L226 Difference]: Without dead ends: 15624 [2018-12-02 14:09:30,853 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 99 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:30,861 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 15624 states. [2018-12-02 14:09:31,004 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 15624 to 13095. [2018-12-02 14:09:31,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 13095 states. [2018-12-02 14:09:31,014 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 13095 states to 13095 states and 18613 transitions. [2018-12-02 14:09:31,014 INFO L78 Accepts]: Start accepts. Automaton has 13095 states and 18613 transitions. Word has length 53 [2018-12-02 14:09:31,015 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:31,015 INFO L480 AbstractCegarLoop]: Abstraction has 13095 states and 18613 transitions. [2018-12-02 14:09:31,015 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:09:31,015 INFO L276 IsEmpty]: Start isEmpty. Operand 13095 states and 18613 transitions. [2018-12-02 14:09:31,016 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2018-12-02 14:09:31,016 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:31,016 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:31,016 INFO L423 AbstractCegarLoop]: === Iteration 27 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:31,016 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:31,017 INFO L82 PathProgramCache]: Analyzing trace with hash -434547425, now seen corresponding path program 5 times [2018-12-02 14:09:31,017 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:31,017 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:31,017 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:31,017 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:31,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:31,064 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:31,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:31,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:31,064 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:31,064 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:31,064 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:31,064 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:31,074 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:31,074 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:31,087 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 14:09:31,087 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:31,088 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:31,093 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:31,093 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:31,150 INFO L134 CoverageAnalysis]: Checked inductivity of 120 backedges. 0 proven. 120 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:31,172 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:31,172 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 14:09:31,172 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:31,172 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:09:31,172 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:09:31,173 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:31,173 INFO L87 Difference]: Start difference. First operand 13095 states and 18613 transitions. Second operand 8 states. [2018-12-02 14:09:31,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:31,390 INFO L93 Difference]: Finished difference Result 19894 states and 28525 transitions. [2018-12-02 14:09:31,390 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:09:31,390 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 53 [2018-12-02 14:09:31,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:31,403 INFO L225 Difference]: With dead ends: 19894 [2018-12-02 14:09:31,403 INFO L226 Difference]: Without dead ends: 19893 [2018-12-02 14:09:31,407 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 112 GetRequests, 100 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:31,416 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 19893 states. [2018-12-02 14:09:31,581 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 19893 to 14133. [2018-12-02 14:09:31,582 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 14133 states. [2018-12-02 14:09:31,592 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 14133 states to 14133 states and 20101 transitions. [2018-12-02 14:09:31,593 INFO L78 Accepts]: Start accepts. Automaton has 14133 states and 20101 transitions. Word has length 53 [2018-12-02 14:09:31,593 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:31,593 INFO L480 AbstractCegarLoop]: Abstraction has 14133 states and 20101 transitions. [2018-12-02 14:09:31,593 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:09:31,593 INFO L276 IsEmpty]: Start isEmpty. Operand 14133 states and 20101 transitions. [2018-12-02 14:09:31,594 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 56 [2018-12-02 14:09:31,594 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:31,595 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 5, 5, 5, 5, 5, 5, 5, 4, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:31,595 INFO L423 AbstractCegarLoop]: === Iteration 28 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:31,595 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:31,595 INFO L82 PathProgramCache]: Analyzing trace with hash 941207746, now seen corresponding path program 4 times [2018-12-02 14:09:31,595 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:31,596 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:31,596 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:31,596 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:31,599 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:31,642 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:31,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:31,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:31,642 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:31,642 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:31,642 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:31,642 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:31,652 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:31,652 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:31,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:31,660 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:31,664 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:31,664 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:31,703 INFO L134 CoverageAnalysis]: Checked inductivity of 100 backedges. 0 proven. 100 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:31,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:31,718 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6, 6] total 11 [2018-12-02 14:09:31,718 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:31,718 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-02 14:09:31,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-02 14:09:31,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:31,718 INFO L87 Difference]: Start difference. First operand 14133 states and 20101 transitions. Second operand 7 states. [2018-12-02 14:09:31,901 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:31,901 INFO L93 Difference]: Finished difference Result 20778 states and 29841 transitions. [2018-12-02 14:09:31,901 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-02 14:09:31,901 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 55 [2018-12-02 14:09:31,902 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:31,915 INFO L225 Difference]: With dead ends: 20778 [2018-12-02 14:09:31,915 INFO L226 Difference]: Without dead ends: 20777 [2018-12-02 14:09:31,920 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 115 GetRequests, 105 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=66, Invalid=66, Unknown=0, NotChecked=0, Total=132 [2018-12-02 14:09:31,931 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20777 states. [2018-12-02 14:09:32,143 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20777 to 15385. [2018-12-02 14:09:32,143 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 15385 states. [2018-12-02 14:09:32,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 15385 states to 15385 states and 21885 transitions. [2018-12-02 14:09:32,155 INFO L78 Accepts]: Start accepts. Automaton has 15385 states and 21885 transitions. Word has length 55 [2018-12-02 14:09:32,155 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:32,155 INFO L480 AbstractCegarLoop]: Abstraction has 15385 states and 21885 transitions. [2018-12-02 14:09:32,155 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-02 14:09:32,155 INFO L276 IsEmpty]: Start isEmpty. Operand 15385 states and 21885 transitions. [2018-12-02 14:09:32,156 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2018-12-02 14:09:32,156 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:32,156 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 5, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:32,156 INFO L423 AbstractCegarLoop]: === Iteration 29 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:32,156 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:32,156 INFO L82 PathProgramCache]: Analyzing trace with hash 1897860808, now seen corresponding path program 5 times [2018-12-02 14:09:32,157 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:32,157 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:32,157 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:32,157 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:32,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:32,189 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:32,189 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:32,189 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:32,190 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:32,190 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:32,190 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:32,190 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:32,198 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:32,198 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:32,216 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 14:09:32,216 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:32,217 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:32,220 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:32,220 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:32,268 INFO L134 CoverageAnalysis]: Checked inductivity of 130 backedges. 0 proven. 130 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:32,283 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:32,283 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 14:09:32,283 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:32,283 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:09:32,283 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:09:32,283 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:32,284 INFO L87 Difference]: Start difference. First operand 15385 states and 21885 transitions. Second operand 8 states. [2018-12-02 14:09:32,468 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:32,468 INFO L93 Difference]: Finished difference Result 22701 states and 32845 transitions. [2018-12-02 14:09:32,468 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:09:32,468 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 58 [2018-12-02 14:09:32,469 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:32,483 INFO L225 Difference]: With dead ends: 22701 [2018-12-02 14:09:32,483 INFO L226 Difference]: Without dead ends: 22699 [2018-12-02 14:09:32,487 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 110 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:32,498 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 22699 states. [2018-12-02 14:09:32,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 22699 to 18977. [2018-12-02 14:09:32,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 18977 states. [2018-12-02 14:09:32,724 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18977 states to 18977 states and 26868 transitions. [2018-12-02 14:09:32,725 INFO L78 Accepts]: Start accepts. Automaton has 18977 states and 26868 transitions. Word has length 58 [2018-12-02 14:09:32,725 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:32,725 INFO L480 AbstractCegarLoop]: Abstraction has 18977 states and 26868 transitions. [2018-12-02 14:09:32,725 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:09:32,725 INFO L276 IsEmpty]: Start isEmpty. Operand 18977 states and 26868 transitions. [2018-12-02 14:09:32,726 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 61 [2018-12-02 14:09:32,726 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:32,726 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:32,726 INFO L423 AbstractCegarLoop]: === Iteration 30 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:32,726 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:32,726 INFO L82 PathProgramCache]: Analyzing trace with hash 1695921494, now seen corresponding path program 7 times [2018-12-02 14:09:32,726 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:32,727 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:32,727 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:32,727 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:32,731 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:32,773 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:32,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:32,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:32,773 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:32,773 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:32,773 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:32,773 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:32,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:32,779 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:32,787 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:32,788 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:32,791 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:32,791 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:32,863 INFO L134 CoverageAnalysis]: Checked inductivity of 189 backedges. 0 proven. 189 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:32,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:32,877 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 14:09:32,877 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:32,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:09:32,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:09:32,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:32,878 INFO L87 Difference]: Start difference. First operand 18977 states and 26868 transitions. Second operand 10 states. [2018-12-02 14:09:33,093 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:33,093 INFO L93 Difference]: Finished difference Result 26255 states and 37782 transitions. [2018-12-02 14:09:33,093 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:09:33,093 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 60 [2018-12-02 14:09:33,094 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:33,114 INFO L225 Difference]: With dead ends: 26255 [2018-12-02 14:09:33,114 INFO L226 Difference]: Without dead ends: 26253 [2018-12-02 14:09:33,118 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 128 GetRequests, 112 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:33,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26253 states. [2018-12-02 14:09:33,419 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26253 to 22315. [2018-12-02 14:09:33,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 22315 states. [2018-12-02 14:09:33,437 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22315 states to 22315 states and 31477 transitions. [2018-12-02 14:09:33,437 INFO L78 Accepts]: Start accepts. Automaton has 22315 states and 31477 transitions. Word has length 60 [2018-12-02 14:09:33,437 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:33,437 INFO L480 AbstractCegarLoop]: Abstraction has 22315 states and 31477 transitions. [2018-12-02 14:09:33,437 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:09:33,437 INFO L276 IsEmpty]: Start isEmpty. Operand 22315 states and 31477 transitions. [2018-12-02 14:09:33,438 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 62 [2018-12-02 14:09:33,438 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:33,438 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:33,438 INFO L423 AbstractCegarLoop]: === Iteration 31 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:33,439 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:33,439 INFO L82 PathProgramCache]: Analyzing trace with hash 2090391817, now seen corresponding path program 6 times [2018-12-02 14:09:33,439 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:33,439 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:33,439 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:33,439 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:33,442 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:33,485 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:33,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:33,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:33,485 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:33,485 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:33,485 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:33,485 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:33,492 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:33,492 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:33,501 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:33,501 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:33,502 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:33,509 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:33,509 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:33,574 INFO L134 CoverageAnalysis]: Checked inductivity of 168 backedges. 0 proven. 168 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:33,589 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:33,589 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 14:09:33,589 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:33,589 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:09:33,590 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:09:33,590 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:33,590 INFO L87 Difference]: Start difference. First operand 22315 states and 31477 transitions. Second operand 9 states. [2018-12-02 14:09:33,833 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:33,833 INFO L93 Difference]: Finished difference Result 32959 states and 46936 transitions. [2018-12-02 14:09:33,833 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:09:33,833 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 61 [2018-12-02 14:09:33,833 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:33,857 INFO L225 Difference]: With dead ends: 32959 [2018-12-02 14:09:33,857 INFO L226 Difference]: Without dead ends: 32958 [2018-12-02 14:09:33,862 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 129 GetRequests, 115 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:33,880 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32958 states. [2018-12-02 14:09:34,227 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32958 to 23709. [2018-12-02 14:09:34,228 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 23709 states. [2018-12-02 14:09:34,246 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 23709 states to 23709 states and 33466 transitions. [2018-12-02 14:09:34,246 INFO L78 Accepts]: Start accepts. Automaton has 23709 states and 33466 transitions. Word has length 61 [2018-12-02 14:09:34,247 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:34,247 INFO L480 AbstractCegarLoop]: Abstraction has 23709 states and 33466 transitions. [2018-12-02 14:09:34,247 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:09:34,247 INFO L276 IsEmpty]: Start isEmpty. Operand 23709 states and 33466 transitions. [2018-12-02 14:09:34,248 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 66 [2018-12-02 14:09:34,248 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:34,248 INFO L402 BasicCegarLoop]: trace histogram [6, 6, 6, 6, 6, 6, 6, 6, 6, 5, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:34,249 INFO L423 AbstractCegarLoop]: === Iteration 32 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:34,249 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:34,249 INFO L82 PathProgramCache]: Analyzing trace with hash -1521886379, now seen corresponding path program 5 times [2018-12-02 14:09:34,249 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:34,249 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:34,249 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:34,249 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:34,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:34,279 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:34,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:34,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:34,279 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:34,279 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:34,279 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:34,279 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:34,289 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:34,289 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:34,301 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2018-12-02 14:09:34,301 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:34,302 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:34,307 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:34,307 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:34,349 INFO L134 CoverageAnalysis]: Checked inductivity of 150 backedges. 0 proven. 150 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:34,374 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:34,374 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 13 [2018-12-02 14:09:34,374 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:34,374 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-02 14:09:34,374 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-02 14:09:34,375 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:34,375 INFO L87 Difference]: Start difference. First operand 23709 states and 33466 transitions. Second operand 8 states. [2018-12-02 14:09:34,669 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:34,669 INFO L93 Difference]: Finished difference Result 33673 states and 48022 transitions. [2018-12-02 14:09:34,669 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-02 14:09:34,669 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 65 [2018-12-02 14:09:34,669 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:34,694 INFO L225 Difference]: With dead ends: 33673 [2018-12-02 14:09:34,694 INFO L226 Difference]: Without dead ends: 33672 [2018-12-02 14:09:34,699 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 136 GetRequests, 124 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=91, Invalid=91, Unknown=0, NotChecked=0, Total=182 [2018-12-02 14:09:34,718 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33672 states. [2018-12-02 14:09:35,021 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33672 to 25273. [2018-12-02 14:09:35,021 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 25273 states. [2018-12-02 14:09:35,041 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 25273 states to 25273 states and 35688 transitions. [2018-12-02 14:09:35,041 INFO L78 Accepts]: Start accepts. Automaton has 25273 states and 35688 transitions. Word has length 65 [2018-12-02 14:09:35,042 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:35,042 INFO L480 AbstractCegarLoop]: Abstraction has 25273 states and 35688 transitions. [2018-12-02 14:09:35,042 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-02 14:09:35,042 INFO L276 IsEmpty]: Start isEmpty. Operand 25273 states and 35688 transitions. [2018-12-02 14:09:35,043 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:09:35,043 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:35,043 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:35,044 INFO L423 AbstractCegarLoop]: === Iteration 33 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:35,044 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:35,044 INFO L82 PathProgramCache]: Analyzing trace with hash -690121846, now seen corresponding path program 8 times [2018-12-02 14:09:35,044 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:35,044 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:35,044 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:35,044 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:35,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:35,097 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:35,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:35,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:35,097 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:35,097 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:35,097 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:35,097 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:35,104 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:35,104 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:35,118 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 14:09:35,118 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:35,119 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:35,126 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:35,126 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:35,201 INFO L134 CoverageAnalysis]: Checked inductivity of 244 backedges. 0 proven. 244 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:35,215 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:35,215 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 14:09:35,215 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:35,215 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:09:35,216 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:09:35,216 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:09:35,216 INFO L87 Difference]: Start difference. First operand 25273 states and 35688 transitions. Second operand 11 states. [2018-12-02 14:09:35,510 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:35,510 INFO L93 Difference]: Finished difference Result 34134 states and 48972 transitions. [2018-12-02 14:09:35,510 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:09:35,510 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 67 [2018-12-02 14:09:35,511 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:35,538 INFO L225 Difference]: With dead ends: 34134 [2018-12-02 14:09:35,538 INFO L226 Difference]: Without dead ends: 34132 [2018-12-02 14:09:35,544 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 143 GetRequests, 125 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:09:35,564 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34132 states. [2018-12-02 14:09:35,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34132 to 29349. [2018-12-02 14:09:35,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29349 states. [2018-12-02 14:09:35,971 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29349 states to 29349 states and 41310 transitions. [2018-12-02 14:09:35,971 INFO L78 Accepts]: Start accepts. Automaton has 29349 states and 41310 transitions. Word has length 67 [2018-12-02 14:09:35,971 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:35,971 INFO L480 AbstractCegarLoop]: Abstraction has 29349 states and 41310 transitions. [2018-12-02 14:09:35,971 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:09:35,971 INFO L276 IsEmpty]: Start isEmpty. Operand 29349 states and 41310 transitions. [2018-12-02 14:09:35,973 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2018-12-02 14:09:35,973 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:35,973 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 6, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:35,973 INFO L423 AbstractCegarLoop]: === Iteration 34 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:35,973 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:35,973 INFO L82 PathProgramCache]: Analyzing trace with hash -1044856365, now seen corresponding path program 6 times [2018-12-02 14:09:35,973 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:35,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:35,974 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:35,974 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:35,974 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:35,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:36,019 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:36,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:36,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:36,020 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:36,020 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:36,020 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:36,020 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:36,030 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:36,030 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:36,041 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:36,041 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:36,042 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:36,048 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:36,048 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:36,095 INFO L134 CoverageAnalysis]: Checked inductivity of 183 backedges. 0 proven. 183 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:36,109 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:36,109 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 14:09:36,109 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:36,109 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:09:36,110 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:09:36,110 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:36,110 INFO L87 Difference]: Start difference. First operand 29349 states and 41310 transitions. Second operand 9 states. [2018-12-02 14:09:36,408 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:36,408 INFO L93 Difference]: Finished difference Result 41884 states and 59975 transitions. [2018-12-02 14:09:36,408 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:09:36,409 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 67 [2018-12-02 14:09:36,409 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:36,439 INFO L225 Difference]: With dead ends: 41884 [2018-12-02 14:09:36,439 INFO L226 Difference]: Without dead ends: 41882 [2018-12-02 14:09:36,446 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 141 GetRequests, 127 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:36,469 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 41882 states. [2018-12-02 14:09:36,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 41882 to 35469. [2018-12-02 14:09:36,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35469 states. [2018-12-02 14:09:36,984 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35469 states to 35469 states and 49722 transitions. [2018-12-02 14:09:36,984 INFO L78 Accepts]: Start accepts. Automaton has 35469 states and 49722 transitions. Word has length 67 [2018-12-02 14:09:36,985 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:36,985 INFO L480 AbstractCegarLoop]: Abstraction has 35469 states and 49722 transitions. [2018-12-02 14:09:36,985 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:09:36,985 INFO L276 IsEmpty]: Start isEmpty. Operand 35469 states and 49722 transitions. [2018-12-02 14:09:36,987 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 70 [2018-12-02 14:09:36,987 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:36,987 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:36,987 INFO L423 AbstractCegarLoop]: === Iteration 35 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:36,987 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:36,987 INFO L82 PathProgramCache]: Analyzing trace with hash -1351429389, now seen corresponding path program 7 times [2018-12-02 14:09:36,987 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:36,988 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:36,988 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:36,988 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:36,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:37,056 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:37,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:37,056 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:37,056 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:37,056 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:37,056 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:37,064 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:37,064 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:37,072 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:37,073 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:37,078 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:37,078 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:37,140 INFO L134 CoverageAnalysis]: Checked inductivity of 224 backedges. 0 proven. 224 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:37,155 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:37,155 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 14:09:37,155 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:37,155 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:09:37,155 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:09:37,155 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:37,155 INFO L87 Difference]: Start difference. First operand 35469 states and 49722 transitions. Second operand 10 states. [2018-12-02 14:09:37,528 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:37,528 INFO L93 Difference]: Finished difference Result 51133 states and 72401 transitions. [2018-12-02 14:09:37,529 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:09:37,529 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 69 [2018-12-02 14:09:37,529 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:37,570 INFO L225 Difference]: With dead ends: 51133 [2018-12-02 14:09:37,571 INFO L226 Difference]: Without dead ends: 51132 [2018-12-02 14:09:37,579 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 146 GetRequests, 130 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:37,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51132 states. [2018-12-02 14:09:38,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51132 to 37265. [2018-12-02 14:09:38,083 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37265 states. [2018-12-02 14:09:38,112 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37265 states to 37265 states and 52275 transitions. [2018-12-02 14:09:38,112 INFO L78 Accepts]: Start accepts. Automaton has 37265 states and 52275 transitions. Word has length 69 [2018-12-02 14:09:38,112 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:38,112 INFO L480 AbstractCegarLoop]: Abstraction has 37265 states and 52275 transitions. [2018-12-02 14:09:38,112 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:09:38,113 INFO L276 IsEmpty]: Start isEmpty. Operand 37265 states and 52275 transitions. [2018-12-02 14:09:38,115 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2018-12-02 14:09:38,115 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:38,115 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:38,116 INFO L423 AbstractCegarLoop]: === Iteration 36 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:38,116 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:38,116 INFO L82 PathProgramCache]: Analyzing trace with hash -2049109290, now seen corresponding path program 9 times [2018-12-02 14:09:38,116 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:38,117 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:38,117 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:38,117 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:38,121 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:38,176 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:38,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:38,176 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:38,176 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:38,176 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:38,176 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:38,177 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:38,182 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:38,183 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:38,192 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:38,193 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:38,193 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:38,198 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:38,199 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:38,302 INFO L134 CoverageAnalysis]: Checked inductivity of 306 backedges. 0 proven. 306 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:38,316 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:38,316 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 14:09:38,316 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:38,316 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:09:38,317 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:09:38,317 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:09:38,317 INFO L87 Difference]: Start difference. First operand 37265 states and 52275 transitions. Second operand 12 states. [2018-12-02 14:09:38,792 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:38,792 INFO L93 Difference]: Finished difference Result 49303 states and 70258 transitions. [2018-12-02 14:09:38,792 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:09:38,792 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 74 [2018-12-02 14:09:38,792 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:38,833 INFO L225 Difference]: With dead ends: 49303 [2018-12-02 14:09:38,833 INFO L226 Difference]: Without dead ends: 49301 [2018-12-02 14:09:38,841 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 158 GetRequests, 138 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:09:38,869 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49301 states. [2018-12-02 14:09:39,362 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49301 to 42817. [2018-12-02 14:09:39,362 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 42817 states. [2018-12-02 14:09:39,396 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 42817 states to 42817 states and 59893 transitions. [2018-12-02 14:09:39,396 INFO L78 Accepts]: Start accepts. Automaton has 42817 states and 59893 transitions. Word has length 74 [2018-12-02 14:09:39,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:39,396 INFO L480 AbstractCegarLoop]: Abstraction has 42817 states and 59893 transitions. [2018-12-02 14:09:39,396 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:09:39,396 INFO L276 IsEmpty]: Start isEmpty. Operand 42817 states and 59893 transitions. [2018-12-02 14:09:39,398 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2018-12-02 14:09:39,398 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:39,398 INFO L402 BasicCegarLoop]: trace histogram [7, 7, 7, 7, 7, 7, 7, 7, 7, 6, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:39,399 INFO L423 AbstractCegarLoop]: === Iteration 37 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:39,399 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:39,399 INFO L82 PathProgramCache]: Analyzing trace with hash 1528834600, now seen corresponding path program 6 times [2018-12-02 14:09:39,399 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:39,399 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:39,399 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:39,399 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:39,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:39,450 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:39,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:39,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:39,450 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:39,450 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:39,450 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:39,450 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:39,456 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:39,456 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:39,464 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:39,465 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:39,465 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:39,470 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:39,471 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:39,519 INFO L134 CoverageAnalysis]: Checked inductivity of 210 backedges. 0 proven. 210 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:39,533 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:39,534 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-02 14:09:39,534 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:39,534 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-02 14:09:39,534 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-02 14:09:39,534 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:39,534 INFO L87 Difference]: Start difference. First operand 42817 states and 59893 transitions. Second operand 9 states. [2018-12-02 14:09:39,961 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:39,961 INFO L93 Difference]: Finished difference Result 59106 states and 83567 transitions. [2018-12-02 14:09:39,961 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2018-12-02 14:09:39,961 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 75 [2018-12-02 14:09:39,961 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:40,092 INFO L225 Difference]: With dead ends: 59106 [2018-12-02 14:09:40,092 INFO L226 Difference]: Without dead ends: 59105 [2018-12-02 14:09:40,099 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 143 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=120, Invalid=120, Unknown=0, NotChecked=0, Total=240 [2018-12-02 14:09:40,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59105 states. [2018-12-02 14:09:40,645 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59105 to 45009. [2018-12-02 14:09:40,645 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 45009 states. [2018-12-02 14:09:40,680 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 45009 states to 45009 states and 62991 transitions. [2018-12-02 14:09:40,681 INFO L78 Accepts]: Start accepts. Automaton has 45009 states and 62991 transitions. Word has length 75 [2018-12-02 14:09:40,681 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:40,681 INFO L480 AbstractCegarLoop]: Abstraction has 45009 states and 62991 transitions. [2018-12-02 14:09:40,681 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-02 14:09:40,681 INFO L276 IsEmpty]: Start isEmpty. Operand 45009 states and 62991 transitions. [2018-12-02 14:09:40,683 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 77 [2018-12-02 14:09:40,683 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:40,684 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 7, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:40,684 INFO L423 AbstractCegarLoop]: === Iteration 38 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:40,684 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:40,684 INFO L82 PathProgramCache]: Analyzing trace with hash -427799768, now seen corresponding path program 7 times [2018-12-02 14:09:40,684 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:40,684 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:40,684 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:40,685 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:40,685 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:40,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:40,728 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:40,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:40,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:40,728 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:40,728 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:40,728 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:40,728 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:40,736 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:40,736 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:40,746 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:40,746 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:40,751 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:40,751 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:40,803 INFO L134 CoverageAnalysis]: Checked inductivity of 245 backedges. 0 proven. 245 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:40,818 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:40,818 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 14:09:40,818 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:40,818 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:09:40,818 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:09:40,818 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:40,818 INFO L87 Difference]: Start difference. First operand 45009 states and 62991 transitions. Second operand 10 states. [2018-12-02 14:09:41,291 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:41,291 INFO L93 Difference]: Finished difference Result 62469 states and 88924 transitions. [2018-12-02 14:09:41,292 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:09:41,292 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 76 [2018-12-02 14:09:41,292 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:41,344 INFO L225 Difference]: With dead ends: 62469 [2018-12-02 14:09:41,344 INFO L226 Difference]: Without dead ends: 62467 [2018-12-02 14:09:41,355 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 160 GetRequests, 144 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:41,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 62467 states. [2018-12-02 14:09:42,092 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 62467 to 53493. [2018-12-02 14:09:42,092 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53493 states. [2018-12-02 14:09:42,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53493 states to 53493 states and 74602 transitions. [2018-12-02 14:09:42,231 INFO L78 Accepts]: Start accepts. Automaton has 53493 states and 74602 transitions. Word has length 76 [2018-12-02 14:09:42,231 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:42,231 INFO L480 AbstractCegarLoop]: Abstraction has 53493 states and 74602 transitions. [2018-12-02 14:09:42,231 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:09:42,231 INFO L276 IsEmpty]: Start isEmpty. Operand 53493 states and 74602 transitions. [2018-12-02 14:09:42,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 78 [2018-12-02 14:09:42,233 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:42,234 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:42,234 INFO L423 AbstractCegarLoop]: === Iteration 39 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:42,234 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:42,234 INFO L82 PathProgramCache]: Analyzing trace with hash 265372381, now seen corresponding path program 8 times [2018-12-02 14:09:42,234 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:42,235 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:42,235 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:42,235 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:42,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:42,273 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:42,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:42,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:42,273 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:42,273 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:42,273 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:42,273 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:42,279 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:42,279 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:42,292 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 14:09:42,292 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:42,293 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:42,298 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:42,298 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:42,370 INFO L134 CoverageAnalysis]: Checked inductivity of 288 backedges. 0 proven. 288 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:42,384 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:42,384 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 14:09:42,384 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:42,384 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:09:42,384 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:09:42,385 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:09:42,385 INFO L87 Difference]: Start difference. First operand 53493 states and 74602 transitions. Second operand 11 states. [2018-12-02 14:09:42,905 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:42,906 INFO L93 Difference]: Finished difference Result 75502 states and 106384 transitions. [2018-12-02 14:09:42,906 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:09:42,906 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 77 [2018-12-02 14:09:42,906 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:42,969 INFO L225 Difference]: With dead ends: 75502 [2018-12-02 14:09:42,969 INFO L226 Difference]: Without dead ends: 75501 [2018-12-02 14:09:42,982 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 163 GetRequests, 145 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:09:43,026 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75501 states. [2018-12-02 14:09:43,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75501 to 55737. [2018-12-02 14:09:43,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 55737 states. [2018-12-02 14:09:43,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 55737 states to 55737 states and 77782 transitions. [2018-12-02 14:09:43,811 INFO L78 Accepts]: Start accepts. Automaton has 55737 states and 77782 transitions. Word has length 77 [2018-12-02 14:09:43,811 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:43,811 INFO L480 AbstractCegarLoop]: Abstraction has 55737 states and 77782 transitions. [2018-12-02 14:09:43,811 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:09:43,811 INFO L276 IsEmpty]: Start isEmpty. Operand 55737 states and 77782 transitions. [2018-12-02 14:09:43,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 82 [2018-12-02 14:09:43,814 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:43,814 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 10, 10, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:43,814 INFO L423 AbstractCegarLoop]: === Iteration 40 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:43,815 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:43,815 INFO L82 PathProgramCache]: Analyzing trace with hash 1444546058, now seen corresponding path program 10 times [2018-12-02 14:09:43,815 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:43,815 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:43,815 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:43,815 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:43,818 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:43,887 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:43,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:43,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:43,887 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:43,887 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:43,887 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:43,887 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:43,893 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:43,893 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:43,903 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:43,904 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:43,908 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:43,908 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:44,008 INFO L134 CoverageAnalysis]: Checked inductivity of 375 backedges. 0 proven. 375 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:44,022 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:44,022 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-02 14:09:44,022 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:44,023 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 14:09:44,023 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 14:09:44,023 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 14:09:44,023 INFO L87 Difference]: Start difference. First operand 55737 states and 77782 transitions. Second operand 13 states. [2018-12-02 14:09:44,581 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:44,581 INFO L93 Difference]: Finished difference Result 72432 states and 102654 transitions. [2018-12-02 14:09:44,581 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:09:44,581 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 81 [2018-12-02 14:09:44,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:44,644 INFO L225 Difference]: With dead ends: 72432 [2018-12-02 14:09:44,645 INFO L226 Difference]: Without dead ends: 72430 [2018-12-02 14:09:44,655 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 173 GetRequests, 151 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 14:09:44,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72430 states. [2018-12-02 14:09:45,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72430 to 63455. [2018-12-02 14:09:45,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 63455 states. [2018-12-02 14:09:45,510 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 63455 states to 63455 states and 88331 transitions. [2018-12-02 14:09:45,510 INFO L78 Accepts]: Start accepts. Automaton has 63455 states and 88331 transitions. Word has length 81 [2018-12-02 14:09:45,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:45,510 INFO L480 AbstractCegarLoop]: Abstraction has 63455 states and 88331 transitions. [2018-12-02 14:09:45,510 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 14:09:45,510 INFO L276 IsEmpty]: Start isEmpty. Operand 63455 states and 88331 transitions. [2018-12-02 14:09:45,514 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 14:09:45,514 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:45,514 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:45,514 INFO L423 AbstractCegarLoop]: === Iteration 41 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:45,514 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:45,514 INFO L82 PathProgramCache]: Analyzing trace with hash 1692281031, now seen corresponding path program 9 times [2018-12-02 14:09:45,515 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:45,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:45,515 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:45,515 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:45,515 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:45,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:45,563 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:45,563 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:45,563 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:45,564 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:45,564 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:45,564 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:45,564 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:45,570 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:45,570 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:45,581 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:45,581 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:45,582 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:45,588 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:45,588 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:45,690 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:45,704 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:45,704 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 14:09:45,704 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:45,704 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:09:45,704 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:09:45,704 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:09:45,705 INFO L87 Difference]: Start difference. First operand 63455 states and 88331 transitions. Second operand 12 states. [2018-12-02 14:09:46,324 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:46,324 INFO L93 Difference]: Finished difference Result 87915 states and 123650 transitions. [2018-12-02 14:09:46,325 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:09:46,325 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 85 [2018-12-02 14:09:46,325 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:46,399 INFO L225 Difference]: With dead ends: 87915 [2018-12-02 14:09:46,399 INFO L226 Difference]: Without dead ends: 87914 [2018-12-02 14:09:46,415 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 180 GetRequests, 160 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:09:46,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87914 states. [2018-12-02 14:09:47,501 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87914 to 65699. [2018-12-02 14:09:47,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 65699 states. [2018-12-02 14:09:47,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65699 states to 65699 states and 91511 transitions. [2018-12-02 14:09:47,555 INFO L78 Accepts]: Start accepts. Automaton has 65699 states and 91511 transitions. Word has length 85 [2018-12-02 14:09:47,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:47,555 INFO L480 AbstractCegarLoop]: Abstraction has 65699 states and 91511 transitions. [2018-12-02 14:09:47,555 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:09:47,555 INFO L276 IsEmpty]: Start isEmpty. Operand 65699 states and 91511 transitions. [2018-12-02 14:09:47,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 14:09:47,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:47,559 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 8, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:47,559 INFO L423 AbstractCegarLoop]: === Iteration 42 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:47,559 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:47,559 INFO L82 PathProgramCache]: Analyzing trace with hash -1685753485, now seen corresponding path program 8 times [2018-12-02 14:09:47,559 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:47,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:47,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:47,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:47,562 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:47,618 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:47,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:47,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:47,618 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:47,618 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:47,618 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:47,618 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:47,626 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:47,626 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:47,639 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 14:09:47,639 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:47,640 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:47,645 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:47,645 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:47,710 INFO L134 CoverageAnalysis]: Checked inductivity of 316 backedges. 0 proven. 316 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:47,724 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:47,724 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 14:09:47,724 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:47,725 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:09:47,725 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:09:47,725 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:09:47,725 INFO L87 Difference]: Start difference. First operand 65699 states and 91511 transitions. Second operand 11 states. [2018-12-02 14:09:48,378 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:48,378 INFO L93 Difference]: Finished difference Result 88656 states and 125565 transitions. [2018-12-02 14:09:48,379 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:09:48,379 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 85 [2018-12-02 14:09:48,379 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:48,454 INFO L225 Difference]: With dead ends: 88656 [2018-12-02 14:09:48,454 INFO L226 Difference]: Without dead ends: 88654 [2018-12-02 14:09:48,468 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 179 GetRequests, 161 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:09:48,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88654 states. [2018-12-02 14:09:49,461 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88654 to 76293. [2018-12-02 14:09:49,461 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 76293 states. [2018-12-02 14:09:49,525 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76293 states to 76293 states and 105928 transitions. [2018-12-02 14:09:49,525 INFO L78 Accepts]: Start accepts. Automaton has 76293 states and 105928 transitions. Word has length 85 [2018-12-02 14:09:49,525 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:49,525 INFO L480 AbstractCegarLoop]: Abstraction has 76293 states and 105928 transitions. [2018-12-02 14:09:49,525 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:09:49,525 INFO L276 IsEmpty]: Start isEmpty. Operand 76293 states and 105928 transitions. [2018-12-02 14:09:49,529 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 86 [2018-12-02 14:09:49,529 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:49,529 INFO L402 BasicCegarLoop]: trace histogram [8, 8, 8, 8, 8, 8, 8, 8, 8, 7, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:49,529 INFO L423 AbstractCegarLoop]: === Iteration 43 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:49,529 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:49,529 INFO L82 PathProgramCache]: Analyzing trace with hash -1536406213, now seen corresponding path program 7 times [2018-12-02 14:09:49,530 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:49,530 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:49,530 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:49,530 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:49,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:49,573 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:49,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:49,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:49,574 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:49,574 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:49,574 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:49,574 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/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-12-02 14:09:49,582 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:49,582 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:49,593 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:49,594 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:49,600 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:49,600 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:49,670 INFO L134 CoverageAnalysis]: Checked inductivity of 280 backedges. 0 proven. 280 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:49,684 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:49,684 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 17 [2018-12-02 14:09:49,684 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:49,684 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-02 14:09:49,684 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-02 14:09:49,684 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:49,685 INFO L87 Difference]: Start difference. First operand 76293 states and 105928 transitions. Second operand 10 states. [2018-12-02 14:09:50,518 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:50,518 INFO L93 Difference]: Finished difference Result 109927 states and 154225 transitions. [2018-12-02 14:09:50,518 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2018-12-02 14:09:50,518 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 85 [2018-12-02 14:09:50,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:50,616 INFO L225 Difference]: With dead ends: 109927 [2018-12-02 14:09:50,616 INFO L226 Difference]: Without dead ends: 109926 [2018-12-02 14:09:50,631 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 178 GetRequests, 162 SyntacticMatches, 0 SemanticMatches, 16 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=153, Invalid=153, Unknown=0, NotChecked=0, Total=306 [2018-12-02 14:09:50,697 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109926 states. [2018-12-02 14:09:51,756 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109926 to 80157. [2018-12-02 14:09:51,756 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 80157 states. [2018-12-02 14:09:51,823 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80157 states to 80157 states and 111367 transitions. [2018-12-02 14:09:51,823 INFO L78 Accepts]: Start accepts. Automaton has 80157 states and 111367 transitions. Word has length 85 [2018-12-02 14:09:51,824 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:51,824 INFO L480 AbstractCegarLoop]: Abstraction has 80157 states and 111367 transitions. [2018-12-02 14:09:51,824 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-02 14:09:51,824 INFO L276 IsEmpty]: Start isEmpty. Operand 80157 states and 111367 transitions. [2018-12-02 14:09:51,828 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 89 [2018-12-02 14:09:51,828 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:51,828 INFO L402 BasicCegarLoop]: trace histogram [12, 12, 12, 12, 12, 11, 11, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:51,828 INFO L423 AbstractCegarLoop]: === Iteration 44 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:51,828 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:51,828 INFO L82 PathProgramCache]: Analyzing trace with hash -508374954, now seen corresponding path program 11 times [2018-12-02 14:09:51,828 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:51,829 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:51,829 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:51,829 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:51,832 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:51,893 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:51,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:51,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:51,894 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:51,894 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:51,894 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:51,894 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 39 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:09:51,900 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:09:51,900 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:09:51,917 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 12 check-sat command(s) [2018-12-02 14:09:51,917 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:51,918 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:51,924 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:51,924 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:52,043 INFO L134 CoverageAnalysis]: Checked inductivity of 451 backedges. 0 proven. 451 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:52,057 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:52,058 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 25 [2018-12-02 14:09:52,058 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:52,058 INFO L459 AbstractCegarLoop]: Interpolant automaton has 14 states [2018-12-02 14:09:52,058 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2018-12-02 14:09:52,058 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-02 14:09:52,058 INFO L87 Difference]: Start difference. First operand 80157 states and 111367 transitions. Second operand 14 states. [2018-12-02 14:09:52,803 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:52,803 INFO L93 Difference]: Finished difference Result 102547 states and 144645 transitions. [2018-12-02 14:09:52,804 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2018-12-02 14:09:52,804 INFO L78 Accepts]: Start accepts. Automaton has 14 states. Word has length 88 [2018-12-02 14:09:52,804 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:52,900 INFO L225 Difference]: With dead ends: 102547 [2018-12-02 14:09:52,900 INFO L226 Difference]: Without dead ends: 102545 [2018-12-02 14:09:52,918 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 188 GetRequests, 164 SyntacticMatches, 0 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=325, Invalid=325, Unknown=0, NotChecked=0, Total=650 [2018-12-02 14:09:52,981 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102545 states. [2018-12-02 14:09:54,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102545 to 90527. [2018-12-02 14:09:54,230 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 90527 states. [2018-12-02 14:09:54,305 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90527 states to 90527 states and 125495 transitions. [2018-12-02 14:09:54,305 INFO L78 Accepts]: Start accepts. Automaton has 90527 states and 125495 transitions. Word has length 88 [2018-12-02 14:09:54,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:54,306 INFO L480 AbstractCegarLoop]: Abstraction has 90527 states and 125495 transitions. [2018-12-02 14:09:54,306 INFO L481 AbstractCegarLoop]: Interpolant automaton has 14 states. [2018-12-02 14:09:54,306 INFO L276 IsEmpty]: Start isEmpty. Operand 90527 states and 125495 transitions. [2018-12-02 14:09:54,310 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 94 [2018-12-02 14:09:54,310 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:54,310 INFO L402 BasicCegarLoop]: trace histogram [11, 11, 11, 11, 11, 11, 11, 10, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:54,311 INFO L423 AbstractCegarLoop]: === Iteration 45 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:54,311 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:54,311 INFO L82 PathProgramCache]: Analyzing trace with hash -1413249871, now seen corresponding path program 10 times [2018-12-02 14:09:54,311 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:54,311 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:54,311 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:54,311 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:54,314 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:54,368 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:54,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:54,369 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:54,369 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:54,369 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:54,369 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 40 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:09:54,375 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:54,375 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-02 14:09:54,386 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:54,387 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:54,394 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:54,394 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:54,491 INFO L134 CoverageAnalysis]: Checked inductivity of 440 backedges. 0 proven. 440 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:54,505 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:54,505 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 12, 12] total 23 [2018-12-02 14:09:54,505 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:54,505 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 14:09:54,505 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 14:09:54,505 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 14:09:54,505 INFO L87 Difference]: Start difference. First operand 90527 states and 125495 transitions. Second operand 13 states. [2018-12-02 14:09:55,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:55,454 INFO L93 Difference]: Finished difference Result 123345 states and 172777 transitions. [2018-12-02 14:09:55,455 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:09:55,455 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 93 [2018-12-02 14:09:55,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:55,568 INFO L225 Difference]: With dead ends: 123345 [2018-12-02 14:09:55,568 INFO L226 Difference]: Without dead ends: 123344 [2018-12-02 14:09:55,590 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 197 GetRequests, 175 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=276, Invalid=276, Unknown=0, NotChecked=0, Total=552 [2018-12-02 14:09:55,668 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123344 states. [2018-12-02 14:09:56,944 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123344 to 93265. [2018-12-02 14:09:56,944 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 93265 states. [2018-12-02 14:09:57,023 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93265 states to 93265 states and 129365 transitions. [2018-12-02 14:09:57,023 INFO L78 Accepts]: Start accepts. Automaton has 93265 states and 129365 transitions. Word has length 93 [2018-12-02 14:09:57,023 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:57,023 INFO L480 AbstractCegarLoop]: Abstraction has 93265 states and 129365 transitions. [2018-12-02 14:09:57,023 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 14:09:57,023 INFO L276 IsEmpty]: Start isEmpty. Operand 93265 states and 129365 transitions. [2018-12-02 14:09:57,028 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 95 [2018-12-02 14:09:57,028 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:57,028 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 9, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:57,028 INFO L423 AbstractCegarLoop]: === Iteration 46 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:57,028 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:57,028 INFO L82 PathProgramCache]: Analyzing trace with hash 879701896, now seen corresponding path program 9 times [2018-12-02 14:09:57,028 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:57,029 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-02 14:09:57,029 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:57,029 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:57,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:57,183 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:57,183 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:09:57,183 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:09:57,183 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:09:57,183 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:09:57,184 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 41 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:09:57,193 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:09:57,193 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:09:57,204 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:09:57,204 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:09:57,205 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:09:57,211 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:57,211 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:09:57,289 INFO L134 CoverageAnalysis]: Checked inductivity of 396 backedges. 0 proven. 396 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:09:57,303 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:09:57,303 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 14:09:57,303 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:09:57,303 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:09:57,303 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:09:57,304 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:09:57,304 INFO L87 Difference]: Start difference. First operand 93265 states and 129365 transitions. Second operand 12 states. [2018-12-02 14:09:58,203 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:09:58,203 INFO L93 Difference]: Finished difference Result 123303 states and 173838 transitions. [2018-12-02 14:09:58,204 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:09:58,204 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 94 [2018-12-02 14:09:58,204 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:09:58,316 INFO L225 Difference]: With dead ends: 123303 [2018-12-02 14:09:58,316 INFO L226 Difference]: Without dead ends: 123301 [2018-12-02 14:09:58,336 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 198 GetRequests, 178 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:09:58,413 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123301 states. [2018-12-02 14:09:59,798 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123301 to 107157. [2018-12-02 14:09:59,798 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 107157 states. [2018-12-02 14:09:59,896 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107157 states to 107157 states and 148218 transitions. [2018-12-02 14:09:59,897 INFO L78 Accepts]: Start accepts. Automaton has 107157 states and 148218 transitions. Word has length 94 [2018-12-02 14:09:59,897 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:09:59,897 INFO L480 AbstractCegarLoop]: Abstraction has 107157 states and 148218 transitions. [2018-12-02 14:09:59,897 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:09:59,897 INFO L276 IsEmpty]: Start isEmpty. Operand 107157 states and 148218 transitions. [2018-12-02 14:09:59,902 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:09:59,902 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:09:59,902 INFO L402 BasicCegarLoop]: trace histogram [13, 13, 13, 13, 13, 12, 12, 1, 1, 1, 1, 1, 1] [2018-12-02 14:09:59,902 INFO L423 AbstractCegarLoop]: === Iteration 47 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:09:59,902 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:09:59,902 INFO L82 PathProgramCache]: Analyzing trace with hash 526129290, now seen corresponding path program 12 times [2018-12-02 14:09:59,902 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:09:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:59,903 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:09:59,903 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:09:59,903 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:09:59,906 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:09:59,972 INFO L134 CoverageAnalysis]: Checked inductivity of 534 backedges. 517 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2018-12-02 14:09:59,973 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-02 14:09:59,973 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [13] imperfect sequences [] total 13 [2018-12-02 14:09:59,973 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-02 14:09:59,973 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-02 14:09:59,973 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-02 14:09:59,973 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:09:59,973 INFO L87 Difference]: Start difference. First operand 107157 states and 148218 transitions. Second operand 13 states. [2018-12-02 14:10:00,490 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:10:00,490 INFO L93 Difference]: Finished difference Result 125640 states and 173038 transitions. [2018-12-02 14:10:00,491 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2018-12-02 14:10:00,491 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 95 [2018-12-02 14:10:00,491 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:10:00,491 INFO L225 Difference]: With dead ends: 125640 [2018-12-02 14:10:00,491 INFO L226 Difference]: Without dead ends: 423 [2018-12-02 14:10:00,553 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=78, Invalid=78, Unknown=0, NotChecked=0, Total=156 [2018-12-02 14:10:00,553 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 423 states. [2018-12-02 14:10:00,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 423 to 226. [2018-12-02 14:10:00,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 226 states. [2018-12-02 14:10:00,558 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 226 states to 226 states and 264 transitions. [2018-12-02 14:10:00,559 INFO L78 Accepts]: Start accepts. Automaton has 226 states and 264 transitions. Word has length 95 [2018-12-02 14:10:00,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:10:00,559 INFO L480 AbstractCegarLoop]: Abstraction has 226 states and 264 transitions. [2018-12-02 14:10:00,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-02 14:10:00,559 INFO L276 IsEmpty]: Start isEmpty. Operand 226 states and 264 transitions. [2018-12-02 14:10:00,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 96 [2018-12-02 14:10:00,559 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:10:00,559 INFO L402 BasicCegarLoop]: trace histogram [9, 9, 9, 9, 9, 9, 9, 9, 9, 8, 1, 1, 1, 1, 1, 1] [2018-12-02 14:10:00,560 INFO L423 AbstractCegarLoop]: === Iteration 48 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:10:00,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:10:00,560 INFO L82 PathProgramCache]: Analyzing trace with hash 270660750, now seen corresponding path program 8 times [2018-12-02 14:10:00,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:10:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:10:00,560 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:10:00,560 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:10:00,560 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:10:00,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:10:00,606 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:10:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:10:00,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:10:00,606 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:10:00,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:10:00,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:10:00,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 42 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:10:00,612 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-02 14:10:00,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-02 14:10:00,626 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 9 check-sat command(s) [2018-12-02 14:10:00,627 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:10:00,628 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:10:00,635 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:10:00,635 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:10:00,703 INFO L134 CoverageAnalysis]: Checked inductivity of 360 backedges. 0 proven. 360 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:10:00,717 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:10:00,717 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 19 [2018-12-02 14:10:00,717 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:10:00,717 INFO L459 AbstractCegarLoop]: Interpolant automaton has 11 states [2018-12-02 14:10:00,718 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2018-12-02 14:10:00,718 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:10:00,718 INFO L87 Difference]: Start difference. First operand 226 states and 264 transitions. Second operand 11 states. [2018-12-02 14:10:00,744 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:10:00,744 INFO L93 Difference]: Finished difference Result 247 states and 284 transitions. [2018-12-02 14:10:00,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2018-12-02 14:10:00,745 INFO L78 Accepts]: Start accepts. Automaton has 11 states. Word has length 95 [2018-12-02 14:10:00,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:10:00,745 INFO L225 Difference]: With dead ends: 247 [2018-12-02 14:10:00,745 INFO L226 Difference]: Without dead ends: 106 [2018-12-02 14:10:00,745 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 199 GetRequests, 181 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=190, Invalid=190, Unknown=0, NotChecked=0, Total=380 [2018-12-02 14:10:00,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2018-12-02 14:10:00,747 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 106. [2018-12-02 14:10:00,747 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 106 states. [2018-12-02 14:10:00,747 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 105 transitions. [2018-12-02 14:10:00,747 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 105 transitions. Word has length 95 [2018-12-02 14:10:00,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:10:00,748 INFO L480 AbstractCegarLoop]: Abstraction has 106 states and 105 transitions. [2018-12-02 14:10:00,748 INFO L481 AbstractCegarLoop]: Interpolant automaton has 11 states. [2018-12-02 14:10:00,748 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 105 transitions. [2018-12-02 14:10:00,748 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 106 [2018-12-02 14:10:00,748 INFO L394 BasicCegarLoop]: Found error trace [2018-12-02 14:10:00,748 INFO L402 BasicCegarLoop]: trace histogram [10, 10, 10, 10, 10, 10, 10, 10, 10, 9, 1, 1, 1, 1, 1, 1] [2018-12-02 14:10:00,748 INFO L423 AbstractCegarLoop]: === Iteration 49 === [mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-02 14:10:00,748 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-02 14:10:00,748 INFO L82 PathProgramCache]: Analyzing trace with hash -1806118879, now seen corresponding path program 9 times [2018-12-02 14:10:00,748 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-02 14:10:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:10:00,749 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-02 14:10:00,749 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-02 14:10:00,749 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-02 14:10:00,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-02 14:10:00,794 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:10:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:10:00,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-02 14:10:00,794 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-02 14:10:00,794 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-02 14:10:00,794 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-02 14:10:00,794 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/z3 Starting monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 43 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-02 14:10:00,800 INFO L103 rtionOrderModulation]: Keeping assertion order TERMS_WITH_SMALL_CONSTANTS_FIRST [2018-12-02 14:10:00,800 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder TERMS_WITH_SMALL_CONSTANTS_FIRST (IT: FPandBP) [2018-12-02 14:10:00,812 INFO L249 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2018-12-02 14:10:00,812 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-02 14:10:00,813 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-02 14:10:00,822 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:10:00,822 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-02 14:10:00,917 INFO L134 CoverageAnalysis]: Checked inductivity of 450 backedges. 0 proven. 450 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-02 14:10:00,931 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-02 14:10:00,931 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 21 [2018-12-02 14:10:00,931 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-02 14:10:00,931 INFO L459 AbstractCegarLoop]: Interpolant automaton has 12 states [2018-12-02 14:10:00,931 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2018-12-02 14:10:00,932 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:10:00,932 INFO L87 Difference]: Start difference. First operand 106 states and 105 transitions. Second operand 12 states. [2018-12-02 14:10:00,947 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-02 14:10:00,947 INFO L93 Difference]: Finished difference Result 106 states and 105 transitions. [2018-12-02 14:10:00,947 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2018-12-02 14:10:00,947 INFO L78 Accepts]: Start accepts. Automaton has 12 states. Word has length 105 [2018-12-02 14:10:00,947 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-02 14:10:00,948 INFO L225 Difference]: With dead ends: 106 [2018-12-02 14:10:00,948 INFO L226 Difference]: Without dead ends: 0 [2018-12-02 14:10:00,948 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 220 GetRequests, 200 SyntacticMatches, 0 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=231, Invalid=231, Unknown=0, NotChecked=0, Total=462 [2018-12-02 14:10:00,948 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-02 14:10:00,949 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-02 14:10:00,949 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-02 14:10:00,949 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-02 14:10:00,949 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 105 [2018-12-02 14:10:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-02 14:10:00,949 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-02 14:10:00,949 INFO L481 AbstractCegarLoop]: Interpolant automaton has 12 states. [2018-12-02 14:10:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-02 14:10:00,949 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-02 14:10:00,953 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-02 14:10:01,680 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:01,745 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:01,748 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:01,827 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,055 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,345 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,413 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,425 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,497 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,562 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,628 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,671 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:02,861 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,339 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,340 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,356 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,358 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,363 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,420 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,537 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,560 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,616 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,624 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,706 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,782 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,855 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:03,892 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:04,298 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:04,815 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:04,902 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:04,969 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:05,081 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:05,193 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:06,275 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:06,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:06,474 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:08,277 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:08,534 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:08,626 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:08,867 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:09,237 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:09,262 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:09,299 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:09,485 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:11,465 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:11,806 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:11,950 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:13,210 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:13,449 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:14,352 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:14,663 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:14,746 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:14,981 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:16,236 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:16,470 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:16,578 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:16,739 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:17,035 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:17,071 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:17,849 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:18,727 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:19,618 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:19,938 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:20,964 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:21,925 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:22,010 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:22,984 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:23,158 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:23,467 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:23,913 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:24,251 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:25,027 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:25,999 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-02 14:10:26,076 WARN L180 SmtUtils]: Spent 25.11 s on a formula simplification. DAG size of input: 2594 DAG size of output: 2228 [2018-12-02 14:11:27,943 WARN L180 SmtUtils]: Spent 1.03 m on a formula simplification. DAG size of input: 2065 DAG size of output: 353 [2018-12-02 14:11:27,946 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-02 14:11:27,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:11:27,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-02 14:11:27,946 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-02 14:11:27,946 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-02 14:11:27,946 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L27(lines 27 31) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 35) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L23(lines 23 31) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L19-2(lines 19 33) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainErr9ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L28(line 28) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L24(line 24) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L24-1(line 24) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L20(line 20) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L20-1(line 20) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L29(lines 29 31) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L25(lines 25 31) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 35) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L30(line 30) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 35) the Hoare annotation is: true [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L30-1(line 30) no Hoare annotation was computed. [2018-12-02 14:11:27,947 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-02 14:11:27,948 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-02 14:11:27,948 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-02 14:11:27,948 INFO L448 ceAbstractionStarter]: For program point L22(lines 22 32) no Hoare annotation was computed. [2018-12-02 14:11:27,949 INFO L444 ceAbstractionStarter]: At program point L22-1(lines 19 33) the Hoare annotation is: (let ((.cse66 (<= 0 (+ main_~x~0 2147483648))) (.cse1 (<= 0 main_~i~0)) (.cse6 (<= main_~N~0 10)) (.cse59 (<= 0 (+ main_~y~0 2147483648)))) (let ((.cse11 (<= 0 (+ main_~x~0 4))) (.cse13 (<= 0 (+ main_~x~0 2))) (.cse16 (and .cse66 .cse1 .cse6 .cse59))) (let ((.cse24 (<= main_~y~0 2)) (.cse15 (<= 0 (+ main_~y~0 1))) (.cse7 (<= 0 (+ main_~x~0 1))) (.cse9 (<= main_~y~0 0)) (.cse20 (<= main_~y~0 4)) (.cse36 (<= 0 (+ main_~y~0 2))) (.cse27 (<= main_~y~0 3)) (.cse42 (and .cse13 .cse16)) (.cse35 (<= 0 (+ main_~x~0 5))) (.cse4 (<= main_~x~0 0)) (.cse0 (<= 0 (+ main_~x~0 3))) (.cse3 (<= 0 main_~y~0)) (.cse63 (and .cse11 .cse16))) (let ((.cse48 (and .cse3 .cse63)) (.cse8 (<= main_~N~0 (+ main_~i~0 9))) (.cse40 (<= main_~y~0 9)) (.cse47 (<= main_~x~0 8)) (.cse32 (and .cse0 .cse16)) (.cse61 (and .cse1 .cse35 .cse4 .cse6 .cse59)) (.cse25 (<= main_~y~0 5)) (.cse43 (<= main_~x~0 9)) (.cse17 (and .cse42 .cse3)) (.cse60 (and (and .cse16 .cse3 .cse27) .cse4)) (.cse39 (and .cse66 .cse1 .cse36 .cse4 .cse6)) (.cse57 (<= 0 (+ main_~x~0 9))) (.cse49 (<= main_~x~0 3)) (.cse56 (<= main_~x~0 7)) (.cse50 (<= 0 (+ main_~y~0 5))) (.cse52 (<= main_~x~0 5)) (.cse28 (<= 0 (+ main_~x~0 6))) (.cse65 (and .cse20 .cse16 .cse4)) (.cse14 (<= main_~N~0 (+ main_~i~0 7))) (.cse19 (<= main_~y~0 8)) (.cse64 (and .cse0 .cse1 .cse3 .cse6)) (.cse34 (<= main_~y~0 6)) (.cse41 (and .cse1 .cse7 .cse4 .cse6 .cse59 .cse9)) (.cse55 (<= 0 (+ main_~y~0 6))) (.cse53 (<= 0 (+ main_~y~0 7))) (.cse23 (<= main_~x~0 1)) (.cse45 (<= main_~N~0 (+ main_~i~0 8))) (.cse26 (<= main_~N~0 (+ main_~i~0 5))) (.cse51 (and .cse13 .cse1 .cse4 .cse6 .cse59 .cse9)) (.cse33 (<= 0 (+ main_~y~0 3))) (.cse29 (<= main_~N~0 (+ main_~i~0 3))) (.cse2 (<= main_~N~0 (+ main_~i~0 6))) (.cse38 (<= main_~x~0 4)) (.cse30 (<= 0 (+ main_~x~0 8))) (.cse5 (<= main_~y~0 1)) (.cse12 (<= main_~N~0 (+ main_~i~0 4))) (.cse58 (and .cse66 .cse15 .cse1 .cse6)) (.cse46 (<= main_~x~0 6)) (.cse18 (<= main_~N~0 main_~i~0)) (.cse31 (<= main_~N~0 (+ main_~i~0 2))) (.cse44 (<= 0 (+ main_~y~0 4))) (.cse62 (<= main_~y~0 7)) (.cse21 (<= main_~x~0 2)) (.cse22 (<= 0 main_~x~0)) (.cse37 (<= main_~N~0 (+ main_~i~0 1))) (.cse54 (<= 0 (+ main_~x~0 7))) (.cse10 (and .cse66 .cse1 .cse3 .cse24 .cse6))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse3 .cse7 .cse8 .cse4 .cse6 .cse9) (and .cse10 .cse11 .cse12 .cse4) (and .cse13 .cse14 .cse15 .cse16 .cse4 .cse9) (and .cse17 .cse4 .cse18 .cse19) (and .cse20 .cse1 .cse3 .cse12 .cse21 .cse6 .cse22) (and .cse14 .cse1 .cse23 .cse3 .cse24 .cse6 .cse22) (and .cse1 .cse23 .cse3 .cse12 .cse25 .cse6 .cse22) (and .cse1 .cse26 .cse3 .cse27 .cse21 .cse6 .cse22) (and .cse1 .cse28 .cse3 .cse4 .cse5 .cse6 .cse29) (and .cse30 .cse31 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse32 .cse12 .cse33 .cse4 .cse9) (and .cse1 .cse23 .cse34 .cse3 .cse6 .cse22 .cse29) (and .cse31 .cse28 .cse4 .cse10) (and .cse31 .cse35 .cse16 .cse33 .cse4 .cse9) (and .cse13 .cse16 .cse2 .cse36 .cse4 .cse9) (and .cse16 .cse28 .cse37 .cse33 .cse4 .cse9) (and .cse1 .cse12 .cse38 .cse36 .cse6 .cse22 .cse9) (and .cse39 .cse11 .cse12 .cse9) (and .cse11 .cse16 .cse33 .cse4 .cse9 .cse29) (and (and .cse11 .cse16 .cse3 .cse27) .cse4 .cse29) (and .cse1 .cse40 .cse3 .cse37 .cse4 .cse6 .cse22) (and .cse1 .cse3 .cse18 .cse4 (<= 0 (+ main_~x~0 10)) .cse6 .cse9) (and (or (and .cse1 .cse23 .cse2 .cse6 .cse22 .cse9) (and .cse2 .cse41)) .cse33) (and .cse3 .cse12 .cse4 (and .cse20 .cse42)) (and .cse32 .cse3 .cse27 .cse12 .cse4) (and .cse43 .cse1 .cse3 .cse37 .cse6 .cse22 .cse9) (and .cse31 .cse39 .cse28 .cse9) (and .cse44 .cse35 .cse16 .cse37 .cse4 .cse9) (and .cse1 .cse45 .cse3 .cse7 .cse4 .cse5 .cse6) (and .cse1 .cse46 .cse3 .cse12 .cse6 .cse22 .cse9) (and .cse1 .cse23 .cse3 .cse37 .cse6 .cse22 .cse19) (and .cse1 .cse3 .cse47 .cse24 .cse18 .cse6 .cse22) (and .cse37 .cse4 (and .cse25 .cse48)) (and .cse14 .cse49 .cse1 .cse3 .cse6 .cse22 .cse9) (and .cse50 .cse51 .cse29) (and .cse20 .cse1 .cse3 .cse37 .cse6 .cse22 .cse52) (and .cse32 .cse44 .cse4 .cse9 .cse29) (and .cse44 .cse1 .cse2 .cse4 .cse6 .cse22 .cse9) (and .cse31 .cse53 .cse41) (and .cse1 .cse23 .cse3 .cse45 .cse5 .cse6 .cse22) (and .cse16 .cse33 .cse4 .cse18 .cse54 .cse9) (and .cse1 .cse3 .cse8 .cse4 .cse5 .cse6 .cse22) (and .cse1 .cse12 .cse55 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse38 .cse37 .cse6 .cse22 .cse9) (and .cse15 .cse49 .cse1 .cse2 .cse6 .cse22 .cse9) (and .cse14 .cse1 .cse3 .cse21 .cse5 .cse6 .cse22) (and .cse1 .cse3 .cse25 .cse18 .cse6 .cse22 .cse52) (and .cse31 .cse32 .cse3 .cse25 .cse4) (and .cse1 .cse3 .cse25 .cse38 .cse37 .cse6 .cse22) (and .cse1 .cse38 .cse33 .cse6 .cse22 .cse9 .cse29) (and .cse20 .cse31 .cse1 .cse3 .cse38 .cse6 .cse22) (and .cse49 .cse1 .cse53 .cse18 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse56 .cse24 .cse37 .cse6 .cse22) (and .cse1 .cse26 .cse11 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse3 .cse47 .cse37 .cse5 .cse6 .cse22) (and .cse1 .cse3 .cse37 .cse4 .cse6 .cse57 .cse9) (and .cse30 .cse37 .cse4 .cse58 .cse9) (and .cse1 .cse47 .cse36 .cse18 .cse6 .cse22 .cse9) (and (or (and .cse14 .cse1 .cse23 .cse6 .cse22 .cse9) (and .cse14 .cse41)) .cse36) (and .cse31 .cse1 .cse3 .cse27 .cse6 .cse22 .cse52) (and .cse35 .cse10 .cse4 .cse29) (and .cse1 .cse53 .cse21 .cse37 .cse6 .cse22 .cse9) (and .cse1 (<= main_~x~0 10) .cse3 .cse18 .cse6 .cse22 .cse9) (and .cse31 .cse44 .cse1 .cse38 .cse6 .cse22 .cse9) (and .cse15 .cse1 .cse46 .cse6 .cse22 .cse9 .cse29) (and .cse1 .cse40 .cse7 .cse4 .cse18 .cse6 .cse59) (and .cse1 .cse56 .cse37 .cse36 .cse6 .cse22 .cse9) (and .cse44 .cse12 .cse51) (and .cse1 .cse3 .cse12 .cse38 .cse24 .cse6 .cse22) (and .cse1 .cse38 .cse55 .cse18 .cse6 .cse22 .cse9) (and .cse43 .cse15 .cse1 .cse18 .cse6 .cse22 .cse9) (and .cse31 .cse60 .cse35) (and .cse1 .cse2 .cse27 .cse3 .cse7 .cse4 .cse6) (and .cse49 .cse1 .cse12 .cse33 .cse6 .cse22 .cse9) (and .cse1 .cse36 .cse6 .cse22 .cse9 .cse52 .cse29) (and .cse31 .cse1 .cse34 .cse3 .cse21 .cse6 .cse22) (and .cse14 .cse15 .cse1 .cse21 .cse6 .cse22 .cse9) (and .cse1 .cse12 .cse3 .cse25 .cse7 .cse4 .cse6) (and .cse1 .cse26 .cse3 .cse25 .cse4 .cse6 .cse22) (and .cse49 .cse1 .cse2 .cse3 .cse5 .cse6 .cse22) (and .cse15 .cse1 .cse8 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse23 .cse12 .cse6 .cse22 .cse9) (and .cse61 .cse3 .cse25 .cse18) (and .cse13 .cse14 .cse1 .cse3 .cse4 .cse5 .cse6) (and .cse1 .cse21 .cse18 .cse6 .cse22 .cse19 .cse59) (and .cse31 .cse15 .cse1 .cse56 .cse6 .cse22 .cse9) (and .cse49 .cse1 .cse26 .cse36 .cse6 .cse22 .cse9) (and .cse20 .cse1 .cse26 .cse3 .cse7 .cse4 .cse6) (and .cse1 .cse4 .cse18 .cse6 .cse22 .cse59) (and .cse1 .cse46 .cse3 .cse27 .cse37 .cse6 .cse22) (and .cse44 .cse1 .cse26 .cse23 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse26 .cse4 .cse6 .cse22 .cse9) (and .cse0 .cse14 .cse1 .cse3 .cse4 .cse6 .cse9) (and .cse15 .cse1 .cse47 .cse37 .cse6 .cse22 .cse9) (and .cse1 .cse35 .cse26 .cse3 .cse4 .cse6 .cse9) (and .cse30 .cse39 .cse18 .cse9) (and .cse15 .cse1 .cse26 .cse38 .cse6 .cse22 .cse9) (and .cse1 .cse2 .cse3 .cse24 .cse21 .cse6 .cse22) (and .cse42 .cse3 .cse25 .cse4 .cse29) (and .cse28 .cse58 .cse4 .cse9 .cse29) (and .cse14 .cse1 .cse3 .cse27 .cse4 .cse6 .cse22) (and .cse1 .cse45 .cse36 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse27 .cse38 .cse6 .cse22 .cse29) (and .cse44 .cse49 .cse1 .cse6 .cse22 .cse9 .cse29) (and .cse1 .cse11 .cse2 .cse3 .cse4 .cse6 .cse9) (and .cse44 .cse1 .cse46 .cse18 .cse6 .cse22 .cse9) (and .cse32 .cse37 .cse55 .cse4 .cse9) (and .cse1 .cse46 .cse3 .cse5 .cse6 .cse22 .cse29) (and .cse31 .cse1 .cse23 .cse3 .cse62 .cse6 .cse22) (and .cse4 .cse18 (and .cse34 .cse48)) (and .cse1 .cse34 .cse3 .cse7 .cse4 .cse6 .cse29) (and .cse1 .cse23 .cse3 .cse8 .cse6 .cse22 .cse9) (and .cse31 .cse1 (<= 0 (+ main_~y~0 8)) .cse4 .cse6 .cse22 .cse9) (and .cse0 .cse26 .cse16 .cse36 .cse4 .cse9) (and .cse1 .cse3 .cse12 .cse5 .cse6 .cse22 .cse52) (and .cse31 .cse1 .cse3 .cse62 .cse7 .cse4 .cse6) (and .cse31 .cse1 .cse46 .cse3 .cse24 .cse6 .cse22) (and .cse1 .cse53 .cse4 .cse6 .cse22 .cse9 .cse29) (and .cse13 .cse31 .cse34 (and .cse1 .cse4 .cse6) .cse3) (and .cse50 .cse37 .cse63 .cse4 .cse9) (and .cse1 .cse3 .cse7 .cse37 .cse4 .cse6 .cse19) (and .cse30 .cse4 .cse18 .cse10) (and .cse53 .cse51 .cse37) (and .cse1 .cse26 .cse3 .cse6 .cse22 .cse9 .cse52) (and .cse55 .cse63 .cse4 .cse18 .cse9) (and .cse1 .cse35 .cse3 .cse12 .cse4 .cse5 .cse6) (and .cse31 .cse1 .cse3 .cse54 .cse4 .cse5 .cse6) (and .cse1 .cse23 .cse40 .cse18 .cse6 .cse22 .cse59) (and .cse60 .cse28 .cse37) (and .cse32 .cse31 .cse50 .cse4 .cse9) (and .cse31 .cse1 .cse3 .cse56 .cse5 .cse6 .cse22) (and .cse31 .cse49 .cse1 .cse50 .cse6 .cse22 .cse9) (and .cse31 .cse1 .cse33 .cse6 .cse22 .cse9 .cse52) (and .cse44 .cse1 .cse12 .cse21 .cse6 .cse22 .cse9) (and .cse26 .cse3 .cse27 .cse4 .cse42) (and .cse31 .cse1 .cse3 .cse47 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse21 .cse6 .cse22 .cse9 .cse29) (and .cse15 .cse1 .cse12 .cse6 .cse22 .cse9 .cse52) (and .cse1 .cse3 .cse24 .cse6 .cse22 .cse52 .cse29) (and .cse1 .cse3 .cse25 .cse21 .cse6 .cse22 .cse29) (and .cse49 .cse1 .cse34 .cse3 .cse37 .cse6 .cse22) (and .cse44 .cse26 .cse41) (and .cse1 .cse28 .cse12 .cse3 .cse4 .cse6 .cse9) (and .cse58 .cse4 .cse18 .cse57 .cse9) (and .cse15 .cse1 .cse23 .cse45 .cse6 .cse22 .cse9) (and (or (and .cse1 .cse23 .cse37 .cse6 .cse22 .cse9) (and .cse37 .cse41)) (<= 0 (+ main_~y~0 9))) (and .cse1 .cse23 .cse2 .cse3 .cse27 .cse6 .cse22) (and .cse26 .cse11 .cse58 .cse4 .cse9) (and .cse32 .cse53 .cse4 .cse18 .cse9) (and .cse13 .cse1 .cse45 .cse3 .cse4 .cse6 .cse9) (and .cse50 .cse61 .cse18 .cse9) (and .cse1 .cse3 .cse56 .cse6 .cse22 .cse9 .cse29) (and .cse0 .cse26 .cse10 .cse4) (and .cse1 .cse26 .cse3 .cse38 .cse5 .cse6 .cse22) (and .cse62 .cse64 .cse4 .cse18) (and .cse44 .cse16 .cse28 .cse4 .cse18 .cse9) (and .cse1 .cse2 .cse21 .cse36 .cse6 .cse22 .cse9) (and .cse31 .cse1 .cse21 .cse55 .cse6 .cse22 .cse9) (and .cse31 .cse49 .cse1 .cse3 .cse25 .cse6 .cse22) (and .cse20 .cse49 .cse1 .cse3 .cse6 .cse22 .cse29) (and .cse43 .cse1 .cse3 .cse5 .cse18 .cse6 .cse22) (and .cse31 .cse58 .cse4 .cse54 .cse9) (and .cse17 .cse62 .cse37 .cse4) (and .cse1 .cse3 .cse4 .cse6 .cse22 .cse9) (and .cse51 .cse18) (and .cse49 .cse1 .cse26 .cse3 .cse24 .cse6 .cse22) (and .cse1 .cse34 .cse3 .cse12 .cse4 .cse6 .cse22) (and .cse60 .cse18 .cse54) (and .cse49 .cse1 .cse3 .cse27 .cse12 .cse6 .cse22) (and .cse1 .cse3 .cse56 .cse27 .cse18 .cse6 .cse22) (and .cse39 .cse37 .cse54 .cse9) (and .cse44 .cse1 .cse37 .cse6 .cse22 .cse9 .cse52) (and .cse39 .cse35 .cse9 .cse29) (and .cse35 .cse3 .cse65 .cse37) (and .cse50 .cse12 .cse41) (and .cse31 .cse51 .cse55) (and .cse49 .cse1 .cse3 .cse62 .cse18 .cse6 .cse22) (and .cse1 .cse3 .cse4 .cse5 .cse18 .cse6 .cse57) (and .cse1 .cse26 .cse21 .cse33 .cse6 .cse22 .cse9) (and .cse14 .cse1 .cse3 .cse24 .cse7 .cse4 .cse6) (and .cse1 .cse46 .cse37 .cse33 .cse6 .cse22 .cse9) (and .cse2 .cse3 .cse24 (and .cse13 .cse1 .cse4 .cse6)) (and .cse49 .cse1 .cse37 .cse55 .cse6 .cse22 .cse9) (and .cse31 .cse3 .cse4 (and .cse20 .cse63)) (and .cse1 .cse3 .cse45 .cse24 .cse4 .cse6 .cse22) (and .cse1 .cse34 .cse3 .cse38 .cse18 .cse6 .cse22) (and .cse1 .cse56 .cse33 .cse18 .cse6 .cse22 .cse9) (and .cse1 .cse50 .cse18 .cse6 .cse22 .cse9 .cse52) (and .cse28 (and .cse3 .cse65) .cse18) (and .cse20 .cse1 .cse2 .cse3 .cse4 .cse6 .cse22) (and .cse0 .cse3 (and .cse20 .cse1 .cse4 .cse6) .cse29) (and .cse14 .cse1 .cse33 .cse4 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse4 .cse54 .cse6 .cse9 .cse29) (and .cse0 .cse2 .cse58 .cse4 .cse9) (and .cse31 .cse1 .cse3 .cse4 .cse6 .cse22 .cse19) (and .cse31 .cse1 .cse46 .cse36 .cse6 .cse22 .cse9) (and .cse15 .cse45 (and .cse1 .cse6) .cse7 .cse4 .cse9) (and .cse64 .cse34 .cse37 .cse4) (and .cse20 .cse1 .cse26 .cse23 .cse3 .cse6 .cse22) (and (or (and .cse1 .cse23 .cse6 .cse22 .cse9 .cse29) (and .cse41 .cse29)) .cse55) (and .cse31 .cse1 .cse53 .cse23 .cse6 .cse22 .cse9) (and .cse1 .cse3 .cse45 .cse21 .cse6 .cse22 .cse9) (and .cse26 .cse51 .cse33) (and .cse1 .cse3 .cse62 .cse4 .cse6 .cse22 .cse29) (and .cse1 .cse2 .cse3 .cse38 .cse6 .cse22 .cse9) (and .cse30 .cse1 .cse3 .cse37 .cse4 .cse5 .cse6) (and .cse35 .cse12 .cse58 .cse4 .cse9) (and .cse20 .cse1 .cse46 .cse3 .cse18 .cse6 .cse22) (and .cse31 .cse44 .cse63 .cse4 .cse9) (and .cse1 .cse3 .cse62 .cse21 .cse37 .cse6 .cse22) (and .cse37 .cse4 .cse54 .cse10)))))) [2018-12-02 14:11:27,949 INFO L448 ceAbstractionStarter]: For program point mainErr8ASSERT_VIOLATIONINTEGER_OVERFLOW(line 30) no Hoare annotation was computed. [2018-12-02 14:11:27,949 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 24) no Hoare annotation was computed. [2018-12-02 14:11:27,949 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 20) no Hoare annotation was computed. [2018-12-02 14:11:27,978 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 02.12 02:11:27 BoogieIcfgContainer [2018-12-02 14:11:27,978 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-02 14:11:27,978 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-02 14:11:27,978 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-02 14:11:27,978 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-02 14:11:27,979 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 02.12 02:09:25" (3/4) ... [2018-12-02 14:11:27,981 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-02 14:11:27,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-02 14:11:27,985 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-02 14:11:27,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-02 14:11:27,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-02 14:11:27,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:11:27,988 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-02 14:11:28,019 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_ac66ecb0-5cdd-4ac1-a697-fb06821cd420/bin-2019/utaipan/witness.graphml [2018-12-02 14:11:28,019 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-02 14:11:28,020 INFO L168 Benchmark]: Toolchain (without parser) took 122652.71 ms. Allocated memory was 1.0 GB in the beginning and 3.0 GB in the end (delta: 2.0 GB). Free memory was 961.4 MB in the beginning and 1.6 GB in the end (delta: -662.4 MB). Peak memory consumption was 1.3 GB. Max. memory is 11.5 GB. [2018-12-02 14:11:28,020 INFO L168 Benchmark]: CDTParser took 0.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:11:28,020 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-02 14:11:28,021 INFO L168 Benchmark]: Boogie Procedure Inliner took 16.08 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:11:28,021 INFO L168 Benchmark]: Boogie Preprocessor took 15.16 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:11:28,021 INFO L168 Benchmark]: RCFGBuilder took 161.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. [2018-12-02 14:11:28,021 INFO L168 Benchmark]: TraceAbstraction took 122291.03 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -518.0 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. [2018-12-02 14:11:28,021 INFO L168 Benchmark]: Witness Printer took 41.15 ms. Allocated memory is still 3.0 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-02 14:11:28,022 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.11 ms. Allocated memory is still 1.0 GB. Free memory is still 982.3 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 124.82 ms. Allocated memory is still 1.0 GB. Free memory was 961.4 MB in the beginning and 950.6 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 16.08 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 15.16 ms. Allocated memory is still 1.0 GB. Free memory is still 950.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 161.36 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 126.4 MB). Free memory was 950.6 MB in the beginning and 1.1 GB in the end (delta: -155.1 MB). Peak memory consumption was 18.5 MB. Max. memory is 11.5 GB. * TraceAbstraction took 122291.03 ms. Allocated memory was 1.2 GB in the beginning and 3.0 GB in the end (delta: 1.9 GB). Free memory was 1.1 GB in the beginning and 1.6 GB in the end (delta: -518.0 MB). Peak memory consumption was 4.4 GB. Max. memory is 11.5 GB. * Witness Printer took 41.15 ms. Allocated memory is still 3.0 GB. Free memory is still 1.6 GB. There was no memory consumed. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 20]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 24]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 26]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 30]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 28]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 10 specifications checked. All of them hold - InvariantResult [Line: 19]: Loop Invariant Derived loop invariant: ((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((((0 <= x + 3 && 0 <= i) && N <= i + 6) && 0 <= y) && x <= 0) && y <= 1) && N <= 10) || ((((((0 <= i && 0 <= y) && 0 <= x + 1) && N <= i + 9) && x <= 0) && N <= 10) && y <= 0)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x + 4) && N <= i + 4) && x <= 0)) || (((((0 <= x + 2 && N <= i + 7) && 0 <= y + 1) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && y <= 0)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && x <= 0) && N <= i) && y <= 8)) || ((((((y <= 4 && 0 <= i) && 0 <= y) && N <= i + 4) && x <= 2) && N <= 10) && 0 <= x)) || ((((((N <= i + 7 && 0 <= i) && x <= 1) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 4) && y <= 5) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && y <= 3) && x <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= x + 6) && 0 <= y) && x <= 0) && y <= 1) && N <= 10) && N <= i + 3)) || ((((((0 <= x + 8 && N <= i + 2) && 0 <= i) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 4) && 0 <= y + 3) && x <= 0) && y <= 0)) || ((((((0 <= i && x <= 1) && y <= 6) && 0 <= y) && N <= 10) && 0 <= x) && N <= i + 3)) || (((N <= i + 2 && 0 <= x + 6) && x <= 0) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10)) || (((((N <= i + 2 && 0 <= x + 5) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 3) && x <= 0) && y <= 0)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 6) && 0 <= y + 2) && x <= 0) && y <= 0)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= x + 6) && N <= i + 1) && 0 <= y + 3) && x <= 0) && y <= 0)) || ((((((0 <= i && N <= i + 4) && x <= 4) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x + 4) && N <= i + 4) && y <= 0)) || (((((0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 3) && x <= 0) && y <= 0) && N <= i + 3)) || (((((0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && N <= i + 3)) || ((((((0 <= i && y <= 9) && 0 <= y) && N <= i + 1) && x <= 0) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && N <= i) && x <= 0) && 0 <= x + 10) && N <= 10) && y <= 0)) || (((((((0 <= i && x <= 1) && N <= i + 6) && N <= 10) && 0 <= x) && y <= 0) || (N <= i + 6 && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) && 0 <= y + 3)) || (((0 <= y && N <= i + 4) && x <= 0) && y <= 4 && 0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && N <= i + 4) && x <= 0)) || ((((((x <= 9 && 0 <= i) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || (((N <= i + 2 && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x + 6) && y <= 0)) || (((((0 <= y + 4 && 0 <= x + 5) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 1) && x <= 0) && y <= 0)) || ((((((0 <= i && N <= i + 8) && 0 <= y) && 0 <= x + 1) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && x <= 6) && 0 <= y) && N <= i + 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 8)) || ((((((0 <= i && 0 <= y) && x <= 8) && y <= 2) && N <= i) && N <= 10) && 0 <= x)) || ((N <= i + 1 && x <= 0) && y <= 5 && 0 <= y && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((N <= i + 7 && x <= 3) && 0 <= i) && 0 <= y) && N <= 10) && 0 <= x) && y <= 0)) || ((0 <= y + 5 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i + 3)) || ((((((y <= 4 && 0 <= i) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x) && x <= 5)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 4) && x <= 0) && y <= 0) && N <= i + 3)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 6) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((N <= i + 2 && 0 <= y + 7) && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 8) && y <= 1) && N <= 10) && 0 <= x)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 3) && x <= 0) && N <= i) && 0 <= x + 7) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 9) && x <= 0) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 4) && 0 <= y + 6) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && x <= 4) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= y + 1 && x <= 3) && 0 <= i) && N <= i + 6) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y) && x <= 2) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && y <= 5) && N <= i) && N <= 10) && 0 <= x) && x <= 5)) || ((((N <= i + 2 && 0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 5) && x <= 0)) || ((((((0 <= i && 0 <= y) && y <= 5) && x <= 4) && N <= i + 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 4) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((y <= 4 && N <= i + 2) && 0 <= i) && 0 <= y) && x <= 4) && N <= 10) && 0 <= x)) || ((((((x <= 3 && 0 <= i) && 0 <= y + 7) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && x <= 7) && y <= 2) && N <= i + 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 5) && 0 <= x + 4) && 0 <= y) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && 0 <= y) && x <= 8) && N <= i + 1) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && N <= i + 1) && x <= 0) && N <= 10) && 0 <= x + 9) && y <= 0)) || ((((0 <= x + 8 && N <= i + 1) && x <= 0) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && y <= 0)) || ((((((0 <= i && x <= 8) && 0 <= y + 2) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || (((((((N <= i + 7 && 0 <= i) && x <= 1) && N <= 10) && 0 <= x) && y <= 0) || (N <= i + 7 && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) && 0 <= y + 2)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && y <= 3) && N <= 10) && 0 <= x) && x <= 5)) || (((0 <= x + 5 && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) && x <= 0) && N <= i + 3)) || ((((((0 <= i && 0 <= y + 7) && x <= 2) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && x <= 10) && 0 <= y) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= y + 4) && 0 <= i) && x <= 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && x <= 6) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((0 <= i && y <= 9) && 0 <= x + 1) && x <= 0) && N <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((0 <= i && x <= 7) && N <= i + 1) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || ((0 <= y + 4 && N <= i + 4) && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 4) && x <= 4) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 4) && 0 <= y + 6) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((x <= 9 && 0 <= y + 1) && 0 <= i) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((N <= i + 2 && (((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && 0 <= x + 5)) || ((((((0 <= i && N <= i + 6) && y <= 3) && 0 <= y) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((x <= 3 && 0 <= i) && N <= i + 4) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0) && x <= 5) && N <= i + 3)) || ((((((N <= i + 2 && 0 <= i) && y <= 6) && 0 <= y) && x <= 2) && N <= 10) && 0 <= x)) || ((((((N <= i + 7 && 0 <= y + 1) && 0 <= i) && x <= 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && N <= i + 4) && 0 <= y) && y <= 5) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && y <= 5) && x <= 0) && N <= 10) && 0 <= x)) || ((((((x <= 3 && 0 <= i) && N <= i + 6) && 0 <= y) && y <= 1) && N <= 10) && 0 <= x)) || ((((((0 <= y + 1 && 0 <= i) && N <= i + 9) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && x <= 1) && N <= i + 4) && N <= 10) && 0 <= x) && y <= 0)) || (((((((0 <= i && 0 <= x + 5) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 5) && N <= i)) || ((((((0 <= x + 2 && N <= i + 7) && 0 <= i) && 0 <= y) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && x <= 2) && N <= i) && N <= 10) && 0 <= x) && y <= 8) && 0 <= y + 2147483648)) || ((((((N <= i + 2 && 0 <= y + 1) && 0 <= i) && x <= 7) && N <= 10) && 0 <= x) && y <= 0)) || ((((((x <= 3 && 0 <= i) && N <= i + 5) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((((y <= 4 && 0 <= i) && N <= i + 5) && 0 <= y) && 0 <= x + 1) && x <= 0) && N <= 10)) || (((((0 <= i && x <= 0) && N <= i) && N <= 10) && 0 <= x) && 0 <= y + 2147483648)) || ((((((0 <= i && x <= 6) && 0 <= y) && y <= 3) && N <= i + 1) && N <= 10) && 0 <= x)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 5) && x <= 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && N <= i + 5) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= x + 3 && N <= i + 7) && 0 <= i) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && x <= 8) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= x + 5) && N <= i + 5) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((0 <= x + 8 && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && N <= i) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && N <= i + 5) && x <= 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && N <= i + 6) && 0 <= y) && y <= 2) && x <= 2) && N <= 10) && 0 <= x)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 5) && x <= 0) && N <= i + 3)) || ((((0 <= x + 6 && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0) && N <= i + 3)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y) && y <= 3) && x <= 0) && N <= 10) && 0 <= x)) || ((((((0 <= i && N <= i + 8) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && y <= 3) && x <= 4) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((0 <= y + 4 && x <= 3) && 0 <= i) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((0 <= i && 0 <= x + 4) && N <= i + 6) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || ((((((0 <= y + 4 && 0 <= i) && x <= 6) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 1) && 0 <= y + 6) && x <= 0) && y <= 0)) || ((((((0 <= i && x <= 6) && 0 <= y) && y <= 1) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((N <= i + 2 && 0 <= i) && x <= 1) && 0 <= y) && y <= 7) && N <= 10) && 0 <= x)) || ((x <= 0 && N <= i) && y <= 6 && 0 <= y && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((0 <= i && y <= 6) && 0 <= y) && 0 <= x + 1) && x <= 0) && N <= 10) && N <= i + 3)) || ((((((0 <= i && x <= 1) && 0 <= y) && N <= i + 9) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y + 8) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || (((((0 <= x + 3 && N <= i + 5) && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 2) && x <= 0) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 4) && y <= 1) && N <= 10) && 0 <= x) && x <= 5)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && y <= 7) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((N <= i + 2 && 0 <= i) && x <= 6) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y + 7) && x <= 0) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((0 <= x + 2 && N <= i + 2) && y <= 6) && (0 <= i && x <= 0) && N <= 10) && 0 <= y)) || ((((0 <= y + 5 && N <= i + 1) && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && y <= 0)) || ((((((0 <= i && 0 <= y) && 0 <= x + 1) && N <= i + 1) && x <= 0) && N <= 10) && y <= 8)) || (((0 <= x + 8 && x <= 0) && N <= i) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10)) || ((0 <= y + 7 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i + 1)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((((0 <= y + 6 && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && N <= i) && y <= 0)) || ((((((0 <= i && 0 <= x + 5) && 0 <= y) && N <= i + 4) && x <= 0) && y <= 1) && N <= 10)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && 0 <= x + 7) && x <= 0) && y <= 1) && N <= 10)) || ((((((0 <= i && x <= 1) && y <= 9) && N <= i) && N <= 10) && 0 <= x) && 0 <= y + 2147483648)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && 0 <= x + 6) && N <= i + 1)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && N <= i + 2) && 0 <= y + 5) && x <= 0) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && x <= 7) && y <= 1) && N <= 10) && 0 <= x)) || ((((((N <= i + 2 && x <= 3) && 0 <= i) && 0 <= y + 5) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 4) && x <= 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((N <= i + 5 && 0 <= y) && y <= 3) && x <= 0) && 0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && x <= 8) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && x <= 2) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || ((((((0 <= y + 1 && 0 <= i) && N <= i + 4) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((((((0 <= i && 0 <= y) && y <= 2) && N <= 10) && 0 <= x) && x <= 5) && N <= i + 3)) || ((((((0 <= i && 0 <= y) && y <= 5) && x <= 2) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((x <= 3 && 0 <= i) && y <= 6) && 0 <= y) && N <= i + 1) && N <= 10) && 0 <= x)) || ((0 <= y + 4 && N <= i + 5) && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((((((0 <= i && 0 <= x + 6) && N <= i + 4) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((((((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && N <= i) && 0 <= x + 9) && y <= 0)) || ((((((0 <= y + 1 && 0 <= i) && x <= 1) && N <= i + 8) && N <= 10) && 0 <= x) && y <= 0)) || (((((((0 <= i && x <= 1) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0) || (N <= i + 1 && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) && 0 <= y + 9)) || ((((((0 <= i && x <= 1) && N <= i + 6) && 0 <= y) && y <= 3) && N <= 10) && 0 <= x)) || ((((N <= i + 5 && 0 <= x + 4) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0)) || (((((0 <= x + 3 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y + 7) && x <= 0) && N <= i) && y <= 0)) || ((((((0 <= x + 2 && 0 <= i) && N <= i + 8) && 0 <= y) && x <= 0) && N <= 10) && y <= 0)) || (((0 <= y + 5 && (((0 <= i && 0 <= x + 5) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && N <= i) && y <= 0)) || ((((((0 <= i && 0 <= y) && x <= 7) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3)) || (((0 <= x + 3 && N <= i + 5) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) && x <= 0)) || ((((((0 <= i && N <= i + 5) && 0 <= y) && x <= 4) && y <= 1) && N <= 10) && 0 <= x)) || (((y <= 7 && ((0 <= x + 3 && 0 <= i) && 0 <= y) && N <= 10) && x <= 0) && N <= i)) || (((((0 <= y + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= x + 6) && x <= 0) && N <= i) && y <= 0)) || ((((((0 <= i && N <= i + 6) && x <= 2) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && x <= 2) && 0 <= y + 6) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 2 && x <= 3) && 0 <= i) && 0 <= y) && y <= 5) && N <= 10) && 0 <= x)) || ((((((y <= 4 && x <= 3) && 0 <= i) && 0 <= y) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((x <= 9 && 0 <= i) && 0 <= y) && y <= 1) && N <= i) && N <= 10) && 0 <= x)) || ((((N <= i + 2 && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && 0 <= x + 7) && y <= 0)) || (((((0 <= x + 2 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 7) && N <= i + 1) && x <= 0)) || (((((0 <= i && 0 <= y) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i)) || ((((((x <= 3 && 0 <= i) && N <= i + 5) && 0 <= y) && y <= 2) && N <= 10) && 0 <= x)) || ((((((0 <= i && y <= 6) && 0 <= y) && N <= i + 4) && x <= 0) && N <= 10) && 0 <= x)) || ((((((((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && 0 <= y) && y <= 3) && x <= 0) && N <= i) && 0 <= x + 7)) || ((((((x <= 3 && 0 <= i) && 0 <= y) && y <= 3) && N <= i + 4) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && x <= 7) && y <= 3) && N <= i) && N <= 10) && 0 <= x)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && N <= i + 1) && 0 <= x + 7) && y <= 0)) || ((((((0 <= y + 4 && 0 <= i) && N <= i + 1) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || (((((((0 <= x + 2147483648 && 0 <= i) && 0 <= y + 2) && x <= 0) && N <= 10) && 0 <= x + 5) && y <= 0) && N <= i + 3)) || (((0 <= x + 5 && 0 <= y) && (y <= 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && N <= i + 1)) || ((0 <= y + 5 && N <= i + 4) && ((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0)) || ((N <= i + 2 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && 0 <= y + 6)) || ((((((x <= 3 && 0 <= i) && 0 <= y) && y <= 7) && N <= i) && N <= 10) && 0 <= x)) || ((((((0 <= i && 0 <= y) && x <= 0) && y <= 1) && N <= i) && N <= 10) && 0 <= x + 9)) || ((((((0 <= i && N <= i + 5) && x <= 2) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y) && y <= 2) && 0 <= x + 1) && x <= 0) && N <= 10)) || ((((((0 <= i && x <= 6) && N <= i + 1) && 0 <= y + 3) && N <= 10) && 0 <= x) && y <= 0)) || (((N <= i + 6 && 0 <= y) && y <= 2) && ((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10)) || ((((((x <= 3 && 0 <= i) && N <= i + 1) && 0 <= y + 6) && N <= 10) && 0 <= x) && y <= 0)) || (((N <= i + 2 && 0 <= y) && x <= 0) && y <= 4 && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648)) || ((((((0 <= i && 0 <= y) && N <= i + 8) && y <= 2) && x <= 0) && N <= 10) && 0 <= x)) || ((((((0 <= i && y <= 6) && 0 <= y) && x <= 4) && N <= i) && N <= 10) && 0 <= x)) || ((((((0 <= i && x <= 7) && 0 <= y + 3) && N <= i) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y + 5) && N <= i) && N <= 10) && 0 <= x) && y <= 0) && x <= 5)) || ((0 <= x + 6 && 0 <= y && (y <= 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && N <= i)) || ((((((y <= 4 && 0 <= i) && N <= i + 6) && 0 <= y) && x <= 0) && N <= 10) && 0 <= x)) || (((0 <= x + 3 && 0 <= y) && ((y <= 4 && 0 <= i) && x <= 0) && N <= 10) && N <= i + 3)) || ((((((N <= i + 7 && 0 <= i) && 0 <= y + 3) && x <= 0) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && x <= 0) && 0 <= x + 7) && N <= 10) && y <= 0) && N <= i + 3)) || ((((0 <= x + 3 && N <= i + 6) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y) && x <= 0) && N <= 10) && 0 <= x) && y <= 8)) || ((((((N <= i + 2 && 0 <= i) && x <= 6) && 0 <= y + 2) && N <= 10) && 0 <= x) && y <= 0)) || (((((0 <= y + 1 && N <= i + 8) && 0 <= i && N <= 10) && 0 <= x + 1) && x <= 0) && y <= 0)) || ((((((0 <= x + 3 && 0 <= i) && 0 <= y) && N <= 10) && y <= 6) && N <= i + 1) && x <= 0)) || ((((((y <= 4 && 0 <= i) && N <= i + 5) && x <= 1) && 0 <= y) && N <= 10) && 0 <= x)) || (((((((0 <= i && x <= 1) && N <= 10) && 0 <= x) && y <= 0) && N <= i + 3) || ((((((0 <= i && 0 <= x + 1) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && N <= i + 3)) && 0 <= y + 6)) || ((((((N <= i + 2 && 0 <= i) && 0 <= y + 7) && x <= 1) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= i && 0 <= y) && N <= i + 8) && x <= 2) && N <= 10) && 0 <= x) && y <= 0)) || ((N <= i + 5 && ((((0 <= x + 2 && 0 <= i) && x <= 0) && N <= 10) && 0 <= y + 2147483648) && y <= 0) && 0 <= y + 3)) || ((((((0 <= i && 0 <= y) && y <= 7) && x <= 0) && N <= 10) && 0 <= x) && N <= i + 3)) || ((((((0 <= i && N <= i + 6) && 0 <= y) && x <= 4) && N <= 10) && 0 <= x) && y <= 0)) || ((((((0 <= x + 8 && 0 <= i) && 0 <= y) && N <= i + 1) && x <= 0) && y <= 1) && N <= 10)) || ((((0 <= x + 5 && N <= i + 4) && ((0 <= x + 2147483648 && 0 <= y + 1) && 0 <= i) && N <= 10) && x <= 0) && y <= 0)) || ((((((y <= 4 && 0 <= i) && x <= 6) && 0 <= y) && N <= i) && N <= 10) && 0 <= x)) || ((((N <= i + 2 && 0 <= y + 4) && 0 <= x + 4 && ((0 <= x + 2147483648 && 0 <= i) && N <= 10) && 0 <= y + 2147483648) && x <= 0) && y <= 0)) || ((((((0 <= i && 0 <= y) && y <= 7) && x <= 2) && N <= i + 1) && N <= 10) && 0 <= x)) || (((N <= i + 1 && x <= 0) && 0 <= x + 7) && (((0 <= x + 2147483648 && 0 <= i) && 0 <= y) && y <= 2) && N <= 10) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 36 locations, 10 error locations. SAFE Result, 122.2s OverallTime, 49 OverallIterations, 13 TraceHistogramMax, 12.9s AutomataDifference, 0.0s DeadEndRemovalTime, 86.9s HoareAnnotationTime, HoareTripleCheckerStatistics: 1469 SDtfs, 8173 SDslu, 6256 SDs, 0 SdLazy, 1594 SolverSat, 1407 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 1.2s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 4914 GetRequests, 4380 SyntacticMatches, 0 SemanticMatches, 534 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 3.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=107157occurred in iteration=46, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.3s AbstIntTime, 7 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 15.8s AutomataMinimizationTime, 49 MinimizatonAttempts, 261319 StatesRemovedByMinimization, 44 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 1839 NumberOfFragments, 6091 HoareAnnotationTreeSize, 5 FomulaSimplifications, 292925 FormulaSimplificationTreeSizeReduction, 25.1s HoareSimplificationTime, 5 FomulaSimplificationsInter, 79435 FormulaSimplificationTreeSizeReductionInter, 61.8s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.4s SatisfiabilityAnalysisTime, 4.1s InterpolantComputationTime, 4790 NumberOfCodeBlocks, 4790 NumberOfCodeBlocksAsserted, 174 NumberOfCheckSat, 6972 ConstructedInterpolants, 0 QuantifiedInterpolants, 1738298 SizeOfPredicates, 2 NumberOfNonLiveVariables, 5325 ConjunctsInSsa, 298 ConjunctsInUnsatCore, 133 InterpolantComputations, 11 PerfectInterpolantSequences, 559/20934 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...