./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_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_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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 ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d .......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-03 03:30:39,202 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-03 03:30:39,203 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-03 03:30:39,209 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-03 03:30:39,210 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-03 03:30:39,210 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-03 03:30:39,211 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-03 03:30:39,212 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-03 03:30:39,212 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-03 03:30:39,213 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-03 03:30:39,213 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-03 03:30:39,214 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-03 03:30:39,214 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-03 03:30:39,215 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-03 03:30:39,215 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-03 03:30:39,215 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-03 03:30:39,216 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-03 03:30:39,217 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-03 03:30:39,218 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-03 03:30:39,218 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-03 03:30:39,219 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-03 03:30:39,219 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-03 03:30:39,220 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-03 03:30:39,221 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-03 03:30:39,221 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-03 03:30:39,221 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-03 03:30:39,222 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-03 03:30:39,222 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-03 03:30:39,223 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-03 03:30:39,223 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-03 03:30:39,223 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-03 03:30:39,224 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-03 03:30:39,224 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-03 03:30:39,224 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-03 03:30:39,224 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-03 03:30:39,225 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-03 03:30:39,225 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-03 03:30:39,232 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-03 03:30:39,232 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-03 03:30:39,232 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-03 03:30:39,232 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-03 03:30:39,233 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-03 03:30:39,233 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-03 03:30:39,234 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-03 03:30:39,234 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-03 03:30:39,234 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-03 03:30:39,234 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-03 03:30:39,234 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-03 03:30:39,235 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-03 03:30:39,235 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-03 03:30:39,236 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-03 03:30:39,236 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-03 03:30:39,237 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-03 03:30:39,237 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-03 03:30:39,237 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_589b214f-d282-46a4-9183-c34c98dc1609/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 -> ac99a20a7aff68d4303ed37ca9ad8305a1f8cf0d [2018-12-03 03:30:39,254 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-03 03:30:39,260 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-03 03:30:39,262 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-03 03:30:39,263 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-03 03:30:39,263 INFO L276 PluginConnector]: CDTParser initialized [2018-12-03 03:30:39,263 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-03 03:30:39,298 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/data/86f10a116/c05d87ec465d4cff99afa9a0430390cb/FLAGfe2bea64d [2018-12-03 03:30:39,617 INFO L307 CDTParser]: Found 1 translation units. [2018-12-03 03:30:39,617 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-03 03:30:39,623 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/data/86f10a116/c05d87ec465d4cff99afa9a0430390cb/FLAGfe2bea64d [2018-12-03 03:30:40,029 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/data/86f10a116/c05d87ec465d4cff99afa9a0430390cb [2018-12-03 03:30:40,032 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-03 03:30:40,033 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-03 03:30:40,034 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-03 03:30:40,034 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-03 03:30:40,037 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-03 03:30:40,037 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,039 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@343f3083 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40, skipping insertion in model container [2018-12-03 03:30:40,039 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,044 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-03 03:30:40,055 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-03 03:30:40,138 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:30:40,140 INFO L191 MainTranslator]: Completed pre-run [2018-12-03 03:30:40,150 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-03 03:30:40,157 INFO L195 MainTranslator]: Completed translation [2018-12-03 03:30:40,158 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40 WrapperNode [2018-12-03 03:30:40,158 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-03 03:30:40,158 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-03 03:30:40,158 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-03 03:30:40,158 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-03 03:30:40,163 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,166 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,170 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-03 03:30:40,170 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-03 03:30:40,170 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-03 03:30:40,170 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-03 03:30:40,175 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,175 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,176 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,176 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,178 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,181 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,182 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... [2018-12-03 03:30:40,182 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-03 03:30:40,183 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-03 03:30:40,183 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-03 03:30:40,183 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-03 03:30:40,183 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-03 03:30:40,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-03 03:30:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-03 03:30:40,244 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-03 03:30:40,244 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-03 03:30:40,244 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-03 03:30:40,347 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-03 03:30:40,347 INFO L280 CfgBuilder]: Removed 3 assue(true) statements. [2018-12-03 03:30:40,347 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:30:40 BoogieIcfgContainer [2018-12-03 03:30:40,347 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-03 03:30:40,348 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-03 03:30:40,348 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-03 03:30:40,350 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-03 03:30:40,350 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 03.12 03:30:40" (1/3) ... [2018-12-03 03:30:40,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645c7fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:30:40, skipping insertion in model container [2018-12-03 03:30:40,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 03.12 03:30:40" (2/3) ... [2018-12-03 03:30:40,351 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@645c7fcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 03.12 03:30:40, skipping insertion in model container [2018-12-03 03:30:40,351 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:30:40" (3/3) ... [2018-12-03 03:30:40,352 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-nestedLoop_true-termination_true-no-overflow.c [2018-12-03 03:30:40,358 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-03 03:30:40,363 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 8 error locations. [2018-12-03 03:30:40,377 INFO L257 AbstractCegarLoop]: Starting to check reachability of 8 error locations. [2018-12-03 03:30:40,400 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-03 03:30:40,400 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-03 03:30:40,400 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-03 03:30:40,400 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-03 03:30:40,400 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-03 03:30:40,401 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-03 03:30:40,401 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-03 03:30:40,401 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-03 03:30:40,411 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states. [2018-12-03 03:30:40,415 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 03:30:40,416 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,416 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,417 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,420 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,421 INFO L82 PathProgramCache]: Analyzing trace with hash 2054482639, now seen corresponding path program 1 times [2018-12-03 03:30:40,422 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,463 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,463 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,463 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,508 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-03 03:30:40,509 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,509 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,509 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,512 INFO L459 AbstractCegarLoop]: Interpolant automaton has 2 states [2018-12-03 03:30:40,519 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2018-12-03 03:30:40,519 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 03:30:40,520 INFO L87 Difference]: Start difference. First operand 31 states. Second operand 2 states. [2018-12-03 03:30:40,532 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,532 INFO L93 Difference]: Finished difference Result 56 states and 67 transitions. [2018-12-03 03:30:40,532 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2018-12-03 03:30:40,533 INFO L78 Accepts]: Start accepts. Automaton has 2 states. Word has length 9 [2018-12-03 03:30:40,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,538 INFO L225 Difference]: With dead ends: 56 [2018-12-03 03:30:40,538 INFO L226 Difference]: Without dead ends: 26 [2018-12-03 03:30:40,540 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2018-12-03 03:30:40,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 26 states. [2018-12-03 03:30:40,559 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 26 to 26. [2018-12-03 03:30:40,560 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2018-12-03 03:30:40,560 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 28 transitions. [2018-12-03 03:30:40,561 INFO L78 Accepts]: Start accepts. Automaton has 26 states and 28 transitions. Word has length 9 [2018-12-03 03:30:40,561 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,561 INFO L480 AbstractCegarLoop]: Abstraction has 26 states and 28 transitions. [2018-12-03 03:30:40,561 INFO L481 AbstractCegarLoop]: Interpolant automaton has 2 states. [2018-12-03 03:30:40,562 INFO L276 IsEmpty]: Start isEmpty. Operand 26 states and 28 transitions. [2018-12-03 03:30:40,562 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 03:30:40,562 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,562 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,562 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,562 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,563 INFO L82 PathProgramCache]: Analyzing trace with hash 2054481740, now seen corresponding path program 1 times [2018-12-03 03:30:40,563 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,564 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,564 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,564 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,571 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,596 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-03 03:30:40,596 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,596 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,596 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,597 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:30:40,597 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:30:40,597 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:30:40,597 INFO L87 Difference]: Start difference. First operand 26 states and 28 transitions. Second operand 3 states. [2018-12-03 03:30:40,618 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,618 INFO L93 Difference]: Finished difference Result 45 states and 50 transitions. [2018-12-03 03:30:40,619 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:30:40,619 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 03:30:40,619 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,619 INFO L225 Difference]: With dead ends: 45 [2018-12-03 03:30:40,619 INFO L226 Difference]: Without dead ends: 44 [2018-12-03 03:30:40,620 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-03 03:30:40,620 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 44 states. [2018-12-03 03:30:40,623 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 44 to 29. [2018-12-03 03:30:40,623 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 03:30:40,623 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 32 transitions. [2018-12-03 03:30:40,623 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 32 transitions. Word has length 9 [2018-12-03 03:30:40,623 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,623 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 32 transitions. [2018-12-03 03:30:40,624 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:30:40,624 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 32 transitions. [2018-12-03 03:30:40,624 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-03 03:30:40,624 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,624 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,624 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,624 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,624 INFO L82 PathProgramCache]: Analyzing trace with hash 2054481774, now seen corresponding path program 1 times [2018-12-03 03:30:40,624 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,625 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,625 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,626 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,630 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,638 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-03 03:30:40,638 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,638 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,639 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,639 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:30:40,639 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:30:40,639 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:30:40,639 INFO L87 Difference]: Start difference. First operand 29 states and 32 transitions. Second operand 3 states. [2018-12-03 03:30:40,654 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,654 INFO L93 Difference]: Finished difference Result 38 states and 43 transitions. [2018-12-03 03:30:40,655 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:30:40,655 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-03 03:30:40,655 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,655 INFO L225 Difference]: With dead ends: 38 [2018-12-03 03:30:40,655 INFO L226 Difference]: Without dead ends: 37 [2018-12-03 03:30:40,655 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-03 03:30:40,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 37 states. [2018-12-03 03:30:40,657 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 37 to 31. [2018-12-03 03:30:40,657 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 31 states. [2018-12-03 03:30:40,658 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 31 states to 31 states and 35 transitions. [2018-12-03 03:30:40,658 INFO L78 Accepts]: Start accepts. Automaton has 31 states and 35 transitions. Word has length 9 [2018-12-03 03:30:40,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,658 INFO L480 AbstractCegarLoop]: Abstraction has 31 states and 35 transitions. [2018-12-03 03:30:40,658 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:30:40,658 INFO L276 IsEmpty]: Start isEmpty. Operand 31 states and 35 transitions. [2018-12-03 03:30:40,658 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 03:30:40,659 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,659 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,659 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,659 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,659 INFO L82 PathProgramCache]: Analyzing trace with hash -735575413, now seen corresponding path program 1 times [2018-12-03 03:30:40,659 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,660 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,660 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,660 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,664 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,672 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-03 03:30:40,672 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,672 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,672 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,672 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:30:40,673 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:30:40,673 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:30:40,673 INFO L87 Difference]: Start difference. First operand 31 states and 35 transitions. Second operand 3 states. [2018-12-03 03:30:40,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,688 INFO L93 Difference]: Finished difference Result 49 states and 56 transitions. [2018-12-03 03:30:40,689 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:30:40,689 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 03:30:40,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,689 INFO L225 Difference]: With dead ends: 49 [2018-12-03 03:30:40,689 INFO L226 Difference]: Without dead ends: 48 [2018-12-03 03:30:40,689 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-03 03:30:40,690 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 48 states. [2018-12-03 03:30:40,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 48 to 35. [2018-12-03 03:30:40,692 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 03:30:40,692 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 41 transitions. [2018-12-03 03:30:40,693 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 41 transitions. Word has length 10 [2018-12-03 03:30:40,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,693 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 41 transitions. [2018-12-03 03:30:40,693 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:30:40,693 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 41 transitions. [2018-12-03 03:30:40,693 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-03 03:30:40,693 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,693 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,693 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,693 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,694 INFO L82 PathProgramCache]: Analyzing trace with hash -735574387, now seen corresponding path program 1 times [2018-12-03 03:30:40,694 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,694 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,694 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,694 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,705 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-03 03:30:40,705 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,705 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,706 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,706 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:30:40,706 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:30:40,706 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:30:40,706 INFO L87 Difference]: Start difference. First operand 35 states and 41 transitions. Second operand 3 states. [2018-12-03 03:30:40,716 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,716 INFO L93 Difference]: Finished difference Result 35 states and 41 transitions. [2018-12-03 03:30:40,716 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:30:40,716 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-03 03:30:40,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,717 INFO L225 Difference]: With dead ends: 35 [2018-12-03 03:30:40,717 INFO L226 Difference]: Without dead ends: 34 [2018-12-03 03:30:40,717 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-03 03:30:40,717 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2018-12-03 03:30:40,719 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2018-12-03 03:30:40,719 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-03 03:30:40,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-03 03:30:40,720 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 10 [2018-12-03 03:30:40,720 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,720 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-03 03:30:40,720 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:30:40,720 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-03 03:30:40,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2018-12-03 03:30:40,720 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,720 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,720 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,721 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,721 INFO L82 PathProgramCache]: Analyzing trace with hash -1327969452, now seen corresponding path program 1 times [2018-12-03 03:30:40,721 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,721 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,722 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,722 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,722 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,725 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,736 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-03 03:30:40,737 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,737 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,737 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,737 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:30:40,737 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:30:40,737 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:30:40,737 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-12-03 03:30:40,745 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,745 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-03 03:30:40,745 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:30:40,745 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 11 [2018-12-03 03:30:40,745 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,746 INFO L225 Difference]: With dead ends: 34 [2018-12-03 03:30:40,746 INFO L226 Difference]: Without dead ends: 33 [2018-12-03 03:30:40,746 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-03 03:30:40,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-03 03:30:40,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-03 03:30:40,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-03 03:30:40,749 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-03 03:30:40,749 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 11 [2018-12-03 03:30:40,749 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,749 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-03 03:30:40,749 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:30:40,749 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-03 03:30:40,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2018-12-03 03:30:40,749 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,749 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,750 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,750 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,750 INFO L82 PathProgramCache]: Analyzing trace with hash 1782620015, now seen corresponding path program 1 times [2018-12-03 03:30:40,750 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,751 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,751 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,751 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,764 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-03 03:30:40,765 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:40,765 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-03 03:30:40,765 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:40,765 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-03 03:30:40,765 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-03 03:30:40,765 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-03 03:30:40,765 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 3 states. [2018-12-03 03:30:40,773 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,773 INFO L93 Difference]: Finished difference Result 33 states and 39 transitions. [2018-12-03 03:30:40,773 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-03 03:30:40,773 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 12 [2018-12-03 03:30:40,773 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,774 INFO L225 Difference]: With dead ends: 33 [2018-12-03 03:30:40,774 INFO L226 Difference]: Without dead ends: 32 [2018-12-03 03:30:40,774 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-03 03:30:40,774 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2018-12-03 03:30:40,776 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 32. [2018-12-03 03:30:40,776 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 32 states. [2018-12-03 03:30:40,777 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2018-12-03 03:30:40,777 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 12 [2018-12-03 03:30:40,777 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:40,777 INFO L480 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2018-12-03 03:30:40,777 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-03 03:30:40,777 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2018-12-03 03:30:40,777 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-03 03:30:40,777 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:40,777 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:40,778 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:40,778 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,778 INFO L82 PathProgramCache]: Analyzing trace with hash -603938557, now seen corresponding path program 1 times [2018-12-03 03:30:40,778 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:40,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,779 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,779 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:40,779 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:40,782 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,794 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:40,795 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:40,795 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:40,795 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-03 03:30:40,796 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [23], [54], [55], [57], [66], [67], [68] [2018-12-03 03:30:40,819 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:30:40,819 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:30:40,905 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:30:40,906 INFO L272 AbstractInterpreter]: Visited 11 different actions 21 times. Merged at 4 different actions 8 times. Never widened. Performed 101 root evaluator evaluations with a maximum evaluation depth of 3. Performed 101 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-12-03 03:30:40,911 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:40,912 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:30:40,912 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:40,912 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:40,918 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:40,919 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:30:40,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:40,930 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:40,940 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:40,941 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:40,957 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:40,971 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:40,971 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 03:30:40,971 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:40,972 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:30:40,972 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:30:40,972 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:30:40,972 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand 4 states. [2018-12-03 03:30:40,995 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:40,995 INFO L93 Difference]: Finished difference Result 58 states and 67 transitions. [2018-12-03 03:30:40,995 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:30:40,996 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-03 03:30:40,996 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:40,996 INFO L225 Difference]: With dead ends: 58 [2018-12-03 03:30:40,996 INFO L226 Difference]: Without dead ends: 57 [2018-12-03 03:30:40,997 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 24 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-03 03:30:40,997 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2018-12-03 03:30:41,000 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 36. [2018-12-03 03:30:41,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2018-12-03 03:30:41,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 43 transitions. [2018-12-03 03:30:41,001 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 43 transitions. Word has length 13 [2018-12-03 03:30:41,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,002 INFO L480 AbstractCegarLoop]: Abstraction has 36 states and 43 transitions. [2018-12-03 03:30:41,002 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:30:41,002 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 43 transitions. [2018-12-03 03:30:41,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-03 03:30:41,002 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,002 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,003 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,003 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,003 INFO L82 PathProgramCache]: Analyzing trace with hash -594114383, now seen corresponding path program 1 times [2018-12-03 03:30:41,003 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,004 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,004 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,004 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,008 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,027 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-03 03:30:41,027 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:41,028 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:30:41,028 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:41,028 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:30:41,028 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:30:41,028 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:30:41,028 INFO L87 Difference]: Start difference. First operand 36 states and 43 transitions. Second operand 4 states. [2018-12-03 03:30:41,046 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,046 INFO L93 Difference]: Finished difference Result 36 states and 43 transitions. [2018-12-03 03:30:41,046 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:30:41,046 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 14 [2018-12-03 03:30:41,046 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,048 INFO L225 Difference]: With dead ends: 36 [2018-12-03 03:30:41,048 INFO L226 Difference]: Without dead ends: 35 [2018-12-03 03:30:41,048 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:30:41,048 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 35 states. [2018-12-03 03:30:41,051 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 35 to 35. [2018-12-03 03:30:41,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 35 states. [2018-12-03 03:30:41,052 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 35 states to 35 states and 42 transitions. [2018-12-03 03:30:41,052 INFO L78 Accepts]: Start accepts. Automaton has 35 states and 42 transitions. Word has length 14 [2018-12-03 03:30:41,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,052 INFO L480 AbstractCegarLoop]: Abstraction has 35 states and 42 transitions. [2018-12-03 03:30:41,052 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:30:41,052 INFO L276 IsEmpty]: Start isEmpty. Operand 35 states and 42 transitions. [2018-12-03 03:30:41,052 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2018-12-03 03:30:41,053 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,053 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,053 INFO L423 AbstractCegarLoop]: === Iteration 10 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,053 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,053 INFO L82 PathProgramCache]: Analyzing trace with hash -1237676613, now seen corresponding path program 1 times [2018-12-03 03:30:41,053 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,054 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,054 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,055 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,057 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,068 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-03 03:30:41,068 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:41,068 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:30:41,068 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:41,068 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:30:41,068 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:30:41,069 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:30:41,069 INFO L87 Difference]: Start difference. First operand 35 states and 42 transitions. Second operand 4 states. [2018-12-03 03:30:41,090 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,090 INFO L93 Difference]: Finished difference Result 38 states and 44 transitions. [2018-12-03 03:30:41,090 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:30:41,090 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 15 [2018-12-03 03:30:41,090 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,091 INFO L225 Difference]: With dead ends: 38 [2018-12-03 03:30:41,091 INFO L226 Difference]: Without dead ends: 36 [2018-12-03 03:30:41,091 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:30:41,091 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-03 03:30:41,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 29. [2018-12-03 03:30:41,094 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 29 states. [2018-12-03 03:30:41,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 34 transitions. [2018-12-03 03:30:41,094 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 34 transitions. Word has length 15 [2018-12-03 03:30:41,094 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,095 INFO L480 AbstractCegarLoop]: Abstraction has 29 states and 34 transitions. [2018-12-03 03:30:41,095 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:30:41,095 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 34 transitions. [2018-12-03 03:30:41,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 03:30:41,095 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,095 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,096 INFO L423 AbstractCegarLoop]: === Iteration 11 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,096 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,096 INFO L82 PathProgramCache]: Analyzing trace with hash 286676217, now seen corresponding path program 1 times [2018-12-03 03:30:41,096 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,097 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,097 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,097 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,100 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,118 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 03:30:41,119 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-03 03:30:41,119 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-03 03:30:41,119 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-03 03:30:41,119 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:30:41,119 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:30:41,119 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2018-12-03 03:30:41,119 INFO L87 Difference]: Start difference. First operand 29 states and 34 transitions. Second operand 4 states. [2018-12-03 03:30:41,153 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,154 INFO L93 Difference]: Finished difference Result 57 states and 66 transitions. [2018-12-03 03:30:41,154 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2018-12-03 03:30:41,154 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 03:30:41,154 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,154 INFO L225 Difference]: With dead ends: 57 [2018-12-03 03:30:41,154 INFO L226 Difference]: Without dead ends: 56 [2018-12-03 03:30:41,155 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2018-12-03 03:30:41,155 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 56 states. [2018-12-03 03:30:41,157 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 56 to 37. [2018-12-03 03:30:41,157 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 37 states. [2018-12-03 03:30:41,158 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 37 states to 37 states and 45 transitions. [2018-12-03 03:30:41,158 INFO L78 Accepts]: Start accepts. Automaton has 37 states and 45 transitions. Word has length 16 [2018-12-03 03:30:41,158 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,158 INFO L480 AbstractCegarLoop]: Abstraction has 37 states and 45 transitions. [2018-12-03 03:30:41,158 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:30:41,158 INFO L276 IsEmpty]: Start isEmpty. Operand 37 states and 45 transitions. [2018-12-03 03:30:41,158 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2018-12-03 03:30:41,158 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,159 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,159 INFO L423 AbstractCegarLoop]: === Iteration 12 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,159 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,159 INFO L82 PathProgramCache]: Analyzing trace with hash 286676251, now seen corresponding path program 1 times [2018-12-03 03:30:41,159 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,160 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,160 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,160 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,162 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,171 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-03 03:30:41,171 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,171 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:41,171 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 17 with the following transitions: [2018-12-03 03:30:41,171 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [25], [26], [27], [29], [35], [37], [40], [50], [66], [67], [68] [2018-12-03 03:30:41,172 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:30:41,172 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:30:41,200 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:30:41,200 INFO L272 AbstractInterpreter]: Visited 15 different actions 31 times. Merged at 7 different actions 14 times. Never widened. Performed 127 root evaluator evaluations with a maximum evaluation depth of 3. Performed 127 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 1 fixpoints after 1 different actions. Largest state had 12 variables. [2018-12-03 03:30:41,201 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,201 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:30:41,201 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,202 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:41,207 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,208 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:30:41,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,214 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:41,216 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-03 03:30:41,216 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:41,228 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-03 03:30:41,243 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:41,243 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-03 03:30:41,243 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:41,243 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-03 03:30:41,243 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-03 03:30:41,243 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:30:41,244 INFO L87 Difference]: Start difference. First operand 37 states and 45 transitions. Second operand 4 states. [2018-12-03 03:30:41,262 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,263 INFO L93 Difference]: Finished difference Result 66 states and 79 transitions. [2018-12-03 03:30:41,263 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-03 03:30:41,263 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 16 [2018-12-03 03:30:41,263 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,264 INFO L225 Difference]: With dead ends: 66 [2018-12-03 03:30:41,264 INFO L226 Difference]: Without dead ends: 65 [2018-12-03 03:30:41,264 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 30 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-03 03:30:41,264 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2018-12-03 03:30:41,270 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 53. [2018-12-03 03:30:41,270 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 53 states. [2018-12-03 03:30:41,270 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 53 states to 53 states and 65 transitions. [2018-12-03 03:30:41,271 INFO L78 Accepts]: Start accepts. Automaton has 53 states and 65 transitions. Word has length 16 [2018-12-03 03:30:41,271 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,271 INFO L480 AbstractCegarLoop]: Abstraction has 53 states and 65 transitions. [2018-12-03 03:30:41,271 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-03 03:30:41,271 INFO L276 IsEmpty]: Start isEmpty. Operand 53 states and 65 transitions. [2018-12-03 03:30:41,271 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-03 03:30:41,271 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,272 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,272 INFO L423 AbstractCegarLoop]: === Iteration 13 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,272 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,272 INFO L82 PathProgramCache]: Analyzing trace with hash -1189435590, now seen corresponding path program 2 times [2018-12-03 03:30:41,272 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,273 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,273 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,273 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,276 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,298 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-03 03:30:41,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,298 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:41,298 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 03:30:41,298 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 03:30:41,298 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,299 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:41,305 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 03:30:41,305 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 03:30:41,310 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-03 03:30:41,311 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 03:30:41,311 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:41,322 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 03:30:41,322 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:41,329 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-03 03:30:41,344 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:41,344 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2018-12-03 03:30:41,344 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:41,344 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:30:41,344 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:30:41,344 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:30:41,345 INFO L87 Difference]: Start difference. First operand 53 states and 65 transitions. Second operand 7 states. [2018-12-03 03:30:41,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,389 INFO L93 Difference]: Finished difference Result 84 states and 101 transitions. [2018-12-03 03:30:41,389 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:30:41,389 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 17 [2018-12-03 03:30:41,389 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,390 INFO L225 Difference]: With dead ends: 84 [2018-12-03 03:30:41,390 INFO L226 Difference]: Without dead ends: 83 [2018-12-03 03:30:41,390 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 41 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:30:41,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2018-12-03 03:30:41,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 49. [2018-12-03 03:30:41,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 03:30:41,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 60 transitions. [2018-12-03 03:30:41,394 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 60 transitions. Word has length 17 [2018-12-03 03:30:41,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,395 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 60 transitions. [2018-12-03 03:30:41,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:30:41,395 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 60 transitions. [2018-12-03 03:30:41,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2018-12-03 03:30:41,395 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,395 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,395 INFO L423 AbstractCegarLoop]: === Iteration 14 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,396 INFO L82 PathProgramCache]: Analyzing trace with hash -393244830, now seen corresponding path program 1 times [2018-12-03 03:30:41,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,396 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 03:30:41,396 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,400 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,422 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,422 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,422 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:41,422 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 21 with the following transitions: [2018-12-03 03:30:41,423 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [23], [25], [27], [29], [35], [37], [40], [50], [54], [55], [57], [66], [67], [68] [2018-12-03 03:30:41,423 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:30:41,423 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:30:41,473 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:30:41,473 INFO L272 AbstractInterpreter]: Visited 18 different actions 66 times. Merged at 12 different actions 42 times. Widened at 1 different actions 1 times. Performed 277 root evaluator evaluations with a maximum evaluation depth of 3. Performed 277 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 6 fixpoints after 3 different actions. Largest state had 12 variables. [2018-12-03 03:30:41,475 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,475 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:30:41,475 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,475 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:41,484 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,484 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:30:41,490 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,491 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:41,502 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,502 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:41,509 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,523 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:41,523 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 6 [2018-12-03 03:30:41,523 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:41,523 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-03 03:30:41,523 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-03 03:30:41,524 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2018-12-03 03:30:41,524 INFO L87 Difference]: Start difference. First operand 49 states and 60 transitions. Second operand 6 states. [2018-12-03 03:30:41,554 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,554 INFO L93 Difference]: Finished difference Result 82 states and 99 transitions. [2018-12-03 03:30:41,554 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2018-12-03 03:30:41,555 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 20 [2018-12-03 03:30:41,555 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,555 INFO L225 Difference]: With dead ends: 82 [2018-12-03 03:30:41,555 INFO L226 Difference]: Without dead ends: 49 [2018-12-03 03:30:41,555 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 46 GetRequests, 38 SyntacticMatches, 2 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=23, Invalid=33, Unknown=0, NotChecked=0, Total=56 [2018-12-03 03:30:41,556 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 49 states. [2018-12-03 03:30:41,558 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 49 to 49. [2018-12-03 03:30:41,558 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 49 states. [2018-12-03 03:30:41,559 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 49 states to 49 states and 58 transitions. [2018-12-03 03:30:41,559 INFO L78 Accepts]: Start accepts. Automaton has 49 states and 58 transitions. Word has length 20 [2018-12-03 03:30:41,559 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,559 INFO L480 AbstractCegarLoop]: Abstraction has 49 states and 58 transitions. [2018-12-03 03:30:41,559 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-03 03:30:41,559 INFO L276 IsEmpty]: Start isEmpty. Operand 49 states and 58 transitions. [2018-12-03 03:30:41,559 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2018-12-03 03:30:41,560 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,560 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,560 INFO L423 AbstractCegarLoop]: === Iteration 15 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,560 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,560 INFO L82 PathProgramCache]: Analyzing trace with hash -2008661593, now seen corresponding path program 1 times [2018-12-03 03:30:41,560 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,561 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,561 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,561 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,564 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,582 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,582 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,583 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:41,583 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 22 with the following transitions: [2018-12-03 03:30:41,583 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [23], [25], [27], [29], [35], [37], [40], [42], [44], [46], [50], [54], [66], [67], [68] [2018-12-03 03:30:41,584 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:30:41,584 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:30:41,619 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:30:41,619 INFO L272 AbstractInterpreter]: Visited 19 different actions 50 times. Merged at 11 different actions 26 times. Never widened. Performed 201 root evaluator evaluations with a maximum evaluation depth of 3. Performed 201 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 5 fixpoints after 2 different actions. Largest state had 12 variables. [2018-12-03 03:30:41,621 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,621 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:30:41,621 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,621 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:41,628 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,628 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:30:41,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,635 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:41,661 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,661 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:41,676 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,697 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:41,697 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5, 5] total 10 [2018-12-03 03:30:41,697 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:41,698 INFO L459 AbstractCegarLoop]: Interpolant automaton has 10 states [2018-12-03 03:30:41,698 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2018-12-03 03:30:41,698 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:30:41,698 INFO L87 Difference]: Start difference. First operand 49 states and 58 transitions. Second operand 10 states. [2018-12-03 03:30:41,883 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:41,883 INFO L93 Difference]: Finished difference Result 180 states and 212 transitions. [2018-12-03 03:30:41,883 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2018-12-03 03:30:41,884 INFO L78 Accepts]: Start accepts. Automaton has 10 states. Word has length 21 [2018-12-03 03:30:41,884 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:41,884 INFO L225 Difference]: With dead ends: 180 [2018-12-03 03:30:41,884 INFO L226 Difference]: Without dead ends: 179 [2018-12-03 03:30:41,885 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 150 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=220, Invalid=430, Unknown=0, NotChecked=0, Total=650 [2018-12-03 03:30:41,885 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2018-12-03 03:30:41,891 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 91. [2018-12-03 03:30:41,891 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 91 states. [2018-12-03 03:30:41,891 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 110 transitions. [2018-12-03 03:30:41,892 INFO L78 Accepts]: Start accepts. Automaton has 91 states and 110 transitions. Word has length 21 [2018-12-03 03:30:41,892 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:41,892 INFO L480 AbstractCegarLoop]: Abstraction has 91 states and 110 transitions. [2018-12-03 03:30:41,892 INFO L481 AbstractCegarLoop]: Interpolant automaton has 10 states. [2018-12-03 03:30:41,892 INFO L276 IsEmpty]: Start isEmpty. Operand 91 states and 110 transitions. [2018-12-03 03:30:41,892 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2018-12-03 03:30:41,892 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:41,892 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:41,893 INFO L423 AbstractCegarLoop]: === Iteration 16 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:41,893 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:41,893 INFO L82 PathProgramCache]: Analyzing trace with hash 110861006, now seen corresponding path program 2 times [2018-12-03 03:30:41,893 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,894 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:41,894 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:41,894 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:41,897 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:41,920 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2018-12-03 03:30:41,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:41,921 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 03:30:41,921 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 03:30:41,921 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:41,921 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:41,929 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 03:30:41,930 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 03:30:41,934 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-03 03:30:41,934 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 03:30:41,935 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:41,966 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 03:30:41,966 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:41,972 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2018-12-03 03:30:41,996 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:41,996 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2018-12-03 03:30:41,996 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:41,996 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-03 03:30:41,996 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-03 03:30:41,997 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-03 03:30:41,997 INFO L87 Difference]: Start difference. First operand 91 states and 110 transitions. Second operand 7 states. [2018-12-03 03:30:42,056 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:42,056 INFO L93 Difference]: Finished difference Result 184 states and 223 transitions. [2018-12-03 03:30:42,056 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-03 03:30:42,056 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 23 [2018-12-03 03:30:42,057 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:42,057 INFO L225 Difference]: With dead ends: 184 [2018-12-03 03:30:42,057 INFO L226 Difference]: Without dead ends: 183 [2018-12-03 03:30:42,058 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 43 SyntacticMatches, 1 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=45, Invalid=65, Unknown=0, NotChecked=0, Total=110 [2018-12-03 03:30:42,058 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2018-12-03 03:30:42,066 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 54. [2018-12-03 03:30:42,066 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 54 states. [2018-12-03 03:30:42,066 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2018-12-03 03:30:42,067 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 23 [2018-12-03 03:30:42,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:42,067 INFO L480 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2018-12-03 03:30:42,067 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-03 03:30:42,067 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2018-12-03 03:30:42,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2018-12-03 03:30:42,068 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:42,068 INFO L402 BasicCegarLoop]: trace histogram [4, 4, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:42,068 INFO L423 AbstractCegarLoop]: === Iteration 17 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:42,068 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:42,069 INFO L82 PathProgramCache]: Analyzing trace with hash -1816883499, now seen corresponding path program 1 times [2018-12-03 03:30:42,069 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:42,070 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-03 03:30:42,070 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:42,070 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:42,075 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:42,107 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 03:30:42,107 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:42,107 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:42,107 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 38 with the following transitions: [2018-12-03 03:30:42,107 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [23], [25], [27], [29], [35], [37], [40], [42], [44], [46], [50], [54], [55], [57], [66], [67], [68] [2018-12-03 03:30:42,108 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-03 03:30:42,109 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-03 03:30:42,160 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-03 03:30:42,161 INFO L272 AbstractInterpreter]: Visited 21 different actions 88 times. Merged at 15 different actions 56 times. Widened at 2 different actions 2 times. Performed 365 root evaluator evaluations with a maximum evaluation depth of 3. Performed 365 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 12 fixpoints after 4 different actions. Largest state had 12 variables. [2018-12-03 03:30:42,164 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:42,164 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-03 03:30:42,165 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:42,165 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:42,171 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:42,171 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-03 03:30:42,177 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:42,178 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:42,183 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 03:30:42,183 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:42,250 INFO L134 CoverageAnalysis]: Checked inductivity of 31 backedges. 0 proven. 30 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 03:30:42,265 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:42,265 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [8, 8, 8] total 15 [2018-12-03 03:30:42,265 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:42,265 INFO L459 AbstractCegarLoop]: Interpolant automaton has 9 states [2018-12-03 03:30:42,265 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2018-12-03 03:30:42,265 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=72, Invalid=168, Unknown=0, NotChecked=0, Total=240 [2018-12-03 03:30:42,266 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand 9 states. [2018-12-03 03:30:42,386 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:42,386 INFO L93 Difference]: Finished difference Result 150 states and 172 transitions. [2018-12-03 03:30:42,386 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2018-12-03 03:30:42,386 INFO L78 Accepts]: Start accepts. Automaton has 9 states. Word has length 37 [2018-12-03 03:30:42,386 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:42,387 INFO L225 Difference]: With dead ends: 150 [2018-12-03 03:30:42,387 INFO L226 Difference]: Without dead ends: 149 [2018-12-03 03:30:42,388 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 67 SyntacticMatches, 1 SemanticMatches, 25 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 99 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=263, Invalid=439, Unknown=0, NotChecked=0, Total=702 [2018-12-03 03:30:42,388 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 149 states. [2018-12-03 03:30:42,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 149 to 59. [2018-12-03 03:30:42,394 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 59 states. [2018-12-03 03:30:42,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2018-12-03 03:30:42,395 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 37 [2018-12-03 03:30:42,395 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:42,395 INFO L480 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2018-12-03 03:30:42,395 INFO L481 AbstractCegarLoop]: Interpolant automaton has 9 states. [2018-12-03 03:30:42,395 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2018-12-03 03:30:42,396 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2018-12-03 03:30:42,396 INFO L394 BasicCegarLoop]: Found error trace [2018-12-03 03:30:42,396 INFO L402 BasicCegarLoop]: trace histogram [5, 5, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-03 03:30:42,396 INFO L423 AbstractCegarLoop]: === Iteration 18 === [mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-03 03:30:42,396 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-03 03:30:42,396 INFO L82 PathProgramCache]: Analyzing trace with hash 1993669351, now seen corresponding path program 2 times [2018-12-03 03:30:42,396 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-03 03:30:42,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:42,397 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-03 03:30:42,397 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-03 03:30:42,397 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-03 03:30:42,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-03 03:30:42,439 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 46 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2018-12-03 03:30:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:42,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-03 03:30:42,439 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-03 03:30:42,439 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-03 03:30:42,439 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-03 03:30:42,439 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/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-03 03:30:42,447 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-03 03:30:42,447 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-03 03:30:42,453 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2018-12-03 03:30:42,453 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-03 03:30:42,455 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-03 03:30:42,491 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 03:30:42,491 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-03 03:30:42,512 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 0 proven. 20 refuted. 0 times theorem prover too weak. 27 trivial. 0 not checked. [2018-12-03 03:30:42,527 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-03 03:30:42,527 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 4, 4] total 12 [2018-12-03 03:30:42,527 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-03 03:30:42,527 INFO L459 AbstractCegarLoop]: Interpolant automaton has 13 states [2018-12-03 03:30:42,527 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2018-12-03 03:30:42,527 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2018-12-03 03:30:42,527 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand 13 states. [2018-12-03 03:30:42,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-03 03:30:42,809 INFO L93 Difference]: Finished difference Result 199 states and 230 transitions. [2018-12-03 03:30:42,809 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2018-12-03 03:30:42,809 INFO L78 Accepts]: Start accepts. Automaton has 13 states. Word has length 42 [2018-12-03 03:30:42,810 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-03 03:30:42,810 INFO L225 Difference]: With dead ends: 199 [2018-12-03 03:30:42,810 INFO L226 Difference]: Without dead ends: 0 [2018-12-03 03:30:42,811 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 79 SyntacticMatches, 3 SemanticMatches, 35 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 356 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=453, Invalid=879, Unknown=0, NotChecked=0, Total=1332 [2018-12-03 03:30:42,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-03 03:30:42,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-03 03:30:42,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-03 03:30:42,811 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-03 03:30:42,812 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 42 [2018-12-03 03:30:42,812 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-03 03:30:42,812 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-03 03:30:42,812 INFO L481 AbstractCegarLoop]: Interpolant automaton has 13 states. [2018-12-03 03:30:42,812 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-03 03:30:42,812 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-03 03:30:42,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-03 03:30:42,838 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,840 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,870 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,891 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,893 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,906 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,907 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,970 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,971 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,990 WARN L180 SmtUtils]: Spent 101.00 ms on a formula simplification. DAG size of input: 124 DAG size of output: 109 [2018-12-03 03:30:42,992 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,993 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,994 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:42,995 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,003 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,004 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,005 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,007 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,008 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,017 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,018 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,019 WARN L250 erpolLogProxyWrapper]: Already inconsistent. [2018-12-03 03:30:43,251 WARN L180 SmtUtils]: Spent 224.00 ms on a formula simplification. DAG size of input: 91 DAG size of output: 24 [2018-12-03 03:30:43,457 WARN L180 SmtUtils]: Spent 204.00 ms on a formula simplification. DAG size of input: 106 DAG size of output: 19 [2018-12-03 03:30:43,516 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-03 03:30:43,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:30:43,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-03 03:30:43,516 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-03 03:30:43,516 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-03 03:30:43,516 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-03 03:30:43,516 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-03 03:30:43,516 INFO L448 ceAbstractionStarter]: For program point mainErr4ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-12-03 03:30:43,516 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 37) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L444 ceAbstractionStarter]: At program point L23-2(lines 23 34) the Hoare annotation is: (let ((.cse0 (<= main_~n~0 2147483647)) (.cse1 (<= 0 main_~i~0)) (.cse2 (<= main_~N~0 2147483647)) (.cse3 (<= 0 main_~N~0)) (.cse4 (<= main_~m~0 2147483647))) (or (and .cse0 .cse1 .cse2 .cse3 .cse4 (<= main_~i~0 0)) (and (<= 0 main_~j~0) .cse0 .cse1 (<= main_~m~0 main_~j~0) .cse2 .cse3 .cse4))) [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 26) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point L28-1(line 28) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point L28-2(lines 28 30) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point mainErr5ASSERT_VIOLATIONINTEGER_OVERFLOW(line 29) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L444 ceAbstractionStarter]: At program point L28-4(lines 28 30) the Hoare annotation is: (and (<= 0 main_~j~0) (<= main_~n~0 2147483647) (<= 0 main_~i~0) (<= 0 main_~k~0) (<= main_~N~0 2147483647) (<= 0 main_~N~0) (<= main_~m~0 2147483647) (<= main_~k~0 2147483646)) [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point L28-5(lines 28 30) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point L33(line 33) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point mainErr7ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point L29(line 29) no Hoare annotation was computed. [2018-12-03 03:30:43,517 INFO L448 ceAbstractionStarter]: For program point L29-1(line 29) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L444 ceAbstractionStarter]: At program point L25-2(lines 25 32) the Hoare annotation is: (let ((.cse1 (<= 0 main_~j~0)) (.cse2 (<= main_~n~0 2147483647)) (.cse3 (<= 0 main_~i~0)) (.cse4 (<= main_~N~0 2147483647)) (.cse5 (<= main_~i~0 2147483646)) (.cse6 (<= 0 main_~N~0)) (.cse0 (<= main_~m~0 2147483647))) (or (and .cse0 (<= main_~j~0 0) (and .cse1 .cse2 .cse3 .cse4 .cse5 .cse6)) (and (and .cse1 .cse2 .cse3 (<= 0 main_~k~0) .cse4 .cse5 .cse6 (<= main_~k~0 2147483646)) .cse0))) [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point L25-3(lines 25 32) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 35) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point L21-1(lines 21 35) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 37) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point mainErr6ASSERT_VIOLATIONINTEGER_OVERFLOW(line 33) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 37) the Hoare annotation is: true [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point L26(line 26) no Hoare annotation was computed. [2018-12-03 03:30:43,518 INFO L448 ceAbstractionStarter]: For program point L26-1(line 26) no Hoare annotation was computed. [2018-12-03 03:30:43,519 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 28) no Hoare annotation was computed. [2018-12-03 03:30:43,529 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 03.12 03:30:43 BoogieIcfgContainer [2018-12-03 03:30:43,529 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-03 03:30:43,529 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-03 03:30:43,529 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-03 03:30:43,530 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-03 03:30:43,530 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 03.12 03:30:40" (3/4) ... [2018-12-03 03:30:43,533 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-03 03:30:43,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-03 03:30:43,537 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-03 03:30:43,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 7 nodes and edges [2018-12-03 03:30:43,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 4 nodes and edges [2018-12-03 03:30:43,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 03:30:43,540 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-03 03:30:43,570 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_589b214f-d282-46a4-9183-c34c98dc1609/bin-2019/utaipan/witness.graphml [2018-12-03 03:30:43,570 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-03 03:30:43,571 INFO L168 Benchmark]: Toolchain (without parser) took 3538.51 ms. Allocated memory was 1.0 GB in the beginning and 1.2 GB in the end (delta: 142.6 MB). Free memory was 953.3 MB in the beginning and 853.1 MB in the end (delta: 100.2 MB). Peak memory consumption was 242.8 MB. Max. memory is 11.5 GB. [2018-12-03 03:30:43,571 INFO L168 Benchmark]: CDTParser took 0.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:30:43,571 INFO L168 Benchmark]: CACSL2BoogieTranslator took 124.12 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.6 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:30:43,572 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-03 03:30:43,572 INFO L168 Benchmark]: Boogie Preprocessor took 12.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:30:43,572 INFO L168 Benchmark]: RCFGBuilder took 164.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. [2018-12-03 03:30:43,573 INFO L168 Benchmark]: TraceAbstraction took 3181.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 857.8 MB in the end (delta: 220.8 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. [2018-12-03 03:30:43,573 INFO L168 Benchmark]: Witness Printer took 41.02 ms. Allocated memory is still 1.2 GB. Free memory was 857.8 MB in the beginning and 853.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. [2018-12-03 03:30:43,575 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.10 ms. Allocated memory is still 1.0 GB. Free memory is still 979.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 124.12 ms. Allocated memory is still 1.0 GB. Free memory was 953.3 MB in the beginning and 942.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 11.84 ms. Allocated memory is still 1.0 GB. Free memory is still 942.6 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 12.44 ms. Allocated memory is still 1.0 GB. Free memory was 942.6 MB in the beginning and 939.9 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * RCFGBuilder took 164.58 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 95.9 MB). Free memory was 939.9 MB in the beginning and 1.1 GB in the end (delta: -138.7 MB). Peak memory consumption was 12.8 MB. Max. memory is 11.5 GB. * TraceAbstraction took 3181.50 ms. Allocated memory was 1.1 GB in the beginning and 1.2 GB in the end (delta: 46.7 MB). Free memory was 1.1 GB in the beginning and 857.8 MB in the end (delta: 220.8 MB). Peak memory consumption was 267.5 MB. Max. memory is 11.5 GB. * Witness Printer took 41.02 ms. Allocated memory is still 1.2 GB. Free memory was 857.8 MB in the beginning and 853.1 MB in the end (delta: 4.7 MB). Peak memory consumption was 4.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 29]: 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: 26]: 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 - PositiveResult [Line: 29]: 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 - PositiveResult [Line: 33]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 8 specifications checked. All of them hold - InvariantResult [Line: 25]: Loop Invariant Derived loop invariant: ((m <= 2147483647 && j <= 0) && ((((0 <= j && n <= 2147483647) && 0 <= i) && N <= 2147483647) && i <= 2147483646) && 0 <= N) || ((((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && N <= 2147483647) && i <= 2147483646) && 0 <= N) && k <= 2147483646) && m <= 2147483647) - InvariantResult [Line: 28]: Loop Invariant Derived loop invariant: ((((((0 <= j && n <= 2147483647) && 0 <= i) && 0 <= k) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && k <= 2147483646 - InvariantResult [Line: 23]: Loop Invariant Derived loop invariant: (((((n <= 2147483647 && 0 <= i) && N <= 2147483647) && 0 <= N) && m <= 2147483647) && i <= 0) || ((((((0 <= j && n <= 2147483647) && 0 <= i) && m <= j) && N <= 2147483647) && 0 <= N) && m <= 2147483647) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 31 locations, 8 error locations. SAFE Result, 3.1s OverallTime, 18 OverallIterations, 5 TraceHistogramMax, 0.9s AutomataDifference, 0.0s DeadEndRemovalTime, 0.7s HoareAnnotationTime, HoareTripleCheckerStatistics: 351 SDtfs, 862 SDslu, 607 SDs, 0 SdLazy, 554 SolverSat, 203 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.3s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 500 GetRequests, 359 SyntacticMatches, 10 SemanticMatches, 131 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 628 ImplicationChecksByTransitivity, 0.7s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=91occurred in iteration=15, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.2s AbstIntTime, 5 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 18 MinimizatonAttempts, 434 StatesRemovedByMinimization, 11 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 7 LocationsWithAnnotation, 7 PreInvPairs, 58 NumberOfFragments, 128 HoareAnnotationTreeSize, 7 FomulaSimplifications, 513377 FormulaSimplificationTreeSizeReduction, 0.2s HoareSimplificationTime, 7 FomulaSimplificationsInter, 111982 FormulaSimplificationTreeSizeReductionInter, 0.4s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.6s InterpolantComputationTime, 493 NumberOfCodeBlocks, 449 NumberOfCodeBlocksAsserted, 27 NumberOfCheckSat, 648 ConstructedInterpolants, 0 QuantifiedInterpolants, 39718 SizeOfPredicates, 21 NumberOfNonLiveVariables, 477 ConjunctsInSsa, 38 ConjunctsInUnsatCore, 34 InterpolantComputations, 10 PerfectInterpolantSequences, 101/340 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...