./Ultimate.py --spec ../../sv-benchmarks/c/properties/no-overflow.prp --file ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_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_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/data/config -Xmx12G -Xms1G -jar /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/plugins/org.eclipse.equinox.launcher_1.3.100.v20150511-1540.jar -data @noDefault -ultimatedata /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/data -tc /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/config/TaipanReach.xml -i ../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c -s /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/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 500cb8735f650eb0e7c33062ddc23c2166b17f19 ......................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................... Execution finished normally Writing output log to file Ultimate.log Result: TRUE --- Real Ultimate output --- This is Ultimate 0.1.23-635dfa2 [2018-12-09 15:14:06,364 INFO L170 SettingsManager]: Resetting all preferences to default values... [2018-12-09 15:14:06,365 INFO L174 SettingsManager]: Resetting UltimateCore preferences to default values [2018-12-09 15:14:06,371 INFO L177 SettingsManager]: Ultimate Commandline Interface provides no preferences, ignoring... [2018-12-09 15:14:06,371 INFO L174 SettingsManager]: Resetting Boogie Preprocessor preferences to default values [2018-12-09 15:14:06,372 INFO L174 SettingsManager]: Resetting Boogie Procedure Inliner preferences to default values [2018-12-09 15:14:06,372 INFO L174 SettingsManager]: Resetting Abstract Interpretation preferences to default values [2018-12-09 15:14:06,373 INFO L174 SettingsManager]: Resetting LassoRanker preferences to default values [2018-12-09 15:14:06,374 INFO L174 SettingsManager]: Resetting Reaching Definitions preferences to default values [2018-12-09 15:14:06,374 INFO L174 SettingsManager]: Resetting SyntaxChecker preferences to default values [2018-12-09 15:14:06,375 INFO L177 SettingsManager]: Büchi Program Product provides no preferences, ignoring... [2018-12-09 15:14:06,375 INFO L174 SettingsManager]: Resetting LTL2Aut preferences to default values [2018-12-09 15:14:06,375 INFO L174 SettingsManager]: Resetting PEA to Boogie preferences to default values [2018-12-09 15:14:06,376 INFO L174 SettingsManager]: Resetting BlockEncodingV2 preferences to default values [2018-12-09 15:14:06,376 INFO L174 SettingsManager]: Resetting ChcToBoogie preferences to default values [2018-12-09 15:14:06,377 INFO L174 SettingsManager]: Resetting AutomataScriptInterpreter preferences to default values [2018-12-09 15:14:06,377 INFO L174 SettingsManager]: Resetting BuchiAutomizer preferences to default values [2018-12-09 15:14:06,378 INFO L174 SettingsManager]: Resetting CACSL2BoogieTranslator preferences to default values [2018-12-09 15:14:06,379 INFO L174 SettingsManager]: Resetting CodeCheck preferences to default values [2018-12-09 15:14:06,380 INFO L174 SettingsManager]: Resetting InvariantSynthesis preferences to default values [2018-12-09 15:14:06,380 INFO L174 SettingsManager]: Resetting RCFGBuilder preferences to default values [2018-12-09 15:14:06,381 INFO L174 SettingsManager]: Resetting TraceAbstraction preferences to default values [2018-12-09 15:14:06,382 INFO L177 SettingsManager]: TraceAbstractionConcurrent provides no preferences, ignoring... [2018-12-09 15:14:06,382 INFO L177 SettingsManager]: TraceAbstractionWithAFAs provides no preferences, ignoring... [2018-12-09 15:14:06,382 INFO L174 SettingsManager]: Resetting TreeAutomizer preferences to default values [2018-12-09 15:14:06,382 INFO L174 SettingsManager]: Resetting IcfgTransformer preferences to default values [2018-12-09 15:14:06,383 INFO L174 SettingsManager]: Resetting Boogie Printer preferences to default values [2018-12-09 15:14:06,383 INFO L174 SettingsManager]: Resetting ReqPrinter preferences to default values [2018-12-09 15:14:06,384 INFO L174 SettingsManager]: Resetting Witness Printer preferences to default values [2018-12-09 15:14:06,384 INFO L177 SettingsManager]: Boogie PL CUP Parser provides no preferences, ignoring... [2018-12-09 15:14:06,384 INFO L174 SettingsManager]: Resetting CDTParser preferences to default values [2018-12-09 15:14:06,385 INFO L177 SettingsManager]: AutomataScriptParser provides no preferences, ignoring... [2018-12-09 15:14:06,385 INFO L177 SettingsManager]: ReqParser provides no preferences, ignoring... [2018-12-09 15:14:06,385 INFO L174 SettingsManager]: Resetting SmtParser preferences to default values [2018-12-09 15:14:06,385 INFO L174 SettingsManager]: Resetting Witness Parser preferences to default values [2018-12-09 15:14:06,386 INFO L181 SettingsManager]: Finished resetting all preferences to default values... [2018-12-09 15:14:06,386 INFO L98 SettingsManager]: Beginning loading settings from /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/config/svcomp-Overflow-64bit-Taipan_Default.epf [2018-12-09 15:14:06,393 INFO L110 SettingsManager]: Loading preferences was successful [2018-12-09 15:14:06,393 INFO L112 SettingsManager]: Preferences different from defaults after loading the file: [2018-12-09 15:14:06,393 INFO L131 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2018-12-09 15:14:06,393 INFO L133 SettingsManager]: * ... calls to implemented procedures=ONLY_FOR_CONCURRENT_PROGRAMS [2018-12-09 15:14:06,393 INFO L133 SettingsManager]: * User list type=DISABLED [2018-12-09 15:14:06,393 INFO L131 SettingsManager]: Preferences of Abstract Interpretation differ from their defaults: [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Explicit value domain=true [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Abstract domain for RCFG-of-the-future=PoormanAbstractDomain [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Octagon Domain=false [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Abstract domain=CompoundDomain [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Check feasibility of abstract posts with an SMT solver=true [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Use the RCFG-of-the-future interface=true [2018-12-09 15:14:06,394 INFO L133 SettingsManager]: * Interval Domain=false [2018-12-09 15:14:06,394 INFO L131 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2018-12-09 15:14:06,395 INFO L133 SettingsManager]: * Check unreachability of error function in SV-COMP mode=false [2018-12-09 15:14:06,395 INFO L133 SettingsManager]: * Overapproximate operations on floating types=true [2018-12-09 15:14:06,395 INFO L133 SettingsManager]: * Check division by zero=IGNORE [2018-12-09 15:14:06,395 INFO L133 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2018-12-09 15:14:06,395 INFO L133 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2018-12-09 15:14:06,395 INFO L133 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2018-12-09 15:14:06,396 INFO L133 SettingsManager]: * Check absence of signed integer overflows=true [2018-12-09 15:14:06,396 INFO L133 SettingsManager]: * Check if freed pointer was valid=false [2018-12-09 15:14:06,396 INFO L133 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2018-12-09 15:14:06,396 INFO L131 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2018-12-09 15:14:06,396 INFO L133 SettingsManager]: * Size of a code block=SequenceOfStatements [2018-12-09 15:14:06,396 INFO L133 SettingsManager]: * To the following directory=./dump/ [2018-12-09 15:14:06,397 INFO L133 SettingsManager]: * SMT solver=External_DefaultMode [2018-12-09 15:14:06,397 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2018-12-09 15:14:06,397 INFO L131 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2018-12-09 15:14:06,397 INFO L133 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2018-12-09 15:14:06,397 INFO L133 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopsAndPotentialCycles [2018-12-09 15:14:06,397 INFO L133 SettingsManager]: * Trace refinement strategy=TAIPAN [2018-12-09 15:14:06,397 INFO L133 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2018-12-09 15:14:06,398 INFO L133 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2018-12-09 15:14:06,398 INFO L133 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2018-12-09 15:14:06,398 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_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/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 -> 500cb8735f650eb0e7c33062ddc23c2166b17f19 [2018-12-09 15:14:06,421 INFO L81 nceAwareModelManager]: Repository-Root is: /tmp [2018-12-09 15:14:06,428 INFO L258 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2018-12-09 15:14:06,430 INFO L214 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2018-12-09 15:14:06,431 INFO L271 PluginConnector]: Initializing CDTParser... [2018-12-09 15:14:06,431 INFO L276 PluginConnector]: CDTParser initialized [2018-12-09 15:14:06,432 INFO L418 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/../../sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c [2018-12-09 15:14:06,470 INFO L221 CDTParser]: Created temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/data/949bd09b8/22170f64ebdf4fc090ac7045adb12d68/FLAGdd614254e [2018-12-09 15:14:06,863 INFO L307 CDTParser]: Found 1 translation units. [2018-12-09 15:14:06,864 INFO L161 CDTParser]: Scanning /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/sv-benchmarks/c/termination-crafted-lit/AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c [2018-12-09 15:14:06,867 INFO L355 CDTParser]: About to delete temporary CDT project at /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/data/949bd09b8/22170f64ebdf4fc090ac7045adb12d68/FLAGdd614254e [2018-12-09 15:14:06,875 INFO L363 CDTParser]: Successfully deleted /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/data/949bd09b8/22170f64ebdf4fc090ac7045adb12d68 [2018-12-09 15:14:06,877 INFO L296 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2018-12-09 15:14:06,878 INFO L131 ToolchainWalker]: Walking toolchain with 6 elements. [2018-12-09 15:14:06,878 INFO L113 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2018-12-09 15:14:06,879 INFO L271 PluginConnector]: Initializing CACSL2BoogieTranslator... [2018-12-09 15:14:06,881 INFO L276 PluginConnector]: CACSL2BoogieTranslator initialized [2018-12-09 15:14:06,881 INFO L185 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:14:06" (1/1) ... [2018-12-09 15:14:06,883 INFO L205 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@42aa496 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:06, skipping insertion in model container [2018-12-09 15:14:06,883 INFO L185 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 09.12 03:14:06" (1/1) ... [2018-12-09 15:14:06,887 INFO L145 MainTranslator]: Starting translation in SV-COMP mode [2018-12-09 15:14:06,897 INFO L176 MainTranslator]: Built tables and reachable declarations [2018-12-09 15:14:06,985 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:14:06,987 INFO L191 MainTranslator]: Completed pre-run [2018-12-09 15:14:06,996 INFO L203 PostProcessor]: Analyzing one entry point: main [2018-12-09 15:14:07,004 INFO L195 MainTranslator]: Completed translation [2018-12-09 15:14:07,004 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07 WrapperNode [2018-12-09 15:14:07,004 INFO L132 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2018-12-09 15:14:07,004 INFO L113 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2018-12-09 15:14:07,005 INFO L271 PluginConnector]: Initializing Boogie Procedure Inliner... [2018-12-09 15:14:07,005 INFO L276 PluginConnector]: Boogie Procedure Inliner initialized [2018-12-09 15:14:07,009 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,012 INFO L185 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,016 INFO L132 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2018-12-09 15:14:07,016 INFO L113 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2018-12-09 15:14:07,016 INFO L271 PluginConnector]: Initializing Boogie Preprocessor... [2018-12-09 15:14:07,016 INFO L276 PluginConnector]: Boogie Preprocessor initialized [2018-12-09 15:14:07,021 INFO L185 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,021 INFO L185 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,022 INFO L185 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,022 INFO L185 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,024 INFO L185 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,027 INFO L185 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,027 INFO L185 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... [2018-12-09 15:14:07,028 INFO L132 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2018-12-09 15:14:07,028 INFO L113 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2018-12-09 15:14:07,028 INFO L271 PluginConnector]: Initializing RCFGBuilder... [2018-12-09 15:14:07,028 INFO L276 PluginConnector]: RCFGBuilder initialized [2018-12-09 15:14:07,029 INFO L185 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (1/1) ... No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/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-09 15:14:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.init [2018-12-09 15:14:07,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.init [2018-12-09 15:14:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2018-12-09 15:14:07,088 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2018-12-09 15:14:07,088 INFO L130 BoogieDeclarations]: Found specification of procedure main [2018-12-09 15:14:07,088 INFO L138 BoogieDeclarations]: Found implementation of procedure main [2018-12-09 15:14:07,174 INFO L275 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2018-12-09 15:14:07,174 INFO L280 CfgBuilder]: Removed 1 assue(true) statements. [2018-12-09 15:14:07,174 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:14:07 BoogieIcfgContainer [2018-12-09 15:14:07,174 INFO L132 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2018-12-09 15:14:07,175 INFO L113 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2018-12-09 15:14:07,175 INFO L271 PluginConnector]: Initializing TraceAbstraction... [2018-12-09 15:14:07,177 INFO L276 PluginConnector]: TraceAbstraction initialized [2018-12-09 15:14:07,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 09.12 03:14:06" (1/3) ... [2018-12-09 15:14:07,177 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e7a49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:14:07, skipping insertion in model container [2018-12-09 15:14:07,177 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 09.12 03:14:07" (2/3) ... [2018-12-09 15:14:07,178 INFO L205 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@73e7a49a and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 09.12 03:14:07, skipping insertion in model container [2018-12-09 15:14:07,178 INFO L185 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:14:07" (3/3) ... [2018-12-09 15:14:07,179 INFO L112 eAbstractionObserver]: Analyzing ICFG AliasDarteFeautrierGonnord-SAS2010-speedpldi3_true-termination_true-no-overflow.c [2018-12-09 15:14:07,184 INFO L156 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2018-12-09 15:14:07,189 INFO L168 ceAbstractionStarter]: Appying trace abstraction to program that has 4 error locations. [2018-12-09 15:14:07,199 INFO L257 AbstractCegarLoop]: Starting to check reachability of 4 error locations. [2018-12-09 15:14:07,217 INFO L382 AbstractCegarLoop]: Interprodecural is true [2018-12-09 15:14:07,217 INFO L383 AbstractCegarLoop]: Hoare is true [2018-12-09 15:14:07,217 INFO L384 AbstractCegarLoop]: Compute interpolants for FPandBP [2018-12-09 15:14:07,217 INFO L385 AbstractCegarLoop]: Backedges is STRAIGHT_LINE [2018-12-09 15:14:07,217 INFO L386 AbstractCegarLoop]: Determinization is PREDICATE_ABSTRACTION [2018-12-09 15:14:07,217 INFO L387 AbstractCegarLoop]: Difference is false [2018-12-09 15:14:07,218 INFO L388 AbstractCegarLoop]: Minimize is MINIMIZE_SEVPA [2018-12-09 15:14:07,218 INFO L393 AbstractCegarLoop]: ======== Iteration 0==of CEGAR loop == AllErrorsAtOnce======== [2018-12-09 15:14:07,228 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states. [2018-12-09 15:14:07,231 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 15:14:07,231 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,231 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,233 INFO L423 AbstractCegarLoop]: === Iteration 1 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,236 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,236 INFO L82 PathProgramCache]: Analyzing trace with hash 350361843, now seen corresponding path program 1 times [2018-12-09 15:14:07,237 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,269 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,270 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,270 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,270 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,320 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-09 15:14:07,321 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:14:07,321 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:14:07,321 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:14:07,324 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:14:07,331 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:14:07,331 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:14:07,333 INFO L87 Difference]: Start difference. First operand 21 states. Second operand 3 states. [2018-12-09 15:14:07,372 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,373 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-09 15:14:07,373 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:14:07,374 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 15:14:07,375 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,380 INFO L225 Difference]: With dead ends: 34 [2018-12-09 15:14:07,380 INFO L226 Difference]: Without dead ends: 20 [2018-12-09 15:14:07,382 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-09 15:14:07,391 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-09 15:14:07,400 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 19. [2018-12-09 15:14:07,400 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 19 states. [2018-12-09 15:14:07,401 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 21 transitions. [2018-12-09 15:14:07,402 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 21 transitions. Word has length 9 [2018-12-09 15:14:07,402 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,402 INFO L480 AbstractCegarLoop]: Abstraction has 19 states and 21 transitions. [2018-12-09 15:14:07,402 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:14:07,402 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 21 transitions. [2018-12-09 15:14:07,402 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2018-12-09 15:14:07,402 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,402 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,403 INFO L423 AbstractCegarLoop]: === Iteration 2 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,403 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,403 INFO L82 PathProgramCache]: Analyzing trace with hash 350362035, now seen corresponding path program 1 times [2018-12-09 15:14:07,403 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,404 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,404 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,404 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,407 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,418 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-09 15:14:07,418 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:14:07,418 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2018-12-09 15:14:07,418 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:14:07,419 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:14:07,419 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:14:07,419 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:14:07,420 INFO L87 Difference]: Start difference. First operand 19 states and 21 transitions. Second operand 3 states. [2018-12-09 15:14:07,435 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,435 INFO L93 Difference]: Finished difference Result 34 states and 39 transitions. [2018-12-09 15:14:07,435 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:14:07,435 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 9 [2018-12-09 15:14:07,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,436 INFO L225 Difference]: With dead ends: 34 [2018-12-09 15:14:07,436 INFO L226 Difference]: Without dead ends: 21 [2018-12-09 15:14:07,436 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:14:07,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2018-12-09 15:14:07,438 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 21. [2018-12-09 15:14:07,438 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 21 states. [2018-12-09 15:14:07,439 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 21 states to 21 states and 23 transitions. [2018-12-09 15:14:07,439 INFO L78 Accepts]: Start accepts. Automaton has 21 states and 23 transitions. Word has length 9 [2018-12-09 15:14:07,439 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,439 INFO L480 AbstractCegarLoop]: Abstraction has 21 states and 23 transitions. [2018-12-09 15:14:07,439 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:14:07,439 INFO L276 IsEmpty]: Start isEmpty. Operand 21 states and 23 transitions. [2018-12-09 15:14:07,439 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2018-12-09 15:14:07,440 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,440 INFO L402 BasicCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,440 INFO L423 AbstractCegarLoop]: === Iteration 3 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,440 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,440 INFO L82 PathProgramCache]: Analyzing trace with hash -2023684702, now seen corresponding path program 1 times [2018-12-09 15:14:07,440 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,441 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,441 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,441 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,446 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,455 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-09 15:14:07,456 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:14:07,456 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:14:07,456 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:14:07,456 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:14:07,456 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:14:07,456 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:14:07,456 INFO L87 Difference]: Start difference. First operand 21 states and 23 transitions. Second operand 3 states. [2018-12-09 15:14:07,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,465 INFO L93 Difference]: Finished difference Result 21 states and 23 transitions. [2018-12-09 15:14:07,465 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:14:07,466 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 10 [2018-12-09 15:14:07,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,466 INFO L225 Difference]: With dead ends: 21 [2018-12-09 15:14:07,466 INFO L226 Difference]: Without dead ends: 20 [2018-12-09 15:14:07,466 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-09 15:14:07,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2018-12-09 15:14:07,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2018-12-09 15:14:07,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 15:14:07,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-09 15:14:07,469 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 10 [2018-12-09 15:14:07,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,469 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-09 15:14:07,469 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:14:07,469 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-09 15:14:07,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 15:14:07,469 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,469 INFO L402 BasicCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,470 INFO L423 AbstractCegarLoop]: === Iteration 4 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,470 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,470 INFO L82 PathProgramCache]: Analyzing trace with hash 865022446, now seen corresponding path program 1 times [2018-12-09 15:14:07,470 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,471 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,471 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,471 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,475 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,493 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-09 15:14:07,493 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:07,493 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:14:07,494 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 14 with the following transitions: [2018-12-09 15:14:07,495 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [19], [20], [21], [23], [39], [40], [41] [2018-12-09 15:14:07,513 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:14:07,513 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:14:07,598 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:14:07,599 INFO L272 AbstractInterpreter]: Visited 11 different actions 26 times. Merged at 4 different actions 12 times. Never widened. Performed 92 root evaluator evaluations with a maximum evaluation depth of 3. Performed 92 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 2 fixpoints after 2 different actions. Largest state had 6 variables. [2018-12-09 15:14:07,605 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,606 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:14:07,606 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:07,606 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/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-09 15:14:07,612 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,612 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:14:07,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,623 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:14:07,634 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-09 15:14:07,634 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:14:07,653 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-09 15:14:07,667 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:14:07,667 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2018-12-09 15:14:07,668 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:14:07,668 INFO L459 AbstractCegarLoop]: Interpolant automaton has 4 states [2018-12-09 15:14:07,668 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2018-12-09 15:14:07,668 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2018-12-09 15:14:07,668 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 4 states. [2018-12-09 15:14:07,690 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,690 INFO L93 Difference]: Finished difference Result 26 states and 29 transitions. [2018-12-09 15:14:07,690 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2018-12-09 15:14:07,690 INFO L78 Accepts]: Start accepts. Automaton has 4 states. Word has length 13 [2018-12-09 15:14:07,690 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,691 INFO L225 Difference]: With dead ends: 26 [2018-12-09 15:14:07,691 INFO L226 Difference]: Without dead ends: 25 [2018-12-09 15:14:07,691 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-09 15:14:07,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 25 states. [2018-12-09 15:14:07,693 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 25 to 24. [2018-12-09 15:14:07,693 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2018-12-09 15:14:07,694 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 27 transitions. [2018-12-09 15:14:07,694 INFO L78 Accepts]: Start accepts. Automaton has 24 states and 27 transitions. Word has length 13 [2018-12-09 15:14:07,694 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,694 INFO L480 AbstractCegarLoop]: Abstraction has 24 states and 27 transitions. [2018-12-09 15:14:07,694 INFO L481 AbstractCegarLoop]: Interpolant automaton has 4 states. [2018-12-09 15:14:07,694 INFO L276 IsEmpty]: Start isEmpty. Operand 24 states and 27 transitions. [2018-12-09 15:14:07,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2018-12-09 15:14:07,694 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,694 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,695 INFO L423 AbstractCegarLoop]: === Iteration 5 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,695 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,695 INFO L82 PathProgramCache]: Analyzing trace with hash 865022638, now seen corresponding path program 1 times [2018-12-09 15:14:07,695 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,696 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,696 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,696 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,699 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:14:07,713 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:14:07,713 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:14:07,713 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:14:07,713 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:14:07,713 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:14:07,713 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:14:07,714 INFO L87 Difference]: Start difference. First operand 24 states and 27 transitions. Second operand 3 states. [2018-12-09 15:14:07,724 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,724 INFO L93 Difference]: Finished difference Result 37 states and 43 transitions. [2018-12-09 15:14:07,724 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:14:07,724 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 13 [2018-12-09 15:14:07,725 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,725 INFO L225 Difference]: With dead ends: 37 [2018-12-09 15:14:07,725 INFO L226 Difference]: Without dead ends: 36 [2018-12-09 15:14:07,726 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-09 15:14:07,726 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2018-12-09 15:14:07,729 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 34. [2018-12-09 15:14:07,729 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 34 states. [2018-12-09 15:14:07,730 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 40 transitions. [2018-12-09 15:14:07,730 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 40 transitions. Word has length 13 [2018-12-09 15:14:07,730 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,730 INFO L480 AbstractCegarLoop]: Abstraction has 34 states and 40 transitions. [2018-12-09 15:14:07,730 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:14:07,731 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 40 transitions. [2018-12-09 15:14:07,731 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2018-12-09 15:14:07,731 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,731 INFO L402 BasicCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,731 INFO L423 AbstractCegarLoop]: === Iteration 6 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,732 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,732 INFO L82 PathProgramCache]: Analyzing trace with hash 1045898061, now seen corresponding path program 1 times [2018-12-09 15:14:07,732 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,733 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,733 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,733 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,750 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:14:07,751 INFO L312 seRefinementStrategy]: Constructing automaton from 1 perfect and 0 imperfect interpolant sequences. [2018-12-09 15:14:07,751 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2018-12-09 15:14:07,751 INFO L256 anRefinementStrategy]: Using the first perfect interpolant sequence [2018-12-09 15:14:07,751 INFO L459 AbstractCegarLoop]: Interpolant automaton has 3 states [2018-12-09 15:14:07,751 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2018-12-09 15:14:07,751 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2018-12-09 15:14:07,752 INFO L87 Difference]: Start difference. First operand 34 states and 40 transitions. Second operand 3 states. [2018-12-09 15:14:07,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,762 INFO L93 Difference]: Finished difference Result 34 states and 40 transitions. [2018-12-09 15:14:07,762 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2018-12-09 15:14:07,762 INFO L78 Accepts]: Start accepts. Automaton has 3 states. Word has length 14 [2018-12-09 15:14:07,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,763 INFO L225 Difference]: With dead ends: 34 [2018-12-09 15:14:07,763 INFO L226 Difference]: Without dead ends: 33 [2018-12-09 15:14:07,763 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-09 15:14:07,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 33 states. [2018-12-09 15:14:07,767 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 33 to 33. [2018-12-09 15:14:07,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 33 states. [2018-12-09 15:14:07,767 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 33 states to 33 states and 39 transitions. [2018-12-09 15:14:07,768 INFO L78 Accepts]: Start accepts. Automaton has 33 states and 39 transitions. Word has length 14 [2018-12-09 15:14:07,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,768 INFO L480 AbstractCegarLoop]: Abstraction has 33 states and 39 transitions. [2018-12-09 15:14:07,768 INFO L481 AbstractCegarLoop]: Interpolant automaton has 3 states. [2018-12-09 15:14:07,768 INFO L276 IsEmpty]: Start isEmpty. Operand 33 states and 39 transitions. [2018-12-09 15:14:07,768 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:14:07,769 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,769 INFO L402 BasicCegarLoop]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,769 INFO L423 AbstractCegarLoop]: === Iteration 7 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,769 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,769 INFO L82 PathProgramCache]: Analyzing trace with hash -1816046231, now seen corresponding path program 2 times [2018-12-09 15:14:07,769 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,770 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:07,770 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,771 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,776 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,802 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-09 15:14:07,802 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:07,802 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:14:07,803 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:14:07,803 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:14:07,803 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:07,803 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/z3 Starting monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 (exit command is (exit), workingDir is null) Waiting until toolchain timeout for monitored process 3 with z3 -smt2 -in SMTLIB2_COMPLIANT=true -t:12000 [2018-12-09 15:14:07,809 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:14:07,810 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:14:07,814 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 15:14:07,814 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:14:07,815 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:14:07,836 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 15:14:07,837 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:14:07,864 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2018-12-09 15:14:07,877 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:14:07,878 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 10 [2018-12-09 15:14:07,878 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:14:07,878 INFO L459 AbstractCegarLoop]: Interpolant automaton has 8 states [2018-12-09 15:14:07,878 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2018-12-09 15:14:07,878 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=79, Unknown=0, NotChecked=0, Total=110 [2018-12-09 15:14:07,879 INFO L87 Difference]: Start difference. First operand 33 states and 39 transitions. Second operand 8 states. [2018-12-09 15:14:07,934 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:07,934 INFO L93 Difference]: Finished difference Result 47 states and 59 transitions. [2018-12-09 15:14:07,934 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:14:07,934 INFO L78 Accepts]: Start accepts. Automaton has 8 states. Word has length 17 [2018-12-09 15:14:07,934 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:07,936 INFO L225 Difference]: With dead ends: 47 [2018-12-09 15:14:07,936 INFO L226 Difference]: Without dead ends: 46 [2018-12-09 15:14:07,936 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 23 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=85, Invalid=155, Unknown=0, NotChecked=0, Total=240 [2018-12-09 15:14:07,936 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 46 states. [2018-12-09 15:14:07,938 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 46 to 20. [2018-12-09 15:14:07,938 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2018-12-09 15:14:07,939 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 22 transitions. [2018-12-09 15:14:07,939 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 22 transitions. Word has length 17 [2018-12-09 15:14:07,939 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:07,939 INFO L480 AbstractCegarLoop]: Abstraction has 20 states and 22 transitions. [2018-12-09 15:14:07,939 INFO L481 AbstractCegarLoop]: Interpolant automaton has 8 states. [2018-12-09 15:14:07,939 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 22 transitions. [2018-12-09 15:14:07,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2018-12-09 15:14:07,940 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:07,940 INFO L402 BasicCegarLoop]: trace histogram [3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:07,940 INFO L423 AbstractCegarLoop]: === Iteration 8 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:07,940 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:07,940 INFO L82 PathProgramCache]: Analyzing trace with hash -1638551261, now seen corresponding path program 1 times [2018-12-09 15:14:07,940 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,941 INFO L101 rtionOrderModulation]: Changing assertion order to NOT_INCREMENTALLY [2018-12-09 15:14:07,941 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:07,941 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:07,944 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:07,959 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:14:07,959 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:07,960 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:14:07,960 INFO L203 CegarAbsIntRunner]: Running AI on error trace of length 18 with the following transitions: [2018-12-09 15:14:07,960 INFO L205 CegarAbsIntRunner]: [0], [4], [7], [16], [19], [21], [23], [25], [26], [27], [29], [39], [40], [41] [2018-12-09 15:14:07,960 INFO L148 AbstractInterpreter]: Using domain PoormanAbstractDomain with backing domain CompoundDomain [CongruenceDomain, ExplicitValueDomain] [2018-12-09 15:14:07,961 INFO L101 FixpointEngine]: Starting fixpoint engine with domain PoormanAbstractDomain (maxUnwinding=3, maxParallelStates=2) [2018-12-09 15:14:08,000 INFO L263 AbstractInterpreter]: Some error location(s) were reachable [2018-12-09 15:14:08,000 INFO L272 AbstractInterpreter]: Visited 14 different actions 42 times. Merged at 7 different actions 22 times. Widened at 1 different actions 1 times. Performed 182 root evaluator evaluations with a maximum evaluation depth of 3. Performed 182 inverse root evaluator evaluations with a maximum inverse evaluation depth of 3. Found 7 fixpoints after 3 different actions. Largest state had 6 variables. [2018-12-09 15:14:08,002 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:08,002 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: Unknown [2018-12-09 15:14:08,002 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:08,003 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/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-09 15:14:08,009 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:08,009 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: FPandBP) [2018-12-09 15:14:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:08,015 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:14:08,033 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:14:08,033 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:14:08,048 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2018-12-09 15:14:08,071 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:14:08,072 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 8 [2018-12-09 15:14:08,072 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:14:08,072 INFO L459 AbstractCegarLoop]: Interpolant automaton has 6 states [2018-12-09 15:14:08,072 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2018-12-09 15:14:08,072 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=19, Invalid=37, Unknown=0, NotChecked=0, Total=56 [2018-12-09 15:14:08,072 INFO L87 Difference]: Start difference. First operand 20 states and 22 transitions. Second operand 6 states. [2018-12-09 15:14:08,139 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:08,140 INFO L93 Difference]: Finished difference Result 38 states and 45 transitions. [2018-12-09 15:14:08,140 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2018-12-09 15:14:08,140 INFO L78 Accepts]: Start accepts. Automaton has 6 states. Word has length 17 [2018-12-09 15:14:08,140 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:08,140 INFO L225 Difference]: With dead ends: 38 [2018-12-09 15:14:08,141 INFO L226 Difference]: Without dead ends: 31 [2018-12-09 15:14:08,141 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 42 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=58, Invalid=98, Unknown=0, NotChecked=0, Total=156 [2018-12-09 15:14:08,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 31 states. [2018-12-09 15:14:08,145 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 31 to 30. [2018-12-09 15:14:08,145 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 30 states. [2018-12-09 15:14:08,146 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2018-12-09 15:14:08,146 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 17 [2018-12-09 15:14:08,146 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:08,146 INFO L480 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2018-12-09 15:14:08,146 INFO L481 AbstractCegarLoop]: Interpolant automaton has 6 states. [2018-12-09 15:14:08,146 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2018-12-09 15:14:08,147 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2018-12-09 15:14:08,147 INFO L394 BasicCegarLoop]: Found error trace [2018-12-09 15:14:08,147 INFO L402 BasicCegarLoop]: trace histogram [6, 3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2018-12-09 15:14:08,147 INFO L423 AbstractCegarLoop]: === Iteration 9 === [mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW, mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW]=== [2018-12-09 15:14:08,148 INFO L141 PredicateUnifier]: Initialized classic predicate unifier [2018-12-09 15:14:08,148 INFO L82 PathProgramCache]: Analyzing trace with hash -1197112946, now seen corresponding path program 2 times [2018-12-09 15:14:08,148 INFO L69 tionRefinementEngine]: Using refinement strategy TaipanRefinementStrategy [2018-12-09 15:14:08,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:08,149 INFO L103 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2018-12-09 15:14:08,149 INFO L119 rtionOrderModulation]: Craig_TreeInterpolation forces the order to NOT_INCREMENTALLY [2018-12-09 15:14:08,149 INFO L286 anRefinementStrategy]: Using traceCheck mode SMTINTERPOL with AssertCodeBlockOrder NOT_INCREMENTALLY (IT: Craig_TreeInterpolation) [2018-12-09 15:14:08,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2018-12-09 15:14:08,179 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 34 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2018-12-09 15:14:08,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:08,180 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode ABSTRACT_INTERPRETATION [2018-12-09 15:14:08,180 INFO L187 CegarAbsIntRunner]: Skipping current iteration for AI because we have already analyzed this path program [2018-12-09 15:14:08,180 INFO L422 seRefinementStrategy]: Interpolation failed due to KNOWN_IGNORE: AbsInt can only provide a hoare triple checker if it generated fixpoints [2018-12-09 15:14:08,180 INFO L300 seRefinementStrategy]: The current sequences of interpolants are not accepted, trying to find more. [2018-12-09 15:14:08,181 INFO L192 anRefinementStrategy]: Switched to InterpolantGenerator mode Z3_IG No working directory specified, using /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/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-09 15:14:08,189 INFO L103 rtionOrderModulation]: Keeping assertion order OUTSIDE_LOOP_FIRST2 [2018-12-09 15:14:08,190 INFO L286 anRefinementStrategy]: Using traceCheck mode Z3_IG with AssertCodeBlockOrder OUTSIDE_LOOP_FIRST2 (IT: FPandBP) [2018-12-09 15:14:08,194 INFO L249 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2018-12-09 15:14:08,195 INFO L250 tOrderPrioritization]: Conjunction of SSA is unsat [2018-12-09 15:14:08,196 INFO L273 TraceCheckSpWp]: Computing forward predicates... [2018-12-09 15:14:08,226 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 15:14:08,226 INFO L316 TraceCheckSpWp]: Computing backward predicates... [2018-12-09 15:14:08,234 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2018-12-09 15:14:08,248 INFO L312 seRefinementStrategy]: Constructing automaton from 0 perfect and 3 imperfect interpolant sequences. [2018-12-09 15:14:08,248 INFO L327 seRefinementStrategy]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 6 [2018-12-09 15:14:08,248 INFO L249 anRefinementStrategy]: Using the first two imperfect interpolant sequences [2018-12-09 15:14:08,249 INFO L459 AbstractCegarLoop]: Interpolant automaton has 7 states [2018-12-09 15:14:08,249 INFO L142 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2018-12-09 15:14:08,249 INFO L144 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2018-12-09 15:14:08,249 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand 7 states. [2018-12-09 15:14:08,285 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2018-12-09 15:14:08,285 INFO L93 Difference]: Finished difference Result 40 states and 45 transitions. [2018-12-09 15:14:08,285 INFO L142 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2018-12-09 15:14:08,286 INFO L78 Accepts]: Start accepts. Automaton has 7 states. Word has length 29 [2018-12-09 15:14:08,286 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2018-12-09 15:14:08,286 INFO L225 Difference]: With dead ends: 40 [2018-12-09 15:14:08,286 INFO L226 Difference]: Without dead ends: 0 [2018-12-09 15:14:08,287 INFO L631 BasicCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 55 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-09 15:14:08,287 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 0 states. [2018-12-09 15:14:08,287 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 0 to 0. [2018-12-09 15:14:08,287 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 0 states. [2018-12-09 15:14:08,287 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 0 states to 0 states and 0 transitions. [2018-12-09 15:14:08,288 INFO L78 Accepts]: Start accepts. Automaton has 0 states and 0 transitions. Word has length 29 [2018-12-09 15:14:08,288 INFO L84 Accepts]: Finished accepts. word is rejected. [2018-12-09 15:14:08,288 INFO L480 AbstractCegarLoop]: Abstraction has 0 states and 0 transitions. [2018-12-09 15:14:08,288 INFO L481 AbstractCegarLoop]: Interpolant automaton has 7 states. [2018-12-09 15:14:08,288 INFO L276 IsEmpty]: Start isEmpty. Operand 0 states and 0 transitions. [2018-12-09 15:14:08,288 INFO L282 IsEmpty]: Finished isEmpty. No accepting run. [2018-12-09 15:14:08,292 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends 0 states and 0 transitions. [2018-12-09 15:14:08,360 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.initFINAL(line -1) the Hoare annotation is: true [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.initEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startEXIT(line -1) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L451 ceAbstractionStarter]: At program point L-1(line -1) the Hoare annotation is: true [2018-12-09 15:14:08,360 INFO L451 ceAbstractionStarter]: At program point ULTIMATE.startENTRY(line -1) the Hoare annotation is: true [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point ULTIMATE.startFINAL(line -1) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point L25(line 25) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point mainEXIT(lines 13 30) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point L25-1(line 25) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point L21(lines 21 26) no Hoare annotation was computed. [2018-12-09 15:14:08,360 INFO L448 ceAbstractionStarter]: For program point mainErr1ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L444 ceAbstractionStarter]: At program point L21-2(lines 20 27) the Hoare annotation is: (let ((.cse0 (<= 0 main_~j~0)) (.cse1 (<= main_~n~0 2147483647)) (.cse2 (<= 0 main_~i~0)) (.cse3 (<= main_~m~0 2147483646))) (or (and .cse0 .cse1 .cse2 (<= 1 main_~m~0) (<= main_~i~0 2147483646) .cse3) (and .cse0 .cse1 .cse2 .cse3 (<= (+ main_~j~0 1) main_~m~0)))) [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point L17(lines 17 28) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point L17-1(lines 17 28) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point mainFINAL(lines 13 30) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point mainErr3ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L451 ceAbstractionStarter]: At program point mainENTRY(lines 13 30) the Hoare annotation is: true [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point L22(line 22) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point L22-1(line 22) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point mainErr0ASSERT_VIOLATIONINTEGER_OVERFLOW(line 22) no Hoare annotation was computed. [2018-12-09 15:14:08,361 INFO L448 ceAbstractionStarter]: For program point mainErr2ASSERT_VIOLATIONINTEGER_OVERFLOW(line 25) no Hoare annotation was computed. [2018-12-09 15:14:08,369 INFO L202 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction CFG 09.12 03:14:08 BoogieIcfgContainer [2018-12-09 15:14:08,369 INFO L132 PluginConnector]: ------------------------ END TraceAbstraction---------------------------- [2018-12-09 15:14:08,370 INFO L113 PluginConnector]: ------------------------Witness Printer---------------------------- [2018-12-09 15:14:08,370 INFO L271 PluginConnector]: Initializing Witness Printer... [2018-12-09 15:14:08,370 INFO L276 PluginConnector]: Witness Printer initialized [2018-12-09 15:14:08,370 INFO L185 PluginConnector]: Executing the observer RCFGCatcher from plugin Witness Printer for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 09.12 03:14:07" (3/4) ... [2018-12-09 15:14:08,372 INFO L144 WitnessPrinter]: Generating witness for correct program [2018-12-09 15:14:08,375 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure ULTIMATE.init [2018-12-09 15:14:08,376 INFO L354 RCFGBacktranslator]: Ignoring RootEdge to procedure main [2018-12-09 15:14:08,378 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 6 nodes and edges [2018-12-09 15:14:08,378 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 3 nodes and edges [2018-12-09 15:14:08,378 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 15:14:08,378 INFO L905 BoogieBacktranslator]: Reduced CFG by removing 1 nodes and edges [2018-12-09 15:14:08,405 INFO L145 WitnessManager]: Wrote witness to /tmp/vcloud-vcloud-master/worker/working_dir_f34a8397-aa35-4cb0-a7dc-625ad710a9a1/bin-2019/utaipan/witness.graphml [2018-12-09 15:14:08,405 INFO L132 PluginConnector]: ------------------------ END Witness Printer---------------------------- [2018-12-09 15:14:08,405 INFO L168 Benchmark]: Toolchain (without parser) took 1527.96 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 949.7 MB in the beginning and 897.6 MB in the end (delta: 52.1 MB). Peak memory consumption was 162.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:14:08,406 INFO L168 Benchmark]: CDTParser took 0.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:14:08,407 INFO L168 Benchmark]: CACSL2BoogieTranslator took 125.75 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 MB in the end (delta: 10.7 MB). Peak memory consumption was 10.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:14:08,407 INFO L168 Benchmark]: Boogie Procedure Inliner took 11.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:14:08,407 INFO L168 Benchmark]: Boogie Preprocessor took 11.75 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. [2018-12-09 15:14:08,407 INFO L168 Benchmark]: RCFGBuilder took 146.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. [2018-12-09 15:14:08,407 INFO L168 Benchmark]: TraceAbstraction took 1194.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 900.3 MB in the end (delta: 196.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. [2018-12-09 15:14:08,408 INFO L168 Benchmark]: Witness Printer took 35.37 ms. Allocated memory is still 1.1 GB. Free memory was 900.3 MB in the beginning and 897.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. [2018-12-09 15:14:08,410 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.13 ms. Allocated memory is still 1.0 GB. Free memory is still 976.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * CACSL2BoogieTranslator took 125.75 ms. Allocated memory is still 1.0 GB. Free memory was 949.7 MB in the beginning and 939.0 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.47 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * Boogie Preprocessor took 11.75 ms. Allocated memory is still 1.0 GB. Free memory is still 939.0 MB. There was no memory consumed. Max. memory is 11.5 GB. * RCFGBuilder took 146.35 ms. Allocated memory was 1.0 GB in the beginning and 1.1 GB in the end (delta: 110.1 MB). Free memory was 939.0 MB in the beginning and 1.1 GB in the end (delta: -157.5 MB). Peak memory consumption was 15.6 MB. Max. memory is 11.5 GB. * TraceAbstraction took 1194.51 ms. Allocated memory is still 1.1 GB. Free memory was 1.1 GB in the beginning and 900.3 MB in the end (delta: 196.2 MB). Peak memory consumption was 196.2 MB. Max. memory is 11.5 GB. * Witness Printer took 35.37 ms. Allocated memory is still 1.1 GB. Free memory was 900.3 MB in the beginning and 897.6 MB in the end (delta: 2.7 MB). Peak memory consumption was 2.7 MB. Max. memory is 11.5 GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction: - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 22]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - PositiveResult [Line: 25]: integer overflow can never occur For all program executions holds that integer overflow can never occur at this location - AllSpecificationsHoldResult: All specifications hold 4 specifications checked. All of them hold - InvariantResult [Line: 20]: Loop Invariant Derived loop invariant: (((((0 <= j && n <= 2147483647) && 0 <= i) && 1 <= m) && i <= 2147483646) && m <= 2147483646) || ((((0 <= j && n <= 2147483647) && 0 <= i) && m <= 2147483646) && j + 1 <= m) - StatisticsResult: Ultimate Automizer benchmark data CFG has 3 procedures, 21 locations, 4 error locations. SAFE Result, 1.1s OverallTime, 9 OverallIterations, 6 TraceHistogramMax, 0.2s AutomataDifference, 0.0s DeadEndRemovalTime, 0.0s HoareAnnotationTime, HoareTripleCheckerStatistics: 103 SDtfs, 111 SDslu, 96 SDs, 0 SdLazy, 120 SolverSat, 48 SolverUnsat, 0 SolverUnknown, 0 SolverNotchecked, 0.1s Time, PredicateUnifierStatistics: 0 DeclaredPredicates, 188 GetRequests, 144 SyntacticMatches, 1 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 45 ImplicationChecksByTransitivity, 0.2s Time, 0.0s BasicInterpolantAutomatonTime, BiggestAbstraction: size=34occurred in iteration=5, traceCheckStatistics: No data available, InterpolantConsolidationStatistics: No data available, PathInvariantsStatistics: No data available, 0/0 InterpolantCoveringCapability, TotalInterpolationStatistics: No data available, 0.1s AbstIntTime, 2 AbstIntIterations, 0 AbstIntStrong, NaN AbsIntWeakeningRatio, NaN AbsIntAvgWeakeningVarsNumRemoved, NaN AbsIntAvgWeakenedConjuncts, 0.0s DumpTime, AutomataMinimizationStatistics: 0.0s AutomataMinimizationTime, 9 MinimizatonAttempts, 31 StatesRemovedByMinimization, 5 NontrivialMinimizations, HoareAnnotationStatistics: 0.0s HoareAnnotationTime, 5 LocationsWithAnnotation, 5 PreInvPairs, 14 NumberOfFragments, 42 HoareAnnotationTreeSize, 5 FomulaSimplifications, 622 FormulaSimplificationTreeSizeReduction, 0.0s HoareSimplificationTime, 5 FomulaSimplificationsInter, 60 FormulaSimplificationTreeSizeReductionInter, 0.0s HoareSimplificationTimeInter, RefinementEngineStatistics: TraceCheckStatistics: 0.0s SsaConstructionTime, 0.0s SatisfiabilityAnalysisTime, 0.3s InterpolantComputationTime, 207 NumberOfCodeBlocks, 179 NumberOfCodeBlocksAsserted, 13 NumberOfCheckSat, 266 ConstructedInterpolants, 0 QuantifiedInterpolants, 12154 SizeOfPredicates, 8 NumberOfNonLiveVariables, 132 ConjunctsInSsa, 15 ConjunctsInUnsatCore, 17 InterpolantComputations, 5 PerfectInterpolantSequences, 99/184 InterpolantCoveringCapability, InvariantSynthesisStatistics: No data available, InterpolantConsolidationStatistics: No data available, ReuseStatistics: No data available RESULT: Ultimate proved your program to be correct! Received shutdown request...